./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-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 --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 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:33:08,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:33:08,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 18:33:08,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:33:08,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:33:08,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:33:08,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:33:08,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:33:08,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:33:08,394 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:33:08,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:33:08,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:33:08,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:33:08,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:33:08,395 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:33:08,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:33:08,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:33:08,396 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:33:08,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 18:33:08,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:33:08,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:33:08,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:33:08,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:33:08,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:33:08,404 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:33:08,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:33:08,404 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:33:08,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:33:08,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:33:08,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:33:08,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:33:08,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:33:08,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:33:08,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:33:08,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:33:08,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 18:33:08,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 18:33:08,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:33:08,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:33:08,407 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:33:08,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:33:08,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:33:08,408 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 18:33:08,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:33:08,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:33:08,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:33:08,665 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:33:08,665 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:33:08,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2023-11-22 18:33:09,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:33:09,838 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:33:09,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2023-11-22 18:33:09,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/452452c14/789f3e77452a475ab18cc41bd257ff06/FLAG27cf6c769 [2023-11-22 18:33:09,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/452452c14/789f3e77452a475ab18cc41bd257ff06 [2023-11-22 18:33:09,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:33:09,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:33:09,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:33:09,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:33:09,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:33:09,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:33:09" (1/1) ... [2023-11-22 18:33:09,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17330c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:09, skipping insertion in model container [2023-11-22 18:33:09,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:33:09" (1/1) ... [2023-11-22 18:33:09,890 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:33:10,124 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2023-11-22 18:33:10,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:33:10,135 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:33:10,168 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2023-11-22 18:33:10,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:33:10,196 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:33:10,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10 WrapperNode [2023-11-22 18:33:10,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:33:10,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:33:10,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:33:10,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:33:10,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,235 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 210 [2023-11-22 18:33:10,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:33:10,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:33:10,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:33:10,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:33:10,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,251 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,264 INFO L189 HeapSplitter]: Split 40 memory accesses to 3 slices as follows [2, 12, 26] [2023-11-22 18:33:10,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:33:10,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:33:10,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:33:10,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:33:10,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (1/1) ... [2023-11-22 18:33:10,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:33:10,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:10,302 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) [2023-11-22 18:33:10,321 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 [2023-11-22 18:33:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-22 18:33:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-22 18:33:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 18:33:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 18:33:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 18:33:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 18:33:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 18:33:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 18:33:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 18:33:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:33:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 18:33:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 18:33:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 18:33:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 18:33:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 18:33:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 18:33:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 18:33:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 18:33:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 18:33:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 18:33:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:33:10,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:33:10,438 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:33:10,440 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:33:10,468 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-22 18:33:10,676 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:33:10,706 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:33:10,707 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-22 18:33:10,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:33:10 BoogieIcfgContainer [2023-11-22 18:33:10,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:33:10,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:33:10,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:33:10,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:33:10,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:33:09" (1/3) ... [2023-11-22 18:33:10,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cbd60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:33:10, skipping insertion in model container [2023-11-22 18:33:10,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:10" (2/3) ... [2023-11-22 18:33:10,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cbd60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:33:10, skipping insertion in model container [2023-11-22 18:33:10,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:33:10" (3/3) ... [2023-11-22 18:33:10,713 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2023-11-22 18:33:10,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:33:10,725 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:33:10,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:33:10,760 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=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59d03382, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:33:10,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:33:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 47 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 18:33:10,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:10,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:33:10,769 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:10,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1035494790, now seen corresponding path program 1 times [2023-11-22 18:33:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505383011] [2023-11-22 18:33:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:33:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505383011] [2023-11-22 18:33:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505383011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:33:10,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:33:10,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:33:10,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328244824] [2023-11-22 18:33:10,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:33:10,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 18:33:10,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:10,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 18:33:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:33:10,933 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 47 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:10,952 INFO L93 Difference]: Finished difference Result 97 states and 155 transitions. [2023-11-22 18:33:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 18:33:10,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-22 18:33:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:10,959 INFO L225 Difference]: With dead ends: 97 [2023-11-22 18:33:10,959 INFO L226 Difference]: Without dead ends: 42 [2023-11-22 18:33:10,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:33:10,964 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:10,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:33:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-22 18:33:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-22 18:33:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2023-11-22 18:33:10,987 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 15 [2023-11-22 18:33:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:10,988 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-11-22 18:33:10,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2023-11-22 18:33:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 18:33:10,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:10,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:33:10,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 18:33:10,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:10,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:10,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1634113901, now seen corresponding path program 1 times [2023-11-22 18:33:10,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:10,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35017414] [2023-11-22 18:33:10,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:10,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:33:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35017414] [2023-11-22 18:33:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35017414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:33:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:33:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:33:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110194576] [2023-11-22 18:33:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:33:11,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 18:33:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 18:33:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:33:11,045 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:11,058 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2023-11-22 18:33:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 18:33:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-22 18:33:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:11,061 INFO L225 Difference]: With dead ends: 70 [2023-11-22 18:33:11,062 INFO L226 Difference]: Without dead ends: 50 [2023-11-22 18:33:11,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:33:11,065 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:11,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:33:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-22 18:33:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-22 18:33:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.469387755102041) internal successors, (72), 49 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2023-11-22 18:33:11,079 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 20 [2023-11-22 18:33:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:11,080 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2023-11-22 18:33:11,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2023-11-22 18:33:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 18:33:11,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:11,082 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-22 18:33:11,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 18:33:11,082 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:11,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1678369216, now seen corresponding path program 1 times [2023-11-22 18:33:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650166882] [2023-11-22 18:33:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:11,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:33:11,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650166882] [2023-11-22 18:33:11,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650166882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:33:11,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:33:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 18:33:11,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48847997] [2023-11-22 18:33:11,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:33:11,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:33:11,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:11,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:33:11,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:33:11,298 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:11,475 INFO L93 Difference]: Finished difference Result 153 states and 220 transitions. [2023-11-22 18:33:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 18:33:11,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-22 18:33:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:11,476 INFO L225 Difference]: With dead ends: 153 [2023-11-22 18:33:11,477 INFO L226 Difference]: Without dead ends: 117 [2023-11-22 18:33:11,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:33:11,478 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 95 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:11,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 183 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:33:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-22 18:33:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2023-11-22 18:33:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.5) internal successors, (108), 72 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2023-11-22 18:33:11,485 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 26 [2023-11-22 18:33:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:11,485 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2023-11-22 18:33:11,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2023-11-22 18:33:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 18:33:11,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:11,486 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-22 18:33:11,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 18:33:11,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:11,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash 860720766, now seen corresponding path program 1 times [2023-11-22 18:33:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390671767] [2023-11-22 18:33:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:11,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:11,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390671767] [2023-11-22 18:33:11,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390671767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:33:11,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:33:11,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 18:33:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247027327] [2023-11-22 18:33:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:33:11,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:33:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:11,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:33:11,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:33:11,579 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:11,650 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2023-11-22 18:33:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:33:11,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-22 18:33:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:11,653 INFO L225 Difference]: With dead ends: 98 [2023-11-22 18:33:11,653 INFO L226 Difference]: Without dead ends: 94 [2023-11-22 18:33:11,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:33:11,658 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 17 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:11,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 194 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:33:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-22 18:33:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2023-11-22 18:33:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 81 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-11-22 18:33:11,671 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 26 [2023-11-22 18:33:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:11,671 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-11-22 18:33:11,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-11-22 18:33:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 18:33:11,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:11,673 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-22 18:33:11,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 18:33:11,673 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:11,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1727351847, now seen corresponding path program 1 times [2023-11-22 18:33:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:11,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170029097] [2023-11-22 18:33:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:11,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:11,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170029097] [2023-11-22 18:33:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170029097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:33:11,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:33:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 18:33:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194215184] [2023-11-22 18:33:11,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:33:11,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:33:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:11,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:33:11,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:33:11,789 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:11,846 INFO L93 Difference]: Finished difference Result 100 states and 139 transitions. [2023-11-22 18:33:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:33:11,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 18:33:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:11,849 INFO L225 Difference]: With dead ends: 100 [2023-11-22 18:33:11,849 INFO L226 Difference]: Without dead ends: 92 [2023-11-22 18:33:11,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:33:11,851 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:11,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 199 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:33:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-22 18:33:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2023-11-22 18:33:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.481012658227848) internal successors, (117), 79 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2023-11-22 18:33:11,858 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 28 [2023-11-22 18:33:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:11,858 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2023-11-22 18:33:11,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2023-11-22 18:33:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 18:33:11,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:11,859 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-22 18:33:11,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 18:33:11,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:11,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash -702648871, now seen corresponding path program 1 times [2023-11-22 18:33:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:11,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851424859] [2023-11-22 18:33:11,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:11,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:11,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851424859] [2023-11-22 18:33:11,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851424859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:33:11,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:33:11,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 18:33:11,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509870515] [2023-11-22 18:33:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:33:11,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:33:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:11,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:33:11,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:33:11,942 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:11,986 INFO L93 Difference]: Finished difference Result 100 states and 139 transitions. [2023-11-22 18:33:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:33:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 18:33:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:11,987 INFO L225 Difference]: With dead ends: 100 [2023-11-22 18:33:11,987 INFO L226 Difference]: Without dead ends: 89 [2023-11-22 18:33:11,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:33:11,988 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:11,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 187 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:33:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-22 18:33:11,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2023-11-22 18:33:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.486842105263158) internal successors, (113), 76 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2023-11-22 18:33:11,992 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 28 [2023-11-22 18:33:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:11,992 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2023-11-22 18:33:11,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2023-11-22 18:33:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 18:33:11,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:11,993 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-11-22 18:33:11,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 18:33:11,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:11,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1486366107, now seen corresponding path program 1 times [2023-11-22 18:33:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:11,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515039590] [2023-11-22 18:33:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515039590] [2023-11-22 18:33:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515039590] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158032471] [2023-11-22 18:33:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:12,207 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) [2023-11-22 18:33:12,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 18:33:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:12,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-22 18:33:12,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:12,349 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:12,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:33:12,420 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:33:12,421 INFO L378 Elim1Store]: Elim1 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 [2023-11-22 18:33:12,456 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-22 18:33:12,485 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:33:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:12,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:12,524 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2023-11-22 18:33:12,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:12,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-22 18:33:12,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:12,598 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 33 [2023-11-22 18:33:12,603 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 7 [2023-11-22 18:33:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-22 18:33:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158032471] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:33:12,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:33:12,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2023-11-22 18:33:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124662594] [2023-11-22 18:33:12,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:33:12,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 18:33:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:12,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 18:33:12,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=83, Unknown=3, NotChecked=18, Total=132 [2023-11-22 18:33:12,709 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:13,074 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2023-11-22 18:33:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 18:33:13,075 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-22 18:33:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:13,076 INFO L225 Difference]: With dead ends: 102 [2023-11-22 18:33:13,076 INFO L226 Difference]: Without dead ends: 98 [2023-11-22 18:33:13,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=171, Unknown=3, NotChecked=28, Total=272 [2023-11-22 18:33:13,076 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:13,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 408 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 121 Invalid, 0 Unknown, 49 Unchecked, 0.3s Time] [2023-11-22 18:33:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-22 18:33:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2023-11-22 18:33:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 85 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2023-11-22 18:33:13,087 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 30 [2023-11-22 18:33:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:13,088 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2023-11-22 18:33:13,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2023-11-22 18:33:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 18:33:13,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:13,091 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-11-22 18:33:13,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 18:33:13,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:13,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:13,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash -622964443, now seen corresponding path program 1 times [2023-11-22 18:33:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:13,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232942923] [2023-11-22 18:33:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:13,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:13,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232942923] [2023-11-22 18:33:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232942923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888122001] [2023-11-22 18:33:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:13,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:13,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:13,577 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) [2023-11-22 18:33:13,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 18:33:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:13,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-22 18:33:13,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:13,672 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:13,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:33:13,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:33:13,695 INFO L378 Elim1Store]: Elim1 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 [2023-11-22 18:33:13,710 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-22 18:33:13,726 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:33:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:13,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:14,987 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 Int) (v_ArrVal_280 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_277)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-11-22 18:33:15,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:15,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-22 18:33:15,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:15,008 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 33 [2023-11-22 18:33:15,012 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 7 [2023-11-22 18:33:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888122001] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:33:15,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:33:15,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2023-11-22 18:33:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032876856] [2023-11-22 18:33:15,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:33:15,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 18:33:15,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:15,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 18:33:15,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=4, NotChecked=20, Total=156 [2023-11-22 18:33:15,065 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:15,225 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2023-11-22 18:33:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:33:15,225 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-22 18:33:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:15,226 INFO L225 Difference]: With dead ends: 115 [2023-11-22 18:33:15,226 INFO L226 Difference]: Without dead ends: 109 [2023-11-22 18:33:15,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=4, NotChecked=32, Total=342 [2023-11-22 18:33:15,227 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 59 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:15,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 400 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2023-11-22 18:33:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-22 18:33:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2023-11-22 18:33:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2023-11-22 18:33:15,231 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 30 [2023-11-22 18:33:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:15,232 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2023-11-22 18:33:15,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2023-11-22 18:33:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 18:33:15,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:15,233 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, 1, 1, 1] [2023-11-22 18:33:15,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 18:33:15,443 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,SelfDestructingSolverStorable7 [2023-11-22 18:33:15,444 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:15,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1874960896, now seen corresponding path program 1 times [2023-11-22 18:33:15,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:15,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663660389] [2023-11-22 18:33:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:15,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:33:15,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:15,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663660389] [2023-11-22 18:33:15,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663660389] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:15,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124044946] [2023-11-22 18:33:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:15,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:15,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:15,745 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) [2023-11-22 18:33:15,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 18:33:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:15,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-22 18:33:15,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:15,852 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:15,893 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:33:15,893 INFO L378 Elim1Store]: Elim1 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 [2023-11-22 18:33:15,919 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-22 18:33:15,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2023-11-22 18:33:15,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-22 18:33:15,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2023-11-22 18:33:15,973 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 19 [2023-11-22 18:33:15,976 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 23 [2023-11-22 18:33:16,003 INFO L378 Elim1Store]: Elim1 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 39 treesize of output 21 [2023-11-22 18:33:16,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 11 [2023-11-22 18:33:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:16,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:16,042 INFO L378 Elim1Store]: Elim1 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 79 treesize of output 57 [2023-11-22 18:33:16,047 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_356 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_357 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2023-11-22 18:33:16,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:16,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-22 18:33:16,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:16,069 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 31 [2023-11-22 18:33:16,072 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-22 18:33:16,082 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:33:16,082 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-22 18:33:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-22 18:33:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124044946] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:33:16,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:33:16,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2023-11-22 18:33:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553907390] [2023-11-22 18:33:16,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:33:16,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-22 18:33:16,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:16,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-22 18:33:16,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=258, Unknown=1, NotChecked=32, Total=342 [2023-11-22 18:33:16,156 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:16,445 INFO L93 Difference]: Finished difference Result 126 states and 170 transitions. [2023-11-22 18:33:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:33:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-22 18:33:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:16,446 INFO L225 Difference]: With dead ends: 126 [2023-11-22 18:33:16,446 INFO L226 Difference]: Without dead ends: 122 [2023-11-22 18:33:16,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=476, Unknown=1, NotChecked=46, Total=650 [2023-11-22 18:33:16,447 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 217 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:16,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 477 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 241 Invalid, 0 Unknown, 97 Unchecked, 0.2s Time] [2023-11-22 18:33:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-22 18:33:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2023-11-22 18:33:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2023-11-22 18:33:16,452 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 32 [2023-11-22 18:33:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:16,452 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2023-11-22 18:33:16,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2023-11-22 18:33:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 18:33:16,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:16,453 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2023-11-22 18:33:16,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 18:33:16,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:16,680 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:16,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2000163109, now seen corresponding path program 2 times [2023-11-22 18:33:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:16,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660462420] [2023-11-22 18:33:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:33:17,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:17,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660462420] [2023-11-22 18:33:17,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660462420] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:17,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283544699] [2023-11-22 18:33:17,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:33:17,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:17,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:33:17,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 18:33:17,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:33:17,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:33:17,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-22 18:33:17,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:17,114 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:17,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:33:17,148 INFO L378 Elim1Store]: Elim1 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 [2023-11-22 18:33:17,164 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-22 18:33:17,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2023-11-22 18:33:17,194 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 18:33:17,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-11-22 18:33:17,198 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 15 [2023-11-22 18:33:17,200 INFO L378 Elim1Store]: Elim1 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 32 treesize of output 19 [2023-11-22 18:33:17,227 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 19 [2023-11-22 18:33:17,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2023-11-22 18:33:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:17,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:17,265 INFO L378 Elim1Store]: Elim1 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 52 treesize of output 30 [2023-11-22 18:33:17,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:17,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-22 18:33:17,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:17,316 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 35 [2023-11-22 18:33:17,318 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-22 18:33:17,324 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:33:17,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-22 18:33:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283544699] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:33:17,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:33:17,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2023-11-22 18:33:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110727273] [2023-11-22 18:33:17,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:33:17,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-22 18:33:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:17,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-22 18:33:17,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=258, Unknown=3, NotChecked=0, Total=306 [2023-11-22 18:33:17,393 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:17,738 INFO L93 Difference]: Finished difference Result 128 states and 172 transitions. [2023-11-22 18:33:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 18:33:17,739 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-22 18:33:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:17,740 INFO L225 Difference]: With dead ends: 128 [2023-11-22 18:33:17,741 INFO L226 Difference]: Without dead ends: 118 [2023-11-22 18:33:17,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=603, Unknown=3, NotChecked=0, Total=756 [2023-11-22 18:33:17,741 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 168 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:17,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 580 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:33:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-22 18:33:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2023-11-22 18:33:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2023-11-22 18:33:17,748 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 34 [2023-11-22 18:33:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:17,748 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2023-11-22 18:33:17,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2023-11-22 18:33:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 18:33:17,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:17,750 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2023-11-22 18:33:17,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 18:33:17,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:17,961 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:17,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:17,961 INFO L85 PathProgramCache]: Analyzing trace with hash 216589019, now seen corresponding path program 1 times [2023-11-22 18:33:17,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:17,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170101536] [2023-11-22 18:33:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:33:18,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170101536] [2023-11-22 18:33:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170101536] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:18,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195078702] [2023-11-22 18:33:18,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:18,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:18,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:18,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:33:18,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 18:33:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:18,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-22 18:33:18,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:18,239 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:18,262 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:33:18,262 INFO L378 Elim1Store]: Elim1 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 [2023-11-22 18:33:18,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:33:18,279 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-22 18:33:18,291 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:33:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:33:18,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:18,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:18,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-11-22 18:33:18,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:18,361 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 36 [2023-11-22 18:33:18,364 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 18 [2023-11-22 18:33:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:33:18,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195078702] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:33:18,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:33:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-11-22 18:33:18,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968843229] [2023-11-22 18:33:18,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:33:18,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 18:33:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 18:33:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=142, Unknown=4, NotChecked=0, Total=182 [2023-11-22 18:33:18,427 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:18,591 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2023-11-22 18:33:18,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 18:33:18,592 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-22 18:33:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:18,592 INFO L225 Difference]: With dead ends: 122 [2023-11-22 18:33:18,592 INFO L226 Difference]: Without dead ends: 109 [2023-11-22 18:33:18,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=253, Unknown=4, NotChecked=0, Total=342 [2023-11-22 18:33:18,593 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 75 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:18,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 371 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:33:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-22 18:33:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2023-11-22 18:33:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2023-11-22 18:33:18,597 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 34 [2023-11-22 18:33:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:18,597 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2023-11-22 18:33:18,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2023-11-22 18:33:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 18:33:18,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:18,598 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, 1, 1, 1, 1, 1] [2023-11-22 18:33:18,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-22 18:33:18,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-22 18:33:18,809 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:18,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1107758708, now seen corresponding path program 1 times [2023-11-22 18:33:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:18,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624248694] [2023-11-22 18:33:18,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:18,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:19,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:19,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624248694] [2023-11-22 18:33:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624248694] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:19,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113715712] [2023-11-22 18:33:19,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:19,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:19,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:19,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:33:19,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 18:33:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:19,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-22 18:33:19,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:19,281 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:19,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:33:19,320 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 18:33:19,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-22 18:33:19,348 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-22 18:33:19,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:33:19,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2023-11-22 18:33:19,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:33:19,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:33:19,465 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:33:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:19,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:21,538 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-11-22 18:33:22,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:22,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2023-11-22 18:33:22,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:22,757 INFO L378 Elim1Store]: Elim1 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 122 treesize of output 121 [2023-11-22 18:33:22,769 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 21 [2023-11-22 18:33:22,774 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 20 [2023-11-22 18:33:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:26,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113715712] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:33:26,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:33:26,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2023-11-22 18:33:26,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257760778] [2023-11-22 18:33:26,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:33:26,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-22 18:33:26,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:26,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-22 18:33:26,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=544, Unknown=9, NotChecked=48, Total=702 [2023-11-22 18:33:26,401 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:26,722 INFO L93 Difference]: Finished difference Result 109 states and 149 transitions. [2023-11-22 18:33:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 18:33:26,723 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-22 18:33:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:26,723 INFO L225 Difference]: With dead ends: 109 [2023-11-22 18:33:26,723 INFO L226 Difference]: Without dead ends: 103 [2023-11-22 18:33:26,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=179, Invalid=746, Unknown=9, NotChecked=58, Total=992 [2023-11-22 18:33:26,724 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 111 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:26,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 724 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 276 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2023-11-22 18:33:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-22 18:33:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2023-11-22 18:33:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2023-11-22 18:33:26,728 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 34 [2023-11-22 18:33:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:26,728 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2023-11-22 18:33:26,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2023-11-22 18:33:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 18:33:26,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:26,729 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2023-11-22 18:33:26,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 18:33:26,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:26,941 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:26,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash 516290971, now seen corresponding path program 1 times [2023-11-22 18:33:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:26,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670984444] [2023-11-22 18:33:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:33:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670984444] [2023-11-22 18:33:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670984444] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603761697] [2023-11-22 18:33:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:27,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:27,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:33:27,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 18:33:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:27,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-22 18:33:27,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:27,398 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:27,429 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:33:27,430 INFO L378 Elim1Store]: Elim1 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 [2023-11-22 18:33:27,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2023-11-22 18:33:27,455 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-22 18:33:27,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-22 18:33:27,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2023-11-22 18:33:27,516 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 19 [2023-11-22 18:33:27,518 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 23 [2023-11-22 18:33:27,540 INFO L378 Elim1Store]: Elim1 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 39 treesize of output 21 [2023-11-22 18:33:27,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 11 [2023-11-22 18:33:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:27,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:27,590 INFO L378 Elim1Store]: Elim1 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 52 treesize of output 30 [2023-11-22 18:33:27,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:27,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-22 18:33:27,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:27,648 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 31 [2023-11-22 18:33:27,651 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-22 18:33:27,660 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:33:27,660 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-22 18:33:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603761697] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:33:27,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:33:27,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2023-11-22 18:33:27,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840807092] [2023-11-22 18:33:27,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:33:27,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-22 18:33:27,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-22 18:33:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=358, Unknown=3, NotChecked=0, Total=420 [2023-11-22 18:33:27,712 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:28,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:28,017 INFO L93 Difference]: Finished difference Result 117 states and 157 transitions. [2023-11-22 18:33:28,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 18:33:28,018 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-22 18:33:28,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:28,018 INFO L225 Difference]: With dead ends: 117 [2023-11-22 18:33:28,018 INFO L226 Difference]: Without dead ends: 104 [2023-11-22 18:33:28,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=745, Unknown=3, NotChecked=0, Total=930 [2023-11-22 18:33:28,019 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 147 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:28,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 572 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:33:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-22 18:33:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-11-22 18:33:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2023-11-22 18:33:28,023 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 34 [2023-11-22 18:33:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:28,023 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2023-11-22 18:33:28,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2023-11-22 18:33:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 18:33:28,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:28,024 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2023-11-22 18:33:28,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-22 18:33:28,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:28,232 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:28,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 393684135, now seen corresponding path program 3 times [2023-11-22 18:33:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101011559] [2023-11-22 18:33:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:33:28,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101011559] [2023-11-22 18:33:28,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101011559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246436349] [2023-11-22 18:33:28,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 18:33:28,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:28,818 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:33:28,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 18:33:28,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-22 18:33:28,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:33:28,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-22 18:33:28,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:28,977 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:29,019 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 18:33:29,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-22 18:33:29,070 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-22 18:33:29,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:33:29,131 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 18:33:29,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-22 18:33:29,144 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 18:33:29,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-22 18:33:29,158 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-22 18:33:29,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-22 18:33:29,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:33:29,238 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-11-22 18:33:29,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 89 [2023-11-22 18:33:29,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-22 18:33:29,252 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 22 [2023-11-22 18:33:29,342 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-22 18:33:29,342 INFO L378 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 89 [2023-11-22 18:33:29,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:33:29,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-11-22 18:33:29,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-11-22 18:33:29,476 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:33:29,477 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 36 [2023-11-22 18:33:29,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 18:33:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:29,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:29,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:29,692 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 79 [2023-11-22 18:33:29,710 INFO L349 Elim1Store]: treesize reduction 4, result has 91.7 percent of original size [2023-11-22 18:33:29,710 INFO L378 Elim1Store]: Elim1 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 2198 treesize of output 2128 [2023-11-22 18:33:29,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:29,742 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 487 treesize of output 445 [2023-11-22 18:33:29,934 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2023-11-22 18:33:29,965 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 37 [2023-11-22 18:33:30,031 INFO L378 Elim1Store]: Elim1 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 56 treesize of output 40 [2023-11-22 18:33:30,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-22 18:33:30,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-11-22 18:33:30,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,674 INFO L378 Elim1Store]: Elim1 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 173 treesize of output 166 [2023-11-22 18:33:30,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,692 INFO L378 Elim1Store]: Elim1 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 75 treesize of output 75 [2023-11-22 18:33:30,710 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 54 [2023-11-22 18:33:30,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,723 INFO L378 Elim1Store]: Elim1 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 205 treesize of output 198 [2023-11-22 18:33:30,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,736 INFO L378 Elim1Store]: Elim1 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 147 treesize of output 115 [2023-11-22 18:33:30,742 INFO L378 Elim1Store]: Elim1 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 54 treesize of output 46 [2023-11-22 18:33:30,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-22 18:33:30,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 52 [2023-11-22 18:33:30,859 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:30,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,868 INFO L378 Elim1Store]: Elim1 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 39 treesize of output 38 [2023-11-22 18:33:30,871 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:30,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:30,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 74 [2023-11-22 18:33:30,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:30,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 48 [2023-11-22 18:33:30,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,950 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 31 [2023-11-22 18:33:30,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2023-11-22 18:33:30,988 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:30,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:30,996 INFO L378 Elim1Store]: Elim1 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 61 treesize of output 54 [2023-11-22 18:33:31,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,005 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 27 [2023-11-22 18:33:31,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-11-22 18:33:31,025 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,032 INFO L378 Elim1Store]: Elim1 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 61 treesize of output 54 [2023-11-22 18:33:31,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,046 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 29 [2023-11-22 18:33:31,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-22 18:33:31,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-22 18:33:31,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,079 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 35 [2023-11-22 18:33:31,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,094 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 35 [2023-11-22 18:33:31,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,104 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 22 [2023-11-22 18:33:31,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,121 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 20 [2023-11-22 18:33:31,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-22 18:33:31,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-22 18:33:31,145 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,153 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 35 [2023-11-22 18:33:31,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,170 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 35 [2023-11-22 18:33:31,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,181 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 22 [2023-11-22 18:33:31,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,197 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 20 [2023-11-22 18:33:31,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-22 18:33:31,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-22 18:33:31,227 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-22 18:33:31,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,251 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 20 [2023-11-22 18:33:31,260 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-22 18:33:31,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,273 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 25 [2023-11-22 18:33:31,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2023-11-22 18:33:31,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-22 18:33:31,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,318 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 27 [2023-11-22 18:33:31,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-11-22 18:33:31,339 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-22 18:33:31,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,355 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 32 [2023-11-22 18:33:31,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-22 18:33:31,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 52 [2023-11-22 18:33:31,380 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-11-22 18:33:31,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 82 [2023-11-22 18:33:31,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59 [2023-11-22 18:33:31,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,608 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 31 [2023-11-22 18:33:31,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-22 18:33:31,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-11-22 18:33:31,651 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-11-22 18:33:31,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,666 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 31 [2023-11-22 18:33:31,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-11-22 18:33:31,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,694 INFO L378 Elim1Store]: Elim1 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 48 treesize of output 36 [2023-11-22 18:33:31,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-22 18:33:31,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-22 18:33:31,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-22 18:33:31,755 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:31,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-22 18:33:31,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,772 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 25 [2023-11-22 18:33:31,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:31,793 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 20 [2023-11-22 18:33:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:34,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246436349] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:33:34,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:33:34,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2023-11-22 18:33:34,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498766814] [2023-11-22 18:33:34,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:33:34,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-22 18:33:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:34,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-22 18:33:34,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=659, Unknown=1, NotChecked=0, Total=756 [2023-11-22 18:33:34,793 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 28 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:37,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 18:33:39,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 18:33:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:40,199 INFO L93 Difference]: Finished difference Result 137 states and 181 transitions. [2023-11-22 18:33:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-22 18:33:40,200 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 28 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-22 18:33:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:40,200 INFO L225 Difference]: With dead ends: 137 [2023-11-22 18:33:40,200 INFO L226 Difference]: Without dead ends: 133 [2023-11-22 18:33:40,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=348, Invalid=1907, Unknown=1, NotChecked=0, Total=2256 [2023-11-22 18:33:40,202 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 229 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:40,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 689 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 478 Invalid, 3 Unknown, 0 Unchecked, 4.7s Time] [2023-11-22 18:33:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-22 18:33:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2023-11-22 18:33:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2023-11-22 18:33:40,222 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 36 [2023-11-22 18:33:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:40,223 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2023-11-22 18:33:40,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 28 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2023-11-22 18:33:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 18:33:40,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:40,224 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2023-11-22 18:33:40,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-22 18:33:40,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-22 18:33:40,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:40,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:40,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1825502169, now seen corresponding path program 2 times [2023-11-22 18:33:40,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:40,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106736513] [2023-11-22 18:33:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:40,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:33:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106736513] [2023-11-22 18:33:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106736513] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657059304] [2023-11-22 18:33:40,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:33:40,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:40,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:40,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:33:40,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-22 18:33:41,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:33:41,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:33:41,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-22 18:33:41,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:41,106 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:41,137 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 18:33:41,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-22 18:33:41,180 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-22 18:33:41,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2023-11-22 18:33:41,237 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 18:33:41,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-22 18:33:41,249 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-22 18:33:41,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-22 18:33:41,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:33:41,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:33:41,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:33:41,308 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-11-22 18:33:41,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 125 [2023-11-22 18:33:41,311 INFO L378 Elim1Store]: Elim1 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 128 treesize of output 105 [2023-11-22 18:33:41,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-11-22 18:33:41,418 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-22 18:33:41,419 INFO L378 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 135 [2023-11-22 18:33:41,428 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-22 18:33:41,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 121 [2023-11-22 18:33:41,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2023-11-22 18:33:41,489 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-22 18:33:41,489 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2023-11-22 18:33:41,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2023-11-22 18:33:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:41,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:41,686 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_934 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_932) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_934) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= 3 .cse0) (= 2 .cse0) (= 1 .cse0)))) is different from false [2023-11-22 18:33:41,729 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_934 (Array Int Int)) (v_ArrVal_930 Int)) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 v_ArrVal_930)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_932) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_934) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= 3 .cse0) (= .cse0 1) (= 2 .cse0)))) is different from false [2023-11-22 18:33:41,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,749 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 150 [2023-11-22 18:33:41,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,757 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 157 [2023-11-22 18:33:41,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,766 INFO L378 Elim1Store]: Elim1 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 336 treesize of output 267 [2023-11-22 18:33:41,772 INFO L378 Elim1Store]: Elim1 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 136 treesize of output 82 [2023-11-22 18:33:41,817 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 22 [2023-11-22 18:33:41,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-22 18:33:41,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,899 INFO L378 Elim1Store]: Elim1 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 178 treesize of output 129 [2023-11-22 18:33:41,903 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 21 [2023-11-22 18:33:41,907 INFO L378 Elim1Store]: Elim1 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 28 treesize of output 20 [2023-11-22 18:33:41,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-22 18:33:41,937 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:41,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,943 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 35 [2023-11-22 18:33:41,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,957 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 22 [2023-11-22 18:33:41,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-11-22 18:33:41,967 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:33:41,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,973 INFO L378 Elim1Store]: Elim1 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 47 treesize of output 46 [2023-11-22 18:33:41,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:41,980 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2023-11-22 18:33:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-11-22 18:33:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657059304] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:33:42,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:33:42,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 32 [2023-11-22 18:33:42,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708269541] [2023-11-22 18:33:42,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:33:42,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-22 18:33:42,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:33:42,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-22 18:33:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=773, Unknown=3, NotChecked=114, Total=992 [2023-11-22 18:33:42,352 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 32 states, 32 states have (on average 2.53125) internal successors, (81), 32 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:33:43,084 INFO L93 Difference]: Finished difference Result 139 states and 183 transitions. [2023-11-22 18:33:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-22 18:33:43,085 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.53125) internal successors, (81), 32 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-22 18:33:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:33:43,085 INFO L225 Difference]: With dead ends: 139 [2023-11-22 18:33:43,085 INFO L226 Difference]: Without dead ends: 133 [2023-11-22 18:33:43,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=263, Invalid=1634, Unknown=3, NotChecked=170, Total=2070 [2023-11-22 18:33:43,086 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 153 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 18:33:43,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 735 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 483 Invalid, 0 Unknown, 187 Unchecked, 0.4s Time] [2023-11-22 18:33:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-22 18:33:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2023-11-22 18:33:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 124 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 168 transitions. [2023-11-22 18:33:43,098 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 168 transitions. Word has length 36 [2023-11-22 18:33:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:33:43,099 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 168 transitions. [2023-11-22 18:33:43,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.53125) internal successors, (81), 32 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:33:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 168 transitions. [2023-11-22 18:33:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 18:33:43,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:33:43,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-22 18:33:43,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-22 18:33:43,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-22 18:33:43,311 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:33:43,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:33:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash 422011842, now seen corresponding path program 4 times [2023-11-22 18:33:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:33:43,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197109078] [2023-11-22 18:33:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:33:43,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:33:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:33:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:33:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:33:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197109078] [2023-11-22 18:33:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197109078] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:33:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552848719] [2023-11-22 18:33:44,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 18:33:44,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:33:44,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:33:44,088 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:33:44,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-22 18:33:44,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 18:33:44,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:33:44,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-22 18:33:44,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:33:44,220 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-11-22 18:33:44,271 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 18:33:44,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-22 18:33:44,315 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-22 18:33:44,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2023-11-22 18:33:44,366 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 18:33:44,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2023-11-22 18:33:44,371 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-22 18:33:44,383 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 18:33:44,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2023-11-22 18:33:44,398 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-11-22 18:33:44,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-11-22 18:33:44,456 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2023-11-22 18:33:44,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 137 [2023-11-22 18:33:44,459 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 108 [2023-11-22 18:33:44,521 INFO L349 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2023-11-22 18:33:44,522 INFO L378 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 163 [2023-11-22 18:33:44,537 INFO L349 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2023-11-22 18:33:44,537 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 156 [2023-11-22 18:33:44,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2023-11-22 18:33:44,702 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-22 18:33:44,702 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 53 [2023-11-22 18:33:44,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2023-11-22 18:33:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:33:44,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:33:44,748 INFO L378 Elim1Store]: Elim1 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 187 treesize of output 129 [2023-11-22 18:33:44,754 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1045))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1047))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2023-11-22 18:33:44,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_87| Int)) (= |v_ULTIMATE.start_main_~p~0#1.offset_87| (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_87|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1047))) (select (select .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_87| Int)) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1045))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_87|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))))) is different from false [2023-11-22 18:33:44,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:44,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 124 [2023-11-22 18:33:44,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:44,814 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 92 [2023-11-22 18:33:44,842 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 1 [2023-11-22 18:33:44,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:44,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2023-11-22 18:33:44,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:44,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2023-11-22 18:33:44,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:44,936 INFO L378 Elim1Store]: Elim1 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 332 treesize of output 235 [2023-11-22 18:33:45,552 INFO L349 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2023-11-22 18:33:45,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 5584 treesize of output 5407 [2023-11-22 18:33:45,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:45,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 698 treesize of output 562 [2023-11-22 18:33:45,768 INFO L378 Elim1Store]: Elim1 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 389 treesize of output 317 [2023-11-22 18:33:45,797 INFO L378 Elim1Store]: Elim1 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 512 treesize of output 432 [2023-11-22 18:33:45,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:33:45,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 440 treesize of output 360 [2023-11-22 18:36:10,712 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-22 18:36:10,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-22 18:36:10,718 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-22 18:36:10,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-22 18:36:10,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-22 18:36:10,937 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) 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:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) 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:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) 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.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:337) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2023-11-22 18:36:10,941 INFO L158 Benchmark]: Toolchain (without parser) took 181082.25ms. Allocated memory was 140.5MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 82.6MB in the beginning and 883.0MB in the end (delta: -800.4MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-22 18:36:10,945 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 18:36:10,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.02ms. Allocated memory is still 140.5MB. Free memory was 82.4MB in the beginning and 64.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-22 18:36:10,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.68ms. Allocated memory is still 140.5MB. Free memory was 64.7MB in the beginning and 62.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 18:36:10,946 INFO L158 Benchmark]: Boogie Preprocessor took 36.97ms. Allocated memory is still 140.5MB. Free memory was 62.1MB in the beginning and 58.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-22 18:36:10,946 INFO L158 Benchmark]: RCFGBuilder took 429.48ms. Allocated memory was 140.5MB in the beginning and 176.2MB in the end (delta: 35.7MB). Free memory was 58.8MB in the beginning and 134.1MB in the end (delta: -75.3MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-11-22 18:36:10,946 INFO L158 Benchmark]: TraceAbstraction took 180232.13ms. Allocated memory was 176.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 133.1MB in the beginning and 883.0MB in the end (delta: -750.0MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-22 18:36:10,951 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.02ms. Allocated memory is still 140.5MB. Free memory was 82.4MB in the beginning and 64.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.68ms. Allocated memory is still 140.5MB. Free memory was 64.7MB in the beginning and 62.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.97ms. Allocated memory is still 140.5MB. Free memory was 62.1MB in the beginning and 58.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 429.48ms. Allocated memory was 140.5MB in the beginning and 176.2MB in the end (delta: 35.7MB). Free memory was 58.8MB in the beginning and 134.1MB in the end (delta: -75.3MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * TraceAbstraction took 180232.13ms. Allocated memory was 176.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 133.1MB in the beginning and 883.0MB in the end (delta: -750.0MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-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 --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 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:36:12,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:36:13,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 18:36:13,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:36:13,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:36:13,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:36:13,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:36:13,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:36:13,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:36:13,047 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:36:13,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:36:13,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:36:13,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:36:13,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:36:13,048 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:36:13,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:36:13,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:36:13,049 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:36:13,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:36:13,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:36:13,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:36:13,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:36:13,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:36:13,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 18:36:13,051 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 18:36:13,051 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 18:36:13,051 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:36:13,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:36:13,051 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:36:13,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:36:13,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:36:13,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:36:13,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:36:13,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:36:13,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:36:13,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:36:13,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:36:13,053 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 18:36:13,053 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 18:36:13,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:36:13,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:36:13,054 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:36:13,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:36:13,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:36:13,054 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 18:36:13,054 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 18:36:13,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:36:13,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:36:13,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:36:13,284 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:36:13,284 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:36:13,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2023-11-22 18:36:14,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:36:14,664 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:36:14,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2023-11-22 18:36:14,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51bffa363/c72be6359b3c4b83b062d72a324a960f/FLAG4d5d0b950 [2023-11-22 18:36:14,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51bffa363/c72be6359b3c4b83b062d72a324a960f [2023-11-22 18:36:14,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:36:14,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:36:14,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:36:14,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:36:14,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:36:14,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:36:14" (1/1) ... [2023-11-22 18:36:14,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5a3ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:14, skipping insertion in model container [2023-11-22 18:36:14,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:36:14" (1/1) ... [2023-11-22 18:36:14,741 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:36:14,983 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2023-11-22 18:36:14,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:36:15,001 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:36:15,047 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2023-11-22 18:36:15,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:36:15,073 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:36:15,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15 WrapperNode [2023-11-22 18:36:15,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:36:15,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:36:15,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:36:15,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:36:15,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,126 INFO L138 Inliner]: procedures = 125, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 205 [2023-11-22 18:36:15,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:36:15,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:36:15,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:36:15,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:36:15,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,146 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,156 INFO L189 HeapSplitter]: Split 40 memory accesses to 3 slices as follows [2, 26, 12] [2023-11-22 18:36:15,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:36:15,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:36:15,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:36:15,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:36:15,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (1/1) ... [2023-11-22 18:36:15,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:36:15,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:36:15,201 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) [2023-11-22 18:36:15,216 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 [2023-11-22 18:36:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-22 18:36:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-22 18:36:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-22 18:36:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-22 18:36:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-22 18:36:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 18:36:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:36:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 18:36:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 18:36:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-22 18:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:36:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:36:15,377 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:36:15,379 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:36:15,415 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-22 18:36:15,890 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:36:15,913 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:36:15,915 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-22 18:36:15,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:36:15 BoogieIcfgContainer [2023-11-22 18:36:15,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:36:15,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:36:15,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:36:15,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:36:15,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:36:14" (1/3) ... [2023-11-22 18:36:15,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a5738b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:36:15, skipping insertion in model container [2023-11-22 18:36:15,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:15" (2/3) ... [2023-11-22 18:36:15,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a5738b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:36:15, skipping insertion in model container [2023-11-22 18:36:15,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:36:15" (3/3) ... [2023-11-22 18:36:15,922 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2023-11-22 18:36:15,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:36:15,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:36:15,980 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:36:15,985 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=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ea12e67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:36:15,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:36:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 47 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 18:36:15,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:15,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:36:15,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:15,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1035494790, now seen corresponding path program 1 times [2023-11-22 18:36:16,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:16,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755424333] [2023-11-22 18:36:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:16,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:16,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:16,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:16,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-22 18:36:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:16,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 18:36:16,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:36:16,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:36:16,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755424333] [2023-11-22 18:36:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755424333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:36:16,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:36:16,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:36:16,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338422080] [2023-11-22 18:36:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:36:16,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 18:36:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:16,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 18:36:16,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:36:16,167 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 47 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:16,199 INFO L93 Difference]: Finished difference Result 97 states and 155 transitions. [2023-11-22 18:36:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 18:36:16,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-22 18:36:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:16,205 INFO L225 Difference]: With dead ends: 97 [2023-11-22 18:36:16,205 INFO L226 Difference]: Without dead ends: 42 [2023-11-22 18:36:16,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:36:16,212 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:16,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:36:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-22 18:36:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-22 18:36:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2023-11-22 18:36:16,240 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 15 [2023-11-22 18:36:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:16,240 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-11-22 18:36:16,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2023-11-22 18:36:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 18:36:16,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:16,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:36:16,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:16,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:16,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:16,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1634113901, now seen corresponding path program 1 times [2023-11-22 18:36:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:16,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707557564] [2023-11-22 18:36:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:16,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:16,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:16,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:16,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-22 18:36:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:16,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 18:36:16,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:36:16,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:36:16,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707557564] [2023-11-22 18:36:16,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707557564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:36:16,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:36:16,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:36:16,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725525840] [2023-11-22 18:36:16,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:36:16,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 18:36:16,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:16,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 18:36:16,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:36:16,574 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:16,612 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2023-11-22 18:36:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 18:36:16,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-22 18:36:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:16,614 INFO L225 Difference]: With dead ends: 70 [2023-11-22 18:36:16,615 INFO L226 Difference]: Without dead ends: 50 [2023-11-22 18:36:16,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:36:16,616 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:16,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:36:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-22 18:36:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-22 18:36:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.469387755102041) internal successors, (72), 49 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2023-11-22 18:36:16,621 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 20 [2023-11-22 18:36:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:16,621 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2023-11-22 18:36:16,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2023-11-22 18:36:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 18:36:16,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:16,622 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-22 18:36:16,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:16,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:16,826 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:16,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:16,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1678369216, now seen corresponding path program 1 times [2023-11-22 18:36:16,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:16,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622956069] [2023-11-22 18:36:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:16,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:16,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:16,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:16,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-22 18:36:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:16,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 18:36:16,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:36:16,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:36:16,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:16,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622956069] [2023-11-22 18:36:16,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622956069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:36:16,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:36:16,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 18:36:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855004585] [2023-11-22 18:36:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:36:16,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 18:36:16,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:16,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 18:36:16,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:36:16,929 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:16,973 INFO L93 Difference]: Finished difference Result 88 states and 126 transitions. [2023-11-22 18:36:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 18:36:16,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-22 18:36:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:16,975 INFO L225 Difference]: With dead ends: 88 [2023-11-22 18:36:16,975 INFO L226 Difference]: Without dead ends: 52 [2023-11-22 18:36:16,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:36:16,976 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:16,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:36:16,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-22 18:36:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-22 18:36:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2023-11-22 18:36:16,985 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 26 [2023-11-22 18:36:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:16,986 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2023-11-22 18:36:16,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2023-11-22 18:36:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 18:36:16,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:16,987 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-22 18:36:16,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:17,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:17,190 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:17,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash 860720766, now seen corresponding path program 1 times [2023-11-22 18:36:17,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:17,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996597954] [2023-11-22 18:36:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:17,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:17,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:17,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:17,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-22 18:36:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:17,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 18:36:17,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:17,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:17,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:36:17,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996597954] [2023-11-22 18:36:17,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996597954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:36:17,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:36:17,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 18:36:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638786862] [2023-11-22 18:36:17,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:36:17,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:36:17,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:17,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:36:17,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:36:17,405 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:17,589 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2023-11-22 18:36:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:36:17,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-22 18:36:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:17,590 INFO L225 Difference]: With dead ends: 77 [2023-11-22 18:36:17,590 INFO L226 Difference]: Without dead ends: 73 [2023-11-22 18:36:17,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:36:17,591 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 17 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:17,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 194 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:36:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-22 18:36:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2023-11-22 18:36:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2023-11-22 18:36:17,597 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 26 [2023-11-22 18:36:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:17,597 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2023-11-22 18:36:17,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2023-11-22 18:36:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 18:36:17,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:17,598 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-22 18:36:17,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:17,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:17,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:17,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1727351847, now seen corresponding path program 1 times [2023-11-22 18:36:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:17,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476227367] [2023-11-22 18:36:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:17,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:17,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:17,803 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:17,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-22 18:36:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:17,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 18:36:17,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:17,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:17,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:36:17,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476227367] [2023-11-22 18:36:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476227367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:36:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:36:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 18:36:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703769007] [2023-11-22 18:36:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:36:17,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:36:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:36:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:36:17,923 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:18,108 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2023-11-22 18:36:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:36:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 18:36:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:18,127 INFO L225 Difference]: With dead ends: 79 [2023-11-22 18:36:18,127 INFO L226 Difference]: Without dead ends: 71 [2023-11-22 18:36:18,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:36:18,128 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:18,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 199 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:36:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-22 18:36:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2023-11-22 18:36:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2023-11-22 18:36:18,132 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 28 [2023-11-22 18:36:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:18,132 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2023-11-22 18:36:18,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2023-11-22 18:36:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 18:36:18,133 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:18,133 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-22 18:36:18,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:18,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:18,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:18,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash -702648871, now seen corresponding path program 1 times [2023-11-22 18:36:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:18,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625289147] [2023-11-22 18:36:18,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:18,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:18,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:18,338 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:18,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-22 18:36:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:18,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 18:36:18,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:18,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:18,502 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:36:18,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:18,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625289147] [2023-11-22 18:36:18,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625289147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:36:18,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:36:18,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 18:36:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953144110] [2023-11-22 18:36:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:36:18,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:36:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:18,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:36:18,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:36:18,508 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:18,664 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2023-11-22 18:36:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:36:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 18:36:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:18,665 INFO L225 Difference]: With dead ends: 79 [2023-11-22 18:36:18,665 INFO L226 Difference]: Without dead ends: 68 [2023-11-22 18:36:18,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:36:18,666 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:18,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 187 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:36:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-22 18:36:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2023-11-22 18:36:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2023-11-22 18:36:18,669 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 28 [2023-11-22 18:36:18,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:18,670 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2023-11-22 18:36:18,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2023-11-22 18:36:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 18:36:18,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:18,670 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-11-22 18:36:18,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:18,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:18,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:18,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1486366107, now seen corresponding path program 1 times [2023-11-22 18:36:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:18,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467212980] [2023-11-22 18:36:18,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:18,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:18,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:18,873 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:18,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-22 18:36:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:19,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-22 18:36:19,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:19,035 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 7 [2023-11-22 18:36:19,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:19,109 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 18:36:19,109 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-22 18:36:19,150 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-22 18:36:19,180 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:36:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:19,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:36:19,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:19,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-22 18:36:19,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:19,354 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 33 [2023-11-22 18:36:19,361 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 7 [2023-11-22 18:36:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:20,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:20,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467212980] [2023-11-22 18:36:20,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467212980] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:36:20,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:36:20,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-11-22 18:36:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897154650] [2023-11-22 18:36:20,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:36:20,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 18:36:20,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:20,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 18:36:20,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=77, Unknown=8, NotChecked=0, Total=110 [2023-11-22 18:36:20,153 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:21,447 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2023-11-22 18:36:21,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 18:36:21,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-22 18:36:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:21,449 INFO L225 Difference]: With dead ends: 81 [2023-11-22 18:36:21,449 INFO L226 Difference]: Without dead ends: 77 [2023-11-22 18:36:21,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=165, Unknown=11, NotChecked=0, Total=240 [2023-11-22 18:36:21,450 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 65 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 18 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:21,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 318 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 122 Invalid, 4 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 18:36:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-22 18:36:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-11-22 18:36:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2023-11-22 18:36:21,456 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 30 [2023-11-22 18:36:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:21,456 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2023-11-22 18:36:21,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2023-11-22 18:36:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 18:36:21,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:21,457 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-11-22 18:36:21,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:21,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:21,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:21,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:21,661 INFO L85 PathProgramCache]: Analyzing trace with hash -622964443, now seen corresponding path program 1 times [2023-11-22 18:36:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:21,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229462069] [2023-11-22 18:36:21,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:21,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:21,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:21,663 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:21,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-22 18:36:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:21,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-22 18:36:21,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:21,773 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 7 [2023-11-22 18:36:21,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:21,827 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 18:36:21,827 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-22 18:36:21,864 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-22 18:36:21,899 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:36:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:21,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:36:21,941 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2023-11-22 18:36:22,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:22,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-22 18:36:22,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:22,037 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 33 [2023-11-22 18:36:22,041 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 7 [2023-11-22 18:36:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-22 18:36:24,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229462069] [2023-11-22 18:36:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229462069] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:36:24,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:36:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-11-22 18:36:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283986882] [2023-11-22 18:36:24,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:36:24,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 18:36:24,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:24,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 18:36:24,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=63, Unknown=7, NotChecked=16, Total=110 [2023-11-22 18:36:24,106 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:25,296 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2023-11-22 18:36:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 18:36:25,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-22 18:36:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:25,297 INFO L225 Difference]: With dead ends: 77 [2023-11-22 18:36:25,297 INFO L226 Difference]: Without dead ends: 71 [2023-11-22 18:36:25,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=54, Invalid=124, Unknown=8, NotChecked=24, Total=210 [2023-11-22 18:36:25,297 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 52 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:25,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 360 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 132 Invalid, 2 Unknown, 40 Unchecked, 1.1s Time] [2023-11-22 18:36:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-22 18:36:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2023-11-22 18:36:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2023-11-22 18:36:25,303 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 30 [2023-11-22 18:36:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:25,303 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2023-11-22 18:36:25,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2023-11-22 18:36:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 18:36:25,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:25,304 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, 1, 1, 1] [2023-11-22 18:36:25,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:25,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:25,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:25,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1874960896, now seen corresponding path program 1 times [2023-11-22 18:36:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:25,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743518317] [2023-11-22 18:36:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:25,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:25,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:25,509 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:25,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-22 18:36:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:25,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-22 18:36:25,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:25,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:25,798 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-22 18:36:25,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2023-11-22 18:36:25,817 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-22 18:36:25,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2023-11-22 18:36:25,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 9 [2023-11-22 18:36:25,837 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-11-22 18:36:25,922 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-11-22 18:36:25,925 INFO L378 Elim1Store]: Elim1 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 [2023-11-22 18:36:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:25,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:36:26,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:26,059 INFO L378 Elim1Store]: Elim1 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 94 treesize of output 97 [2023-11-22 18:36:26,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:26,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2023-11-22 18:36:26,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:26,170 INFO L378 Elim1Store]: Elim1 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 83 treesize of output 52 [2023-11-22 18:36:26,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:26,190 INFO L378 Elim1Store]: Elim1 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 58 treesize of output 57 [2023-11-22 18:36:26,197 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 37 [2023-11-22 18:36:26,202 INFO L378 Elim1Store]: Elim1 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 37 treesize of output 33 [2023-11-22 18:36:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:26,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743518317] [2023-11-22 18:36:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743518317] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:36:26,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:36:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-11-22 18:36:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447125704] [2023-11-22 18:36:26,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:36:26,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 18:36:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:26,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 18:36:26,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:36:26,289 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:27,013 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2023-11-22 18:36:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 18:36:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-22 18:36:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:27,014 INFO L225 Difference]: With dead ends: 101 [2023-11-22 18:36:27,014 INFO L226 Difference]: Without dead ends: 89 [2023-11-22 18:36:27,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2023-11-22 18:36:27,014 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 52 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:27,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 470 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 18:36:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-22 18:36:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2023-11-22 18:36:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2023-11-22 18:36:27,020 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 32 [2023-11-22 18:36:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:27,020 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2023-11-22 18:36:27,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2023-11-22 18:36:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 18:36:27,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:27,021 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, 1, 1, 1] [2023-11-22 18:36:27,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-22 18:36:27,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:27,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:27,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:27,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1395303424, now seen corresponding path program 1 times [2023-11-22 18:36:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:27,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422433464] [2023-11-22 18:36:27,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:27,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:27,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:27,226 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:27,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-22 18:36:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:27,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-22 18:36:27,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:27,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:27,530 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-22 18:36:27,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2023-11-22 18:36:27,548 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-22 18:36:27,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2023-11-22 18:36:27,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 9 [2023-11-22 18:36:27,563 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-11-22 18:36:27,621 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-11-22 18:36:27,626 INFO L378 Elim1Store]: Elim1 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 [2023-11-22 18:36:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:27,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:36:27,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:27,784 INFO L378 Elim1Store]: Elim1 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 94 treesize of output 97 [2023-11-22 18:36:27,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:27,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2023-11-22 18:36:27,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:27,878 INFO L378 Elim1Store]: Elim1 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 83 treesize of output 52 [2023-11-22 18:36:27,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:27,894 INFO L378 Elim1Store]: Elim1 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 58 treesize of output 57 [2023-11-22 18:36:27,900 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 37 [2023-11-22 18:36:27,904 INFO L378 Elim1Store]: Elim1 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 37 treesize of output 33 [2023-11-22 18:36:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:27,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422433464] [2023-11-22 18:36:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422433464] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:36:27,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:36:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-11-22 18:36:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922128857] [2023-11-22 18:36:27,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:36:27,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 18:36:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 18:36:27,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:36:27,987 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:28,673 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2023-11-22 18:36:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 18:36:28,673 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-22 18:36:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:28,674 INFO L225 Difference]: With dead ends: 100 [2023-11-22 18:36:28,674 INFO L226 Difference]: Without dead ends: 90 [2023-11-22 18:36:28,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2023-11-22 18:36:28,674 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 74 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:28,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 438 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 18:36:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-22 18:36:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2023-11-22 18:36:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2023-11-22 18:36:28,683 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 32 [2023-11-22 18:36:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:28,683 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2023-11-22 18:36:28,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2023-11-22 18:36:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 18:36:28,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:28,687 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-11-22 18:36:28,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:28,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:28,891 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:28,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -808113957, now seen corresponding path program 1 times [2023-11-22 18:36:28,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:28,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595808885] [2023-11-22 18:36:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:36:28,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:28,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:28,893 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:28,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-22 18:36:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:36:28,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-22 18:36:28,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:29,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:29,163 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-22 18:36:29,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2023-11-22 18:36:29,180 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-22 18:36:29,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2023-11-22 18:36:29,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 9 [2023-11-22 18:36:29,194 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-11-22 18:36:29,255 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-11-22 18:36:29,258 INFO L378 Elim1Store]: Elim1 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 [2023-11-22 18:36:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:29,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:36:29,394 INFO L349 Elim1Store]: treesize reduction 4, result has 86.2 percent of original size [2023-11-22 18:36:29,394 INFO L378 Elim1Store]: Elim1 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 67 treesize of output 66 [2023-11-22 18:36:29,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:29,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 172 [2023-11-22 18:36:29,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:29,585 INFO L378 Elim1Store]: Elim1 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 263 treesize of output 148 [2023-11-22 18:36:29,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:29,603 INFO L378 Elim1Store]: Elim1 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 192 treesize of output 173 [2023-11-22 18:36:29,614 INFO L378 Elim1Store]: Elim1 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 157 treesize of output 153 [2023-11-22 18:36:29,618 INFO L378 Elim1Store]: Elim1 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 153 treesize of output 149 [2023-11-22 18:36:29,623 INFO L378 Elim1Store]: Elim1 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 149 treesize of output 141 [2023-11-22 18:36:29,630 INFO L378 Elim1Store]: Elim1 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 141 treesize of output 133 [2023-11-22 18:36:29,634 INFO L378 Elim1Store]: Elim1 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 133 treesize of output 129 [2023-11-22 18:36:29,638 INFO L378 Elim1Store]: Elim1 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 129 treesize of output 125 [2023-11-22 18:36:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:29,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595808885] [2023-11-22 18:36:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595808885] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:36:29,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:36:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-22 18:36:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875472933] [2023-11-22 18:36:29,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:36:29,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 18:36:29,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:29,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 18:36:29,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-11-22 18:36:29,754 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:36:30,442 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2023-11-22 18:36:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 18:36:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-22 18:36:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:36:30,443 INFO L225 Difference]: With dead ends: 96 [2023-11-22 18:36:30,443 INFO L226 Difference]: Without dead ends: 83 [2023-11-22 18:36:30,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-11-22 18:36:30,443 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 59 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:36:30,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 439 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 18:36:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-22 18:36:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2023-11-22 18:36:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2023-11-22 18:36:30,454 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 34 [2023-11-22 18:36:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:36:30,454 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2023-11-22 18:36:30,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:36:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2023-11-22 18:36:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 18:36:30,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:36:30,455 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2023-11-22 18:36:30,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-22 18:36:30,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:30,658 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:36:30,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:36:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash 393684135, now seen corresponding path program 2 times [2023-11-22 18:36:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:36:30,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667680804] [2023-11-22 18:36:30,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:36:30,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:36:30,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:36:30,660 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:36:30,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-22 18:36:30,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:36:30,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:36:30,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-22 18:36:30,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:36:30,803 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 7 [2023-11-22 18:36:30,861 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 18:36:30,862 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-22 18:36:30,892 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-22 18:36:30,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:30,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:36:30,956 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 18:36:30,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-22 18:36:30,974 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 18:36:30,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-22 18:36:31,041 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 18:36:31,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 80 [2023-11-22 18:36:31,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-22 18:36:31,056 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 22 [2023-11-22 18:36:31,148 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-22 18:36:31,148 INFO L378 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 27 treesize of output 37 [2023-11-22 18:36:31,167 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 18:36:31,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 38 [2023-11-22 18:36:31,183 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-22 18:36:31,183 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 21 treesize of output 26 [2023-11-22 18:36:31,225 INFO L378 Elim1Store]: Elim1 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 37 treesize of output 27 [2023-11-22 18:36:31,510 INFO L378 Elim1Store]: Elim1 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 73 treesize of output 53 [2023-11-22 18:36:31,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 53 treesize of output 37 [2023-11-22 18:36:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:36:31,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:36:36,524 INFO L349 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2023-11-22 18:36:36,524 INFO L378 Elim1Store]: Elim1 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 2073 treesize of output 1969 [2023-11-22 18:36:36,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:36,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 606 treesize of output 610 [2023-11-22 18:36:37,981 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-22 18:36:37,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2023-11-22 18:36:38,161 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2023-11-22 18:36:41,023 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse19 (not .cse6)) (.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse20 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse3 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_66|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse5 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse5)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or .cse6 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse7 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse8 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))))) (or (and (or .cse6 (and (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse9 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse10 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse11 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse13 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse14 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse15 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse16 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse16)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse19) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))))) .cse19 .cse20) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_9 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse23 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_9 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse25 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse26) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|)))) .cse19) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse29 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse30 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or .cse19 (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) .cse20)))) is different from false [2023-11-22 18:36:43,036 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse19 (not .cse6)) (.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse20 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse3 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_66|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse5 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse5)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or .cse6 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse7 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse8 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))))) (or (and (or .cse6 (and (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse9 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse10 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse11 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse13 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse14 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse15 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse16 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse16)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse19) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))))) .cse19 .cse20) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_9 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse23 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_9 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse25 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse26) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|)))) .cse19) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse29 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse30 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or .cse19 (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) .cse20)))) is different from true [2023-11-22 18:36:44,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:44,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2023-11-22 18:36:44,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:44,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-22 18:36:44,986 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:36:45,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:45,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-22 18:36:45,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:45,083 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 27 [2023-11-22 18:36:45,159 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:36:45,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:45,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-22 18:36:45,219 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-22 18:36:45,310 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:45,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 18:36:45,347 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:45,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 18:36:45,756 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:45,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-11-22 18:36:45,798 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:45,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2023-11-22 18:36:45,835 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:45,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 18:36:45,863 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-22 18:36:45,903 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:45,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 18:36:45,940 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:45,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2023-11-22 18:36:45,967 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-22 18:36:45,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:45,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2023-11-22 18:36:46,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:36:46,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:46,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 73 [2023-11-22 18:36:46,065 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 22 [2023-11-22 18:36:46,130 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:46,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 1 [2023-11-22 18:36:46,175 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:46,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2023-11-22 18:36:46,204 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:46,204 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-11-22 18:36:46,640 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:46,640 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2023-11-22 18:36:46,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:36:46,689 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2023-11-22 18:36:46,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:36:46,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:36:46,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2023-11-22 18:36:46,713 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-11-22 18:36:46,734 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:36:46,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2023-11-22 18:36:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-22 18:36:53,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:36:53,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667680804] [2023-11-22 18:36:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667680804] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:36:53,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:36:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-11-22 18:36:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385842125] [2023-11-22 18:36:53,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:36:53,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 18:36:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:36:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 18:36:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=475, Unknown=7, NotChecked=44, Total=600 [2023-11-22 18:36:53,787 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:37:00,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 18:37:03,301 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))) (let ((.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse20 (not .cse4)) (.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse21 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse3 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) .cse4 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32)) (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse5) (= .cse5 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_66|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse6) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse7 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or .cse4 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse8 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse9 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))))) (or (and (or .cse4 (and (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse10 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse11 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse14 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse15 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse16 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse17 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse17)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse20) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))))) .cse20 .cse21) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_9 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse24 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))) .cse25) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_9 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) .cse25 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse27 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse28) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|)))) .cse20) (not (= |c_ULTIMATE.start_main_~a~0#1.base| .cse6)) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse31 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse32 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or .cse20 (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) .cse21)))) is different from true [2023-11-22 18:37:05,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 18:37:09,293 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))) (let ((.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse20 (not .cse4)) (.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse21 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse3 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) .cse4 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32)) (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse5) (= .cse5 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_66|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse6) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse7 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or .cse4 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse8 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse9 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))))) (or (and (or .cse4 (and (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse10 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse11 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse14 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse15 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse16 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse17 (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse17)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse20) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))))) .cse20 .cse21) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_9 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse24 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))) .cse25) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_9 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) .cse25 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse27 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse28) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|)))) .cse20) (not (= |c_ULTIMATE.start_main_~a~0#1.base| .cse6)) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse31 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store v_arrayElimArr_6 (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse32 |v_ULTIMATE.start_main_~p~0#1.base_66|)))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) (or .cse20 (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_66| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_399) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_400) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_66|))) .cse21)))) is different from true [2023-11-22 18:37:16,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-22 18:37:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:37:23,217 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2023-11-22 18:37:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-22 18:37:23,225 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-22 18:37:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:37:23,225 INFO L225 Difference]: With dead ends: 121 [2023-11-22 18:37:23,225 INFO L226 Difference]: Without dead ends: 117 [2023-11-22 18:37:23,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=201, Invalid=1280, Unknown=13, NotChecked=228, Total=1722 [2023-11-22 18:37:23,226 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 89 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 33 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:37:23,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 872 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 526 Invalid, 17 Unknown, 170 Unchecked, 17.3s Time] [2023-11-22 18:37:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-22 18:37:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2023-11-22 18:37:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:37:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2023-11-22 18:37:23,240 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 36 [2023-11-22 18:37:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:37:23,240 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 114 transitions. [2023-11-22 18:37:23,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:37:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2023-11-22 18:37:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 18:37:23,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:37:23,241 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2023-11-22 18:37:23,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-22 18:37:23,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:37:23,447 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:37:23,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:37:23,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1418387111, now seen corresponding path program 2 times [2023-11-22 18:37:23,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:37:23,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997727218] [2023-11-22 18:37:23,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:37:23,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:37:23,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:37:23,449 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:37:23,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-22 18:37:23,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:37:23,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:37:23,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-22 18:37:23,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:37:23,592 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 7 [2023-11-22 18:37:23,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:37:23,916 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 18:37:23,916 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-11-22 18:37:24,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-22 18:37:24,243 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:37:24,369 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:37:24,586 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-22 18:37:24,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-22 18:37:24,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:37:24,743 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 23 [2023-11-22 18:37:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:37:24,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:37:25,199 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_74| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_74|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2023-11-22 18:37:25,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_74| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_74|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2023-11-22 18:37:25,297 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (_ BitVec 32)) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_453)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_457))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_74| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_74|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2023-11-22 18:37:25,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:37:25,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2023-11-22 18:37:25,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:37:25,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 231 [2023-11-22 18:37:25,490 INFO L378 Elim1Store]: Elim1 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 130 treesize of output 122 [2023-11-22 18:37:25,722 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 4 [2023-11-22 18:37:25,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:37:25,787 INFO L378 Elim1Store]: Elim1 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 74 treesize of output 74 [2023-11-22 18:37:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-11-22 18:37:26,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:37:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997727218] [2023-11-22 18:37:26,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997727218] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:37:26,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:37:26,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-11-22 18:37:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416816217] [2023-11-22 18:37:26,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:37:26,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-22 18:37:26,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:37:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-22 18:37:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=172, Unknown=3, NotChecked=84, Total=306 [2023-11-22 18:37:26,637 INFO L87 Difference]: Start difference. First operand 86 states and 114 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:37:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:37:29,285 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2023-11-22 18:37:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 18:37:29,286 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-22 18:37:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:37:29,287 INFO L225 Difference]: With dead ends: 113 [2023-11-22 18:37:29,287 INFO L226 Difference]: Without dead ends: 105 [2023-11-22 18:37:29,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=172, Invalid=539, Unknown=3, NotChecked=156, Total=870 [2023-11-22 18:37:29,287 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 111 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:37:29,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 411 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 137 Invalid, 0 Unknown, 198 Unchecked, 1.3s Time] [2023-11-22 18:37:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-22 18:37:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2023-11-22 18:37:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:37:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2023-11-22 18:37:29,298 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 36 [2023-11-22 18:37:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:37:29,298 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2023-11-22 18:37:29,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:37:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2023-11-22 18:37:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 18:37:29,302 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:37:29,302 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-11-22 18:37:29,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-22 18:37:29,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:37:29,506 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:37:29,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:37:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1669154151, now seen corresponding path program 1 times [2023-11-22 18:37:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:37:29,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121283845] [2023-11-22 18:37:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:37:29,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:37:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:37:29,509 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:37:29,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-22 18:37:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:37:29,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-22 18:37:29,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:37:29,664 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 7 [2023-11-22 18:37:29,951 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-22 18:37:29,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-22 18:37:30,140 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-11-22 18:37:30,525 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 18:37:30,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-11-22 18:37:30,675 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-22 18:37:30,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-11-22 18:37:30,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:37:30,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:37:30,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-22 18:37:31,064 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-11-22 18:37:31,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 147 [2023-11-22 18:37:31,087 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 124 [2023-11-22 18:37:31,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 Killed by 15