./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_add-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:26:34,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:26:34,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:26:34,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:26:34,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:26:34,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:26:34,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:26:34,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:26:34,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:26:34,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:26:34,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:26:34,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:26:34,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:26:34,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:26:34,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:26:34,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:26:34,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:26:34,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:26:34,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:26:34,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:26:34,733 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:26:34,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:26:34,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:26:34,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:26:34,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:26:34,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:26:34,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:26:34,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:26:34,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:26:34,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:26:34,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:26:34,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:26:34,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:26:34,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:26:34,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:26:34,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:26:34,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:26:34,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:26:34,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:26:34,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:26:34,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:26:34,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:26:34,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:26:34,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:26:34,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:26:34,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:26:34,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:26:34,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:26:34,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:26:34,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:26:34,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:26:34,788 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:26:34,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:26:34,789 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:26:34,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:26:34,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:26:34,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:26:34,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:26:34,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:26:34,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:26:34,791 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:26:34,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:26:34,791 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:26:34,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:26:34,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:26:34,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:26:34,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:26:34,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:26:34,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:26:34,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:26:34,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:26:34,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:26:34,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:26:34,794 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:26:34,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:26:34,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:26:34,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff [2022-07-12 03:26:34,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:26:35,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:26:35,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:26:35,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:26:35,010 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:26:35,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-12 03:26:35,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1ed6f8e/449beb12b990434d9bb31cba4821c2a8/FLAGdbf3b93ce [2022-07-12 03:26:35,437 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:26:35,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-12 03:26:35,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1ed6f8e/449beb12b990434d9bb31cba4821c2a8/FLAGdbf3b93ce [2022-07-12 03:26:35,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1ed6f8e/449beb12b990434d9bb31cba4821c2a8 [2022-07-12 03:26:35,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:26:35,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:26:35,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:35,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:26:35,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:26:35,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd01b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35, skipping insertion in model container [2022-07-12 03:26:35,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:26:35,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:26:35,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i[25793,25806] [2022-07-12 03:26:35,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:35,832 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:26:35,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i[25793,25806] [2022-07-12 03:26:35,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:35,896 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:26:35,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35 WrapperNode [2022-07-12 03:26:35,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:35,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:35,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:26:35,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:26:35,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,930 INFO L137 Inliner]: procedures = 135, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 55 [2022-07-12 03:26:35,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:35,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:26:35,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:26:35,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:26:35,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:26:35,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:26:35,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:26:35,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:26:35,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (1/1) ... [2022-07-12 03:26:35,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:26:35,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:26:35,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:26:35,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:26:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:26:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-12 03:26:36,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-12 03:26:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:26:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:26:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:26:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:26:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-12 03:26:36,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-12 03:26:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:26:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:26:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:26:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:26:36,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:26:36,086 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:26:36,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:26:36,248 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:26:36,252 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:26:36,252 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 03:26:36,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:26:36 BoogieIcfgContainer [2022-07-12 03:26:36,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:26:36,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:26:36,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:26:36,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:26:36,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:26:35" (1/3) ... [2022-07-12 03:26:36,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a159de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:26:36, skipping insertion in model container [2022-07-12 03:26:36,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:35" (2/3) ... [2022-07-12 03:26:36,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a159de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:26:36, skipping insertion in model container [2022-07-12 03:26:36,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:26:36" (3/3) ... [2022-07-12 03:26:36,263 INFO L111 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2022-07-12 03:26:36,272 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:26:36,275 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:26:36,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:26:36,318 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20b0a625, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2562ef07 [2022-07-12 03:26:36,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:26:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:26:36,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:36,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:36,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1019691704, now seen corresponding path program 1 times [2022-07-12 03:26:36,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:36,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294881981] [2022-07-12 03:26:36,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:26:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 03:26:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:26:36,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:36,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294881981] [2022-07-12 03:26:36,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294881981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:36,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:36,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:26:36,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403254089] [2022-07-12 03:26:36,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:36,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:26:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:26:36,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:26:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:26:36,556 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:36,568 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-07-12 03:26:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:26:36,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-12 03:26:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:36,576 INFO L225 Difference]: With dead ends: 59 [2022-07-12 03:26:36,576 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:26:36,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:26:36,580 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:36,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:26:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-12 03:26:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-12 03:26:36,604 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2022-07-12 03:26:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:36,605 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-12 03:26:36,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-12 03:26:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:26:36,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:36,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:36,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:26:36,606 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1544963960, now seen corresponding path program 1 times [2022-07-12 03:26:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:36,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277285621] [2022-07-12 03:26:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:36,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:26:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:36,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 03:26:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:26:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:36,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277285621] [2022-07-12 03:26:36,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277285621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:26:36,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215919350] [2022-07-12 03:26:36,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:26:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:26:36,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:26:36,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:26:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:36,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:26:36,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:26:36,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:36,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215919350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:36,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:26:36,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-12 03:26:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038162214] [2022-07-12 03:26:36,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:36,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:26:36,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:26:36,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:26:36,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:26:36,872 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:36,895 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-07-12 03:26:36,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:26:36,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-12 03:26:36,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:36,898 INFO L225 Difference]: With dead ends: 44 [2022-07-12 03:26:36,899 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:26:36,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:26:36,900 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:36,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:26:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 03:26:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 03:26:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-07-12 03:26:36,908 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2022-07-12 03:26:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:36,908 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-12 03:26:36,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-07-12 03:26:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:26:36,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:36,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:36,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 03:26:37,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:26:37,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1439032465, now seen corresponding path program 1 times [2022-07-12 03:26:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:37,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668671427] [2022-07-12 03:26:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:26:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:37,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 03:26:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:26:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:37,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668671427] [2022-07-12 03:26:37,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668671427] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:26:37,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710301117] [2022-07-12 03:26:37,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:37,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:26:37,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:26:37,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:26:37,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:26:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:37,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 03:26:37,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:26:37,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:37,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710301117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:37,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:26:37,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-07-12 03:26:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192927911] [2022-07-12 03:26:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:37,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:26:37,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:26:37,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:26:37,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:26:37,671 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:37,825 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-07-12 03:26:37,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:26:37,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-12 03:26:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:37,828 INFO L225 Difference]: With dead ends: 74 [2022-07-12 03:26:37,828 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:26:37,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-12 03:26:37,832 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:37,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:26:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-12 03:26:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-12 03:26:37,845 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 20 [2022-07-12 03:26:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:37,846 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-12 03:26:37,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-12 03:26:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:26:37,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:37,847 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:37,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:38,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 03:26:38,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1950106983, now seen corresponding path program 1 times [2022-07-12 03:26:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:38,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470066622] [2022-07-12 03:26:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:26:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:38,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 03:26:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 03:26:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:26:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470066622] [2022-07-12 03:26:38,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470066622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:38,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:38,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 03:26:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456777736] [2022-07-12 03:26:38,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:38,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 03:26:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:26:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 03:26:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:26:38,331 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:38,684 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-07-12 03:26:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:26:38,685 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-07-12 03:26:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:38,685 INFO L225 Difference]: With dead ends: 44 [2022-07-12 03:26:38,685 INFO L226 Difference]: Without dead ends: 37 [2022-07-12 03:26:38,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-07-12 03:26:38,686 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 97 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:38,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 66 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:26:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-12 03:26:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-12 03:26:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-12 03:26:38,690 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2022-07-12 03:26:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:38,691 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-12 03:26:38,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-12 03:26:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:26:38,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:38,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:38,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:26:38,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash -375503678, now seen corresponding path program 1 times [2022-07-12 03:26:38,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:38,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126504208] [2022-07-12 03:26:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:38,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:26:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 03:26:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:38,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 03:26:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:26:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126504208] [2022-07-12 03:26:38,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126504208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:38,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:38,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:26:38,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679022881] [2022-07-12 03:26:38,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:38,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:26:38,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:26:38,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:26:38,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:26:38,837 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:26:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:38,895 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-07-12 03:26:38,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:26:38,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-12 03:26:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:38,896 INFO L225 Difference]: With dead ends: 39 [2022-07-12 03:26:38,896 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 03:26:38,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:26:38,897 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:38,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 03:26:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-12 03:26:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-07-12 03:26:38,901 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2022-07-12 03:26:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:38,901 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-07-12 03:26:38,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:26:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-07-12 03:26:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 03:26:38,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:38,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:38,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:26:38,902 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:38,902 INFO L85 PathProgramCache]: Analyzing trace with hash -714160700, now seen corresponding path program 1 times [2022-07-12 03:26:38,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:38,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295664493] [2022-07-12 03:26:38,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:38,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:26:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:39,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 03:26:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:39,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 03:26:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:26:39,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:39,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295664493] [2022-07-12 03:26:39,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295664493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:26:39,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822802140] [2022-07-12 03:26:39,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:39,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:26:39,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:26:39,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:26:39,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:26:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:39,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-12 03:26:39,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:39,813 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:26:39,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:26:39,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:26:39,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:26:39,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:26:40,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:26:40,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:26:40,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:40,206 INFO L356 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2022-07-12 03:26:40,212 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:26:40,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:40,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:26:40,432 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| input size 70 context size 70 output size 70 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 03:26:40,436 INFO L158 Benchmark]: Toolchain (without parser) took 4971.14ms. Allocated memory was 100.7MB in the beginning and 163.6MB in the end (delta: 62.9MB). Free memory was 72.9MB in the beginning and 61.8MB in the end (delta: 11.1MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2022-07-12 03:26:40,436 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:26:40,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.79ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 72.9MB in the beginning and 93.7MB in the end (delta: -20.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:26:40,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.89ms. Allocated memory is still 125.8MB. Free memory was 93.7MB in the beginning and 91.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:26:40,437 INFO L158 Benchmark]: Boogie Preprocessor took 23.45ms. Allocated memory is still 125.8MB. Free memory was 91.9MB in the beginning and 90.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:26:40,437 INFO L158 Benchmark]: RCFGBuilder took 296.83ms. Allocated memory is still 125.8MB. Free memory was 90.2MB in the beginning and 77.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:26:40,437 INFO L158 Benchmark]: TraceAbstraction took 4180.50ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 76.9MB in the beginning and 61.8MB in the end (delta: 15.1MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2022-07-12 03:26:40,438 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.79ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 72.9MB in the beginning and 93.7MB in the end (delta: -20.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.89ms. Allocated memory is still 125.8MB. Free memory was 93.7MB in the beginning and 91.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.45ms. Allocated memory is still 125.8MB. Free memory was 91.9MB in the beginning and 90.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 296.83ms. Allocated memory is still 125.8MB. Free memory was 90.2MB in the beginning and 77.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4180.50ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 76.9MB in the beginning and 61.8MB in the end (delta: 15.1MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| input size 70 context size 70 output size 70 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| input size 70 context size 70 output size 70: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 03:26:40,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_add-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:26:42,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:26:42,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:26:42,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:26:42,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:26:42,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:26:42,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:26:42,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:26:42,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:26:42,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:26:42,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:26:42,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:26:42,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:26:42,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:26:42,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:26:42,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:26:42,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:26:42,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:26:42,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:26:42,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:26:42,389 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:26:42,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:26:42,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:26:42,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:26:42,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:26:42,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:26:42,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:26:42,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:26:42,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:26:42,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:26:42,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:26:42,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:26:42,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:26:42,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:26:42,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:26:42,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:26:42,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:26:42,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:26:42,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:26:42,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:26:42,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:26:42,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:26:42,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:26:42,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:26:42,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:26:42,429 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:26:42,429 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:26:42,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:26:42,430 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:26:42,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:26:42,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:26:42,431 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:26:42,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:26:42,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:26:42,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:26:42,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:26:42,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:26:42,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:26:42,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:26:42,439 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:26:42,439 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:26:42,439 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:26:42,440 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:26:42,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:26:42,440 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:26:42,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:26:42,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:26:42,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:26:42,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:26:42,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:26:42,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:26:42,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:26:42,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:26:42,442 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:26:42,443 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:26:42,443 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:26:42,443 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:26:42,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:26:42,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:26:42,444 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff [2022-07-12 03:26:42,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:26:42,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:26:42,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:26:42,748 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:26:42,748 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:26:42,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-12 03:26:42,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21cd7b68/f00953ee3a12464ea1f0872a982384a0/FLAGbd36cced6 [2022-07-12 03:26:43,220 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:26:43,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-12 03:26:43,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21cd7b68/f00953ee3a12464ea1f0872a982384a0/FLAGbd36cced6 [2022-07-12 03:26:43,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21cd7b68/f00953ee3a12464ea1f0872a982384a0 [2022-07-12 03:26:43,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:26:43,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:26:43,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:43,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:26:43,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:26:43,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4298f938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43, skipping insertion in model container [2022-07-12 03:26:43,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:26:43,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:26:43,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i[25793,25806] [2022-07-12 03:26:43,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:43,569 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 03:26:43,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:26:43,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i[25793,25806] [2022-07-12 03:26:43,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:43,613 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:26:43,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i[25793,25806] [2022-07-12 03:26:43,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:43,677 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:26:43,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43 WrapperNode [2022-07-12 03:26:43,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:43,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:43,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:26:43,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:26:43,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,726 INFO L137 Inliner]: procedures = 138, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 53 [2022-07-12 03:26:43,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:43,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:26:43,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:26:43,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:26:43,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:26:43,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:26:43,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:26:43,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:26:43,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (1/1) ... [2022-07-12 03:26:43,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:26:43,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:26:43,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:26:43,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:26:43,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:26:43,832 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-12 03:26:43,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-12 03:26:43,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:26:43,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:26:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:26:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-12 03:26:43,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-12 03:26:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:26:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:26:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:26:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:26:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:26:43,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:26:43,962 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:26:43,964 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:26:44,224 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:26:44,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:26:44,230 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 03:26:44,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:26:44 BoogieIcfgContainer [2022-07-12 03:26:44,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:26:44,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:26:44,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:26:44,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:26:44,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:26:43" (1/3) ... [2022-07-12 03:26:44,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfca824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:26:44, skipping insertion in model container [2022-07-12 03:26:44,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:43" (2/3) ... [2022-07-12 03:26:44,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfca824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:26:44, skipping insertion in model container [2022-07-12 03:26:44,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:26:44" (3/3) ... [2022-07-12 03:26:44,241 INFO L111 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2022-07-12 03:26:44,252 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:26:44,252 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:26:44,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:26:44,308 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@618f0ed6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2677c111 [2022-07-12 03:26:44,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:26:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:26:44,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:44,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:44,316 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash -313984218, now seen corresponding path program 1 times [2022-07-12 03:26:44,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:44,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133607822] [2022-07-12 03:26:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:44,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:44,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:44,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:44,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:26:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:44,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:26:44,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:26:44,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:44,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:44,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133607822] [2022-07-12 03:26:44,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133607822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:44,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:44,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:26:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367755834] [2022-07-12 03:26:44,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:44,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:26:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:44,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:26:44,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:26:44,514 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:44,526 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-07-12 03:26:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:26:44,527 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-12 03:26:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:44,531 INFO L225 Difference]: With dead ends: 55 [2022-07-12 03:26:44,531 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 03:26:44,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:26:44,536 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:44,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 03:26:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-12 03:26:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-12 03:26:44,563 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-07-12 03:26:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:44,564 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-12 03:26:44,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-12 03:26:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:26:44,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:44,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:44,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 03:26:44,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:26:44,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:44,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash 160343226, now seen corresponding path program 1 times [2022-07-12 03:26:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:44,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248231106] [2022-07-12 03:26:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:44,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:44,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:44,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:44,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:26:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:44,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:26:44,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:26:44,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:44,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:44,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248231106] [2022-07-12 03:26:44,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248231106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:44,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:44,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:26:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710876519] [2022-07-12 03:26:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:44,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:26:44,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:44,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:26:44,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:26:44,882 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:44,912 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-12 03:26:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:26:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-12 03:26:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:44,915 INFO L225 Difference]: With dead ends: 40 [2022-07-12 03:26:44,915 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 03:26:44,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:26:44,916 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:44,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 03:26:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-12 03:26:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 03:26:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-12 03:26:44,927 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2022-07-12 03:26:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:44,928 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-12 03:26:44,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-12 03:26:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:26:44,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:44,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:44,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-12 03:26:45,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:26:45,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:45,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:45,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1203047025, now seen corresponding path program 1 times [2022-07-12 03:26:45,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:45,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839305512] [2022-07-12 03:26:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:45,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:45,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:45,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:45,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:26:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:45,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 03:26:45,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:26:45,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:45,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:45,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839305512] [2022-07-12 03:26:45,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839305512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:45,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:45,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:26:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532869489] [2022-07-12 03:26:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:45,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:26:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:45,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:26:45,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:26:45,471 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:45,962 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-12 03:26:45,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:26:45,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-12 03:26:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:45,964 INFO L225 Difference]: With dead ends: 69 [2022-07-12 03:26:45,964 INFO L226 Difference]: Without dead ends: 32 [2022-07-12 03:26:45,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:26:45,965 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 33 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:45,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 95 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 03:26:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-12 03:26:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-12 03:26:45,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-12 03:26:45,971 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 18 [2022-07-12 03:26:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:45,971 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-12 03:26:45,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:26:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-12 03:26:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:26:45,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:45,973 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:45,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 03:26:46,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:26:46,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1209896972, now seen corresponding path program 1 times [2022-07-12 03:26:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:46,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242994073] [2022-07-12 03:26:46,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:46,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:46,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:46,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:26:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:46,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 03:26:46,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:46,418 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:26:46,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-12 03:26:46,707 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-12 03:26:46,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-12 03:26:46,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:46,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:46,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:47,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:47,260 INFO L356 Elim1Store]: treesize reduction 106, result has 23.2 percent of original size [2022-07-12 03:26:47,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 157 treesize of output 313 [2022-07-12 03:26:47,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:47,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:47,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:47,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:47,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:47,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:47,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 129 [2022-07-12 03:26:47,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 11 [2022-07-12 03:26:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:26:48,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:26:48,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:26:48,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3014 treesize of output 2943 [2022-07-12 03:26:48,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3638 treesize of output 3510 [2022-07-12 03:26:48,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3862 treesize of output 3798 [2022-07-12 03:26:48,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3798 treesize of output 3766 [2022-07-12 03:26:48,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3766 treesize of output 3750 [2022-07-12 03:26:48,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:49,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:49,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:49,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-12 03:26:49,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:49,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:49,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242994073] [2022-07-12 03:26:49,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242994073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:26:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [649505678] [2022-07-12 03:26:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:49,208 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 03:26:49,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 03:26:49,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 03:26:49,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-07-12 03:26:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:49,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 03:26:49,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:49,468 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:26:49,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-12 03:26:49,791 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-12 03:26:49,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-12 03:26:49,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:49,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:49,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:50,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:50,204 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-12 03:26:50,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 95 treesize of output 84 [2022-07-12 03:26:50,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:50,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:50,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2022-07-12 03:26:50,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:50,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:50,321 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 03:26:50,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 16 [2022-07-12 03:26:50,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:26:50,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:26:51,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:26:51,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3014 treesize of output 2943 [2022-07-12 03:26:51,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3638 treesize of output 3510 [2022-07-12 03:26:51,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3862 treesize of output 3798 [2022-07-12 03:26:51,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3798 treesize of output 3782 [2022-07-12 03:26:51,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3782 treesize of output 3750 [2022-07-12 03:26:51,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:51,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:51,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-12 03:26:51,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:51,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:51,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [649505678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:26:51,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:26:51,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-12 03:26:51,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811522597] [2022-07-12 03:26:51,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:26:51,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 03:26:51,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:51,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 03:26:51,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=731, Unknown=6, NotChecked=0, Total=870 [2022-07-12 03:26:51,470 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 22 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 03:26:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:52,024 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-07-12 03:26:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:26:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2022-07-12 03:26:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:52,025 INFO L225 Difference]: With dead ends: 41 [2022-07-12 03:26:52,025 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 03:26:52,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=258, Invalid=1142, Unknown=6, NotChecked=0, Total=1406 [2022-07-12 03:26:52,026 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 118 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:52,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 128 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 112 Invalid, 0 Unknown, 16 Unchecked, 0.2s Time] [2022-07-12 03:26:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 03:26:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-12 03:26:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-12 03:26:52,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2022-07-12 03:26:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:52,031 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-12 03:26:52,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 03:26:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-12 03:26:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:26:52,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:52,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:52,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:52,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:52,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 03:26:52,450 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:52,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1260690627, now seen corresponding path program 1 times [2022-07-12 03:26:52,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:52,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751900556] [2022-07-12 03:26:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:52,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:52,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:52,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:52,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:26:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:52,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:26:52,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:26:52,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:52,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:52,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751900556] [2022-07-12 03:26:52,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751900556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:52,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:52,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:26:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903600025] [2022-07-12 03:26:52,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:52,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:26:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:52,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:26:52,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:26:52,559 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:26:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:52,566 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-07-12 03:26:52,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:26:52,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-12 03:26:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:52,567 INFO L225 Difference]: With dead ends: 36 [2022-07-12 03:26:52,567 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:26:52,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:26:52,568 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:52,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:26:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 03:26:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:26:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-07-12 03:26:52,571 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2022-07-12 03:26:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:52,572 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-07-12 03:26:52,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:26:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-07-12 03:26:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:26:52,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:52,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:26:52,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:52,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:26:52,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:52,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:52,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1228732403, now seen corresponding path program 1 times [2022-07-12 03:26:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:52,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948311874] [2022-07-12 03:26:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:52,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:52,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:52,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:52,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 03:26:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:52,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 03:26:52,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:53,066 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:26:53,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-12 03:26:53,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2022-07-12 03:26:53,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:53,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:26:53,437 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-12 03:26:53,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-12 03:26:53,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:53,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:53,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:53,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:53,942 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-12 03:26:53,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 170 [2022-07-12 03:26:53,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:53,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:54,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:54,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:54,062 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 03:26:54,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 51 [2022-07-12 03:26:54,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:54,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:54,306 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-12 03:26:54,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-12 03:26:54,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:54,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:54,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:26:54,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:54,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:54,447 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-12 03:26:54,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 94 [2022-07-12 03:26:54,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:54,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:54,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:54,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:54,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2022-07-12 03:26:54,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:54,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:54,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:54,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2022-07-12 03:26:54,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:26:54,767 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|))) (let ((.cse4 (not .cse1)) (.cse3 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|))) (and (let ((.cse0 (= |c___ldv_list_add_#in~new.offset| (select (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|)))) (or (and (or .cse0 (and .cse0 .cse1 (exists ((v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_46) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_47) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_48) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_46) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_47) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_48))) (and (= v_DerPreprocessor_46 (select .cse2 |c___ldv_list_add_#in~next.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_48 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse2 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_47)))))) .cse3) (and .cse0 .cse4 (exists ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_40) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_41) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_42) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_40) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_41) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_42))) (let ((.cse9 (store (store (store (store (store (store .cse8 |c___ldv_list_add_#in~next.base| v_DerPreprocessor_49) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_50) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_51) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_49) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_50) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_51))) (let ((.cse7 (select .cse9 |c___ldv_list_add_#in~next.base|)) (.cse5 (select .cse8 |c___ldv_list_add_#in~next.base|)) (.cse6 (select .cse9 |c___ldv_list_add_#in~new.base|))) (and (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_51 |c___ldv_list_add_#in~prev.offset|)) (= .cse5 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_42 |c___ldv_list_add_#in~prev.offset|)) (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) .cse6) (= v_DerPreprocessor_49 .cse7) (= .cse5 .cse7) (= .cse5 v_DerPreprocessor_40) (= (select .cse8 |c___ldv_list_add_#in~new.base|) .cse6))))))) (and .cse0 .cse1 (exists ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_43) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_44) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_45) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_43) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_44) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_45))) (let ((.cse10 (select .cse11 |c___ldv_list_add_#in~next.base|))) (and (= .cse10 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)) (= (select .cse11 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_44) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_45 |c___ldv_list_add_#in~prev.offset|)) (= v_DerPreprocessor_43 .cse10)))))))) (let ((.cse12 (= (select (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.base|)) (.cse16 (not .cse3))) (or (and .cse4 (or (and .cse12 (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_37) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_38) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_39) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_37) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_38) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_39))) (let ((.cse15 (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~new.base|)) (.cse14 (store (store (store (store (store (store .cse13 |c___ldv_list_add_#in~next.base| v_DerPreprocessor_34) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_34) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36))) (and (= |c___ldv_list_add_#in~new.base| (select v_DerPreprocessor_39 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse13 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_37) (= (select .cse14 |c___ldv_list_add_#in~new.base|) .cse15) (= .cse15 (select .cse13 |c___ldv_list_add_#in~new.base|)) (= |c___ldv_list_add_#in~new.base| (select v_DerPreprocessor_36 |c___ldv_list_add_#in~prev.offset|)) (= v_DerPreprocessor_34 (select .cse14 |c___ldv_list_add_#in~next.base|))))))) (and .cse12 .cse16))) (and .cse12 (or (and .cse3 (exists ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_31) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_31) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33))) (and (= (select v_DerPreprocessor_33 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.base|) (= v_DerPreprocessor_31 (select .cse17 |c___ldv_list_add_#in~next.base|)) (= (select .cse17 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_32))))) (and .cse16 (exists ((v_prenex_59 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base| v_prenex_60) |c___ldv_list_add_#in~new.base| v_prenex_59) |c___ldv_list_add_#in~prev.base| v_prenex_58) |c___ldv_list_add_#in~next.base| v_prenex_60) |c___ldv_list_add_#in~new.base| v_prenex_59) |c___ldv_list_add_#in~prev.base| v_prenex_58))) (and (= (select .cse18 |c___ldv_list_add_#in~new.base|) v_prenex_59) (= (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base|) (select .cse18 |c___ldv_list_add_#in~next.base|)) (= |c___ldv_list_add_#in~new.base| (select v_prenex_58 |c___ldv_list_add_#in~prev.offset|)))))) (exists ((v_prenex_58 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_prenex_59 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base| v_prenex_60) |c___ldv_list_add_#in~new.base| v_prenex_59) |c___ldv_list_add_#in~prev.base| v_prenex_58) |c___ldv_list_add_#in~next.base| v_prenex_60) |c___ldv_list_add_#in~new.base| v_prenex_59) |c___ldv_list_add_#in~prev.base| v_prenex_58))) (let ((.cse19 (select .cse20 |c___ldv_list_add_#in~next.base|))) (and (= |c___ldv_list_add_#in~new.base| (select .cse19 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse20 |c___ldv_list_add_#in~new.base|) v_prenex_59) (= .cse19 v_prenex_60) (= (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base|) .cse19))))) (= |c___ldv_list_add_#in~new.base| (select v_prenex_58 |c___ldv_list_add_#in~prev.offset|))))) .cse1))) (exists ((v_ArrVal_290 (_ BitVec 8)) (v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_291 (_ BitVec 8))) (= |c_#memory_int| (store (let ((.cse21 (store |c_old(#memory_int)| |c___ldv_list_add_#in~next.base| v_ArrVal_277))) (store .cse21 |c___ldv_list_add_#in~new.base| (store (store (select .cse21 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v_ArrVal_291) (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)) v_ArrVal_290))) |c___ldv_list_add_#in~prev.base| v_ArrVal_275))) (= (_ bv3 32) |c_~#s1~0.base|)))) is different from true [2022-07-12 03:26:54,922 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|))) (let ((.cse4 (not .cse2)) (.cse1 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|))) (and (let ((.cse0 (= |c___ldv_list_add_#in~new.offset| (select (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|)))) (or (and .cse0 .cse1) (and .cse0 .cse2 (exists ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_43) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_44) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_45) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_43) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_44) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_45))) (and (= (select .cse3 |c___ldv_list_add_#in~next.base|) (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)) (= (select .cse3 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_44) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_45 |c___ldv_list_add_#in~prev.offset|)))))) (and .cse0 .cse4 (exists ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_40) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_41) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_42) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_40) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_41) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_42))) (let ((.cse9 (store (store (store (store (store (store .cse8 |c___ldv_list_add_#in~next.base| v_DerPreprocessor_49) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_50) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_51) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_49) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_50) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_51))) (let ((.cse7 (select .cse9 |c___ldv_list_add_#in~next.base|)) (.cse5 (select .cse8 |c___ldv_list_add_#in~next.base|)) (.cse6 (select .cse9 |c___ldv_list_add_#in~new.base|))) (and (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_51 |c___ldv_list_add_#in~prev.offset|)) (= .cse5 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_42 |c___ldv_list_add_#in~prev.offset|)) (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) .cse6) (= v_DerPreprocessor_49 .cse7) (= .cse5 .cse7) (= .cse5 v_DerPreprocessor_40) (= (select .cse8 |c___ldv_list_add_#in~new.base|) .cse6))))))))) (let ((.cse10 (= (select (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.base|)) (.cse14 (not .cse1))) (or (and .cse4 (or (and .cse10 (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_37) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_38) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_39) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_37) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_38) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_39))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~new.base|)) (.cse12 (store (store (store (store (store (store .cse11 |c___ldv_list_add_#in~next.base| v_DerPreprocessor_34) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_34) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36))) (and (= |c___ldv_list_add_#in~new.base| (select v_DerPreprocessor_39 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse11 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_37) (= (select .cse12 |c___ldv_list_add_#in~new.base|) .cse13) (= .cse13 (select .cse11 |c___ldv_list_add_#in~new.base|)) (= |c___ldv_list_add_#in~new.base| (select v_DerPreprocessor_36 |c___ldv_list_add_#in~prev.offset|)) (= v_DerPreprocessor_34 (select .cse12 |c___ldv_list_add_#in~next.base|))))))) (and .cse10 .cse14))) (and .cse10 (or (and .cse1 (exists ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_31) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_31) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33))) (and (= (select v_DerPreprocessor_33 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.base|) (= v_DerPreprocessor_31 (select .cse15 |c___ldv_list_add_#in~next.base|)) (= (select .cse15 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_32))))) (and .cse14 (exists ((v_prenex_59 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base| v_prenex_60) |c___ldv_list_add_#in~new.base| v_prenex_59) |c___ldv_list_add_#in~prev.base| v_prenex_58) |c___ldv_list_add_#in~next.base| v_prenex_60) |c___ldv_list_add_#in~new.base| v_prenex_59) |c___ldv_list_add_#in~prev.base| v_prenex_58))) (and (= (select .cse16 |c___ldv_list_add_#in~new.base|) v_prenex_59) (= (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base|) (select .cse16 |c___ldv_list_add_#in~next.base|)) (= |c___ldv_list_add_#in~new.base| (select v_prenex_58 |c___ldv_list_add_#in~prev.offset|)))))) (exists ((v_prenex_58 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_prenex_59 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base| v_prenex_60) |c___ldv_list_add_#in~new.base| v_prenex_59) |c___ldv_list_add_#in~prev.base| v_prenex_58) |c___ldv_list_add_#in~next.base| v_prenex_60) |c___ldv_list_add_#in~new.base| v_prenex_59) |c___ldv_list_add_#in~prev.base| v_prenex_58))) (let ((.cse17 (select .cse18 |c___ldv_list_add_#in~next.base|))) (and (= |c___ldv_list_add_#in~new.base| (select .cse17 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse18 |c___ldv_list_add_#in~new.base|) v_prenex_59) (= .cse17 v_prenex_60) (= (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base|) .cse17))))) (= |c___ldv_list_add_#in~new.base| (select v_prenex_58 |c___ldv_list_add_#in~prev.offset|))))) .cse2))) (exists ((v_ArrVal_290 (_ BitVec 8)) (v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_291 (_ BitVec 8))) (= |c_#memory_int| (store (let ((.cse19 (store |c_old(#memory_int)| |c___ldv_list_add_#in~next.base| v_ArrVal_277))) (store .cse19 |c___ldv_list_add_#in~new.base| (store (store (select .cse19 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v_ArrVal_291) (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)) v_ArrVal_290))) |c___ldv_list_add_#in~prev.base| v_ArrVal_275))) (= (_ bv3 32) |c_~#s1~0.base|)))) is different from true [2022-07-12 03:26:54,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:54,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2022-07-12 03:26:54,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 59 [2022-07-12 03:26:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:26:55,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:26:56,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:26:56,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17822 treesize of output 17686 [2022-07-12 03:26:56,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21118 treesize of output 20990 [2022-07-12 03:26:57,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:26:57,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1142134 treesize of output 1128062 [2022-07-12 03:26:57,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1477750 treesize of output 1457270 [2022-07-12 03:26:58,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1691894 treesize of output 1676534 [2022-07-12 03:26:58,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2145782 treesize of output 2115062 [2022-07-12 03:26:59,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2115062 treesize of output 2111222 [2022-07-12 03:27:00,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2111222 treesize of output 2103542 [2022-07-12 03:27:01,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2103542 treesize of output 2101494 [2022-07-12 03:27:02,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2101494 treesize of output 2097398 [2022-07-12 03:27:13,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1049718 treesize of output 1047670