./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.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 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:44:36,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:44:36,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:44:36,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:44:36,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:44:36,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:44:36,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:44:36,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:44:36,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:44:36,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:44:36,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:44:36,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:44:36,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:44:36,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:44:36,999 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:44:36,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:44:36,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:44:37,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:44:37,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:44:37,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:44:37,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:44:37,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:44:37,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:44:37,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:44:37,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:44:37,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:44:37,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:44:37,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:44:37,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:44:37,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:44:37,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:44:37,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:44:37,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:44:37,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:44:37,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:44:37,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:44:37,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:44:37,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:44:37,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:44:37,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:44:37,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:44:37,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:44:37,014 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 -> 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a [2024-11-22 00:44:37,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:44:37,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:44:37,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:44:37,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:44:37,251 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:44:37,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-11-22 00:44:38,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:44:38,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:44:38,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-11-22 00:44:38,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3461ec80/3f4761f226df41e2b905ef52b8c197c7/FLAG96a596e73 [2024-11-22 00:44:39,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3461ec80/3f4761f226df41e2b905ef52b8c197c7 [2024-11-22 00:44:39,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:44:39,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:44:39,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:44:39,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:44:39,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:44:39,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378a1786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39, skipping insertion in model container [2024-11-22 00:44:39,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:44:39,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2024-11-22 00:44:39,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:44:39,347 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:44:39,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2024-11-22 00:44:39,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:44:39,411 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:44:39,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39 WrapperNode [2024-11-22 00:44:39,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:44:39,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:44:39,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:44:39,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:44:39,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,454 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 204 [2024-11-22 00:44:39,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:44:39,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:44:39,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:44:39,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:44:39,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,485 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 15 writes are split as follows [0, 5, 10]. [2024-11-22 00:44:39,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:44:39,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:44:39,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:44:39,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:44:39,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (1/1) ... [2024-11-22 00:44:39,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:44:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:39,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 00:44:39,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 00:44:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-22 00:44:39,566 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-22 00:44:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 00:44:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 00:44:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 00:44:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 00:44:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 00:44:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 00:44:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:44:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:44:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:44:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:44:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 00:44:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:44:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:44:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 00:44:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:44:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:44:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:44:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 00:44:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:44:39,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:44:39,646 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:44:39,648 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:44:39,676 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-22 00:44:39,934 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-22 00:44:39,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:44:39,943 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:44:39,944 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-22 00:44:39,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:39 BoogieIcfgContainer [2024-11-22 00:44:39,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:44:39,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:44:39,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:44:39,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:44:39,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:44:39" (1/3) ... [2024-11-22 00:44:39,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d01466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:44:39, skipping insertion in model container [2024-11-22 00:44:39,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:39" (2/3) ... [2024-11-22 00:44:39,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d01466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:44:39, skipping insertion in model container [2024-11-22 00:44:39,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:39" (3/3) ... [2024-11-22 00:44:39,951 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2024-11-22 00:44:39,969 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:44:39,969 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 00:44:40,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:44:40,035 INFO L333 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, 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;@34aaa6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:44:40,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 00:44:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 50 states have internal predecessors, (78), 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) [2024-11-22 00:44:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 00:44:40,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:40,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:44:40,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash -146872147, now seen corresponding path program 1 times [2024-11-22 00:44:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80507360] [2024-11-22 00:44:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:44:40,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:40,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80507360] [2024-11-22 00:44:40,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80507360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:40,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:40,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 00:44:40,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189789429] [2024-11-22 00:44:40,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:40,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:44:40,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:40,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:44:40,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:44:40,212 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 50 states have internal predecessors, (78), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-11-22 00:44:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:40,231 INFO L93 Difference]: Finished difference Result 102 states and 160 transitions. [2024-11-22 00:44:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:44:40,233 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2024-11-22 00:44:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:40,237 INFO L225 Difference]: With dead ends: 102 [2024-11-22 00:44:40,237 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 00:44:40,239 INFO L431 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 [2024-11-22 00:44:40,241 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:40,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 00:44:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-22 00:44:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 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) [2024-11-22 00:44:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-22 00:44:40,285 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2024-11-22 00:44:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:40,285 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-22 00:44:40,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-11-22 00:44:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-22 00:44:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 00:44:40,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:40,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:44:40,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:44:40,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:40,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1237728308, now seen corresponding path program 1 times [2024-11-22 00:44:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:40,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536489276] [2024-11-22 00:44:40,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:44:40,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:40,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536489276] [2024-11-22 00:44:40,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536489276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:40,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:40,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:44:40,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421824408] [2024-11-22 00:44:40,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:40,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:44:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:40,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:44:40,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:44:40,381 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-11-22 00:44:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:40,402 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-11-22 00:44:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:44:40,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-11-22 00:44:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:40,406 INFO L225 Difference]: With dead ends: 71 [2024-11-22 00:44:40,406 INFO L226 Difference]: Without dead ends: 51 [2024-11-22 00:44:40,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:44:40,407 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:40,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-22 00:44:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-22 00:44:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.46) internal successors, (73), 50 states have internal predecessors, (73), 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) [2024-11-22 00:44:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-22 00:44:40,417 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2024-11-22 00:44:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:40,417 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-22 00:44:40,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-11-22 00:44:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-22 00:44:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 00:44:40,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:40,420 INFO L215 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, 1] [2024-11-22 00:44:40,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:44:40,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:40,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1368149959, now seen corresponding path program 1 times [2024-11-22 00:44:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:40,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582005182] [2024-11-22 00:44:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:40,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:44:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:40,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582005182] [2024-11-22 00:44:40,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582005182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:40,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:40,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:44:40,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564141046] [2024-11-22 00:44:40,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:40,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:44:40,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:44:40,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:44:40,746 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-22 00:44:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:40,930 INFO L93 Difference]: Finished difference Result 129 states and 191 transitions. [2024-11-22 00:44:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:44:40,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2024-11-22 00:44:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:40,932 INFO L225 Difference]: With dead ends: 129 [2024-11-22 00:44:40,932 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 00:44:40,933 INFO L431 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 [2024-11-22 00:44:40,933 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 70 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:40,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 178 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:44:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 00:44:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2024-11-22 00:44:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 73 states have internal predecessors, (109), 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) [2024-11-22 00:44:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2024-11-22 00:44:40,945 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 27 [2024-11-22 00:44:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:40,945 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2024-11-22 00:44:40,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-22 00:44:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2024-11-22 00:44:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 00:44:40,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:40,946 INFO L215 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, 1] [2024-11-22 00:44:40,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 00:44:40,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2109168887, now seen corresponding path program 1 times [2024-11-22 00:44:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:40,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680817037] [2024-11-22 00:44:40,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:41,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680817037] [2024-11-22 00:44:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680817037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:41,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:44:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093748667] [2024-11-22 00:44:41,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:41,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:44:41,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:41,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:44:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:44:41,060 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-22 00:44:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:41,113 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2024-11-22 00:44:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 00:44:41,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2024-11-22 00:44:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:41,114 INFO L225 Difference]: With dead ends: 91 [2024-11-22 00:44:41,115 INFO L226 Difference]: Without dead ends: 87 [2024-11-22 00:44:41,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:44:41,117 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:41,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 192 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-22 00:44:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-22 00:44:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 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) [2024-11-22 00:44:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-22 00:44:41,130 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 27 [2024-11-22 00:44:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-22 00:44:41,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-22 00:44:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-22 00:44:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 00:44:41,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:41,132 INFO L215 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] [2024-11-22 00:44:41,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 00:44:41,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:41,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash -264583150, now seen corresponding path program 1 times [2024-11-22 00:44:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66304762] [2024-11-22 00:44:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66304762] [2024-11-22 00:44:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66304762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:41,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:44:41,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878001093] [2024-11-22 00:44:41,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:41,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:44:41,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:44:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:44:41,255 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2024-11-22 00:44:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:41,302 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2024-11-22 00:44:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 00:44:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2024-11-22 00:44:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:41,303 INFO L225 Difference]: With dead ends: 93 [2024-11-22 00:44:41,304 INFO L226 Difference]: Without dead ends: 85 [2024-11-22 00:44:41,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:44:41,305 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:41,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-22 00:44:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-22 00:44:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.475) internal successors, (118), 80 states have internal predecessors, (118), 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) [2024-11-22 00:44:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-22 00:44:41,315 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 29 [2024-11-22 00:44:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:41,315 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-22 00:44:41,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2024-11-22 00:44:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-22 00:44:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 00:44:41,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:41,317 INFO L215 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] [2024-11-22 00:44:41,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 00:44:41,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 760119826, now seen corresponding path program 1 times [2024-11-22 00:44:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:41,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572443351] [2024-11-22 00:44:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:41,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572443351] [2024-11-22 00:44:41,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572443351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:41,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:44:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642482332] [2024-11-22 00:44:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:41,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:44:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:44:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:44:41,431 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2024-11-22 00:44:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:41,485 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2024-11-22 00:44:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 00:44:41,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2024-11-22 00:44:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:41,486 INFO L225 Difference]: With dead ends: 93 [2024-11-22 00:44:41,486 INFO L226 Difference]: Without dead ends: 82 [2024-11-22 00:44:41,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:44:41,487 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:41,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 199 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-22 00:44:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-22 00:44:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 77 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) [2024-11-22 00:44:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-11-22 00:44:41,498 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 29 [2024-11-22 00:44:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:41,498 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-11-22 00:44:41,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2024-11-22 00:44:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-11-22 00:44:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 00:44:41,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:41,500 INFO L215 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, 1] [2024-11-22 00:44:41,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 00:44:41,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:41,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash -219954082, now seen corresponding path program 1 times [2024-11-22 00:44:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019020183] [2024-11-22 00:44:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:41,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019020183] [2024-11-22 00:44:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019020183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:41,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117601985] [2024-11-22 00:44:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:41,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:41,718 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) [2024-11-22 00:44:41,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 00:44:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:41,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 00:44:41,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:41,876 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 [2024-11-22 00:44:41,931 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:44:41,931 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 [2024-11-22 00:44:41,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 [2024-11-22 00:44:41,982 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 [2024-11-22 00:44:41,998 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 [2024-11-22 00:44:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:42,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:43,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_198 Int) (v_ArrVal_202 (Array Int Int))) (= 2 (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_198)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-11-22 00:44:43,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:43,154 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 [2024-11-22 00:44:43,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:43,164 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 [2024-11-22 00:44:43,174 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 [2024-11-22 00:44:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117601985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:43,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:43,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-22 00:44:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41236557] [2024-11-22 00:44:43,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:43,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 00:44:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:43,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 00:44:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=102, Unknown=2, NotChecked=20, Total=156 [2024-11-22 00:44:43,288 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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) [2024-11-22 00:44:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:43,457 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2024-11-22 00:44:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 00:44:43,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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 31 [2024-11-22 00:44:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:43,458 INFO L225 Difference]: With dead ends: 95 [2024-11-22 00:44:43,458 INFO L226 Difference]: Without dead ends: 89 [2024-11-22 00:44:43,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=181, Unknown=2, NotChecked=28, Total=272 [2024-11-22 00:44:43,459 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 21 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:43,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 416 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 120 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2024-11-22 00:44:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-22 00:44:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-22 00:44:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 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) [2024-11-22 00:44:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-22 00:44:43,464 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 31 [2024-11-22 00:44:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:43,464 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-22 00:44:43,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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) [2024-11-22 00:44:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-22 00:44:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 00:44:43,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:43,465 INFO L215 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, 1] [2024-11-22 00:44:43,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 00:44:43,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:43,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:43,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash 643447582, now seen corresponding path program 1 times [2024-11-22 00:44:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:43,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969122097] [2024-11-22 00:44:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:43,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969122097] [2024-11-22 00:44:43,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969122097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599794084] [2024-11-22 00:44:43,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:43,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:43,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:43,861 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) [2024-11-22 00:44:43,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 00:44:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:43,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 00:44:43,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:43,951 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 [2024-11-22 00:44:43,968 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 [2024-11-22 00:44:43,977 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:44:43,977 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 [2024-11-22 00:44:43,996 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 00:44:44,017 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 [2024-11-22 00:44:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:44,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:44,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~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 [2024-11-22 00:44:45,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:45,062 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 [2024-11-22 00:44:45,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:45,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 30 treesize of output 33 [2024-11-22 00:44:45,073 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 [2024-11-22 00:44:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-22 00:44:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599794084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:45,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:45,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-22 00:44:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91117895] [2024-11-22 00:44:45,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 00:44:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 00:44:45,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=5, NotChecked=18, Total=132 [2024-11-22 00:44:45,129 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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) [2024-11-22 00:44:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:45,433 INFO L93 Difference]: Finished difference Result 100 states and 139 transitions. [2024-11-22 00:44:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 00:44:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 31 [2024-11-22 00:44:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:45,434 INFO L225 Difference]: With dead ends: 100 [2024-11-22 00:44:45,434 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 00:44:45,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=175, Unknown=7, NotChecked=28, Total=272 [2024-11-22 00:44:45,435 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 29 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:45,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 462 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2024-11-22 00:44:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 00:44:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-22 00:44:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 93 states have internal predecessors, (133), 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) [2024-11-22 00:44:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2024-11-22 00:44:45,440 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 31 [2024-11-22 00:44:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:45,440 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2024-11-22 00:44:45,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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) [2024-11-22 00:44:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2024-11-22 00:44:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 00:44:45,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:45,441 INFO L215 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] [2024-11-22 00:44:45,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 00:44:45,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-22 00:44:45,646 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 150907833, now seen corresponding path program 1 times [2024-11-22 00:44:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:45,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327193762] [2024-11-22 00:44:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:45,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:44:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327193762] [2024-11-22 00:44:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327193762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808586023] [2024-11-22 00:44:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:46,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:46,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:46,043 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) [2024-11-22 00:44:46,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 00:44:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:46,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-22 00:44:46,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:46,131 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 [2024-11-22 00:44:46,180 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:44:46,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 11 treesize of output 11 [2024-11-22 00:44:46,211 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 [2024-11-22 00:44:46,216 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 [2024-11-22 00:44:46,267 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 00:44:46,268 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 [2024-11-22 00:44:46,273 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 [2024-11-22 00:44:46,278 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 [2024-11-22 00:44:46,312 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 [2024-11-22 00:44:46,317 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 [2024-11-22 00:44:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:46,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:46,381 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 [2024-11-22 00:44:46,387 WARN L851 $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 [2024-11-22 00:44:46,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:46,405 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 [2024-11-22 00:44:46,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:46,412 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 [2024-11-22 00:44:46,415 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 [2024-11-22 00:44:46,426 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:46,426 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 [2024-11-22 00:44:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-22 00:44:46,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808586023] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:46,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:46,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-11-22 00:44:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544609952] [2024-11-22 00:44:46,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:46,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 00:44:46,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:46,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 00:44:46,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=258, Unknown=1, NotChecked=32, Total=342 [2024-11-22 00:44:46,502 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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) [2024-11-22 00:44:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:46,751 INFO L93 Difference]: Finished difference Result 119 states and 162 transitions. [2024-11-22 00:44:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 00:44:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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 33 [2024-11-22 00:44:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:46,752 INFO L225 Difference]: With dead ends: 119 [2024-11-22 00:44:46,752 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 00:44:46,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=350, Unknown=1, NotChecked=38, Total=462 [2024-11-22 00:44:46,753 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 98 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:46,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 439 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 258 Invalid, 0 Unknown, 84 Unchecked, 0.2s Time] [2024-11-22 00:44:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 00:44:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2024-11-22 00:44:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4134615384615385) internal successors, (147), 104 states have internal predecessors, (147), 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) [2024-11-22 00:44:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-22 00:44:46,767 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 33 [2024-11-22 00:44:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:46,767 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-22 00:44:46,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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) [2024-11-22 00:44:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-22 00:44:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 00:44:46,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:46,768 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-22 00:44:46,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 00:44:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:46,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:46,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1557127099, now seen corresponding path program 2 times [2024-11-22 00:44:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:46,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163421879] [2024-11-22 00:44:46,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:44:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:46,991 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:44:46,991 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:47,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:47,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163421879] [2024-11-22 00:44:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163421879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:47,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700732778] [2024-11-22 00:44:47,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:44:47,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:47,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:47,330 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) [2024-11-22 00:44:47,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 00:44:47,423 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:44:47,424 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:47,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-22 00:44:47,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:47,443 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 [2024-11-22 00:44:47,472 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 [2024-11-22 00:44:47,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:44:47,481 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 [2024-11-22 00:44:47,502 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 23 treesize of output 11 [2024-11-22 00:44:47,515 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 [2024-11-22 00:44:47,543 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 [2024-11-22 00:44:47,586 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-22 00:44:47,587 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 [2024-11-22 00:44:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:44:47,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:47,760 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_42| Int) (v_ArrVal_465 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_465))) (or (= 2 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_42| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_42|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2024-11-22 00:44:47,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_42| Int) (v_ArrVal_465 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_465))) (or (= 2 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_42| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_42|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2024-11-22 00:44:47,789 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_42| Int) (v_ArrVal_460 Int) (v_ArrVal_465 (Array Int Int))) (let ((.cse0 (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_460)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_465))) (or (= 2 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_42| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_42|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))) is different from false [2024-11-22 00:44:47,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:47,806 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 71 treesize of output 50 [2024-11-22 00:44:47,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:47,822 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 299 treesize of output 303 [2024-11-22 00:44:47,831 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 143 treesize of output 133 [2024-11-22 00:44:47,851 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 [2024-11-22 00:44:47,875 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 [2024-11-22 00:44:47,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:47,986 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 43 treesize of output 43 [2024-11-22 00:44:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-22 00:44:48,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700732778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:48,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:48,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 24 [2024-11-22 00:44:48,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208667331] [2024-11-22 00:44:48,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:48,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 00:44:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:48,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 00:44:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=354, Unknown=3, NotChecked=120, Total=552 [2024-11-22 00:44:48,085 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 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) [2024-11-22 00:44:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:48,470 INFO L93 Difference]: Finished difference Result 130 states and 177 transitions. [2024-11-22 00:44:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 00:44:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 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 35 [2024-11-22 00:44:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:48,471 INFO L225 Difference]: With dead ends: 130 [2024-11-22 00:44:48,471 INFO L226 Difference]: Without dead ends: 125 [2024-11-22 00:44:48,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=721, Unknown=3, NotChecked=174, Total=1056 [2024-11-22 00:44:48,472 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 70 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:48,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 415 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 259 Invalid, 0 Unknown, 282 Unchecked, 0.2s Time] [2024-11-22 00:44:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-22 00:44:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2024-11-22 00:44:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 112 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) [2024-11-22 00:44:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-11-22 00:44:48,481 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 35 [2024-11-22 00:44:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:48,481 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-11-22 00:44:48,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 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) [2024-11-22 00:44:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-11-22 00:44:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 00:44:48,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:48,482 INFO L215 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] [2024-11-22 00:44:48,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 00:44:48,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:48,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:48,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:48,683 INFO L85 PathProgramCache]: Analyzing trace with hash -957780396, now seen corresponding path program 1 times [2024-11-22 00:44:48,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:48,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640416044] [2024-11-22 00:44:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:48,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:44:49,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640416044] [2024-11-22 00:44:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640416044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110862024] [2024-11-22 00:44:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:49,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:49,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:49,013 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) [2024-11-22 00:44:49,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 00:44:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:49,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-22 00:44:49,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:49,109 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 [2024-11-22 00:44:49,150 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:44:49,151 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 [2024-11-22 00:44:49,174 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 [2024-11-22 00:44:49,178 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 [2024-11-22 00:44:49,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 00:44:49,216 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 [2024-11-22 00:44:49,221 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 [2024-11-22 00:44:49,225 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 [2024-11-22 00:44:49,254 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 [2024-11-22 00:44:49,258 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 [2024-11-22 00:44:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:49,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:49,310 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 [2024-11-22 00:44:49,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:49,350 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 [2024-11-22 00:44:49,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:49,356 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 [2024-11-22 00:44:49,359 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 [2024-11-22 00:44:49,371 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:49,371 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 [2024-11-22 00:44:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110862024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:49,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:49,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-11-22 00:44:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401102329] [2024-11-22 00:44:49,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:49,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 00:44:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:49,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 00:44:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=353, Unknown=8, NotChecked=0, Total=420 [2024-11-22 00:44:49,447 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 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) [2024-11-22 00:44:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:49,762 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2024-11-22 00:44:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 00:44:49,762 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 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 35 [2024-11-22 00:44:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:49,763 INFO L225 Difference]: With dead ends: 127 [2024-11-22 00:44:49,763 INFO L226 Difference]: Without dead ends: 117 [2024-11-22 00:44:49,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=630, Unknown=8, NotChecked=0, Total=756 [2024-11-22 00:44:49,764 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:49,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 706 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 00:44:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-22 00:44:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2024-11-22 00:44:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 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) [2024-11-22 00:44:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2024-11-22 00:44:49,768 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 35 [2024-11-22 00:44:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:49,769 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2024-11-22 00:44:49,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 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) [2024-11-22 00:44:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2024-11-22 00:44:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 00:44:49,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:49,769 INFO L215 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, 1] [2024-11-22 00:44:49,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 00:44:49,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-22 00:44:49,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:49,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash 66922580, now seen corresponding path program 2 times [2024-11-22 00:44:49,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:49,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680167944] [2024-11-22 00:44:49,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:44:49,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:49,983 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:44:49,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:44:50,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:50,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680167944] [2024-11-22 00:44:50,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680167944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:50,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943998432] [2024-11-22 00:44:50,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:44:50,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:50,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:50,311 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) [2024-11-22 00:44:50,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 00:44:50,423 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:44:50,423 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:50,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 00:44:50,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:50,434 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 [2024-11-22 00:44:50,468 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:44:50,468 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 [2024-11-22 00:44:50,486 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 [2024-11-22 00:44:50,493 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 [2024-11-22 00:44:50,529 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 00:44:50,530 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 [2024-11-22 00:44:50,533 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 [2024-11-22 00:44:50,535 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 [2024-11-22 00:44:50,560 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 [2024-11-22 00:44:50,562 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 [2024-11-22 00:44:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:50,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:50,601 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 [2024-11-22 00:44:50,606 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_624 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_624) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_623 (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_623) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-11-22 00:44:50,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:50,619 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 [2024-11-22 00:44:50,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:50,625 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 [2024-11-22 00:44:50,635 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 [2024-11-22 00:44:50,639 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:50,639 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 [2024-11-22 00:44:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-22 00:44:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943998432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:50,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:50,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2024-11-22 00:44:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757422847] [2024-11-22 00:44:50,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:50,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 00:44:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:50,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 00:44:50,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2024-11-22 00:44:50,733 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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) [2024-11-22 00:44:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:50,979 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2024-11-22 00:44:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 00:44:50,979 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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 35 [2024-11-22 00:44:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:50,980 INFO L225 Difference]: With dead ends: 122 [2024-11-22 00:44:50,980 INFO L226 Difference]: Without dead ends: 109 [2024-11-22 00:44:50,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=422, Unknown=1, NotChecked=42, Total=552 [2024-11-22 00:44:50,980 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:50,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 509 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 231 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2024-11-22 00:44:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-22 00:44:50,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2024-11-22 00:44:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 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) [2024-11-22 00:44:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 146 transitions. [2024-11-22 00:44:50,984 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 146 transitions. Word has length 35 [2024-11-22 00:44:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:50,984 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 146 transitions. [2024-11-22 00:44:50,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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) [2024-11-22 00:44:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2024-11-22 00:44:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:44:50,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:50,985 INFO L215 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, 1] [2024-11-22 00:44:50,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 00:44:51,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:51,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:51,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1701842976, now seen corresponding path program 1 times [2024-11-22 00:44:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:51,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676048768] [2024-11-22 00:44:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:51,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676048768] [2024-11-22 00:44:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676048768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541015433] [2024-11-22 00:44:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:51,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:51,507 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) [2024-11-22 00:44:51,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 00:44:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:51,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 00:44:51,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:51,616 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 [2024-11-22 00:44:51,666 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 00:44:51,667 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 [2024-11-22 00:44:51,673 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 [2024-11-22 00:44:51,701 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 00:44:51,731 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:44:51,731 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 [2024-11-22 00:44:51,736 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 [2024-11-22 00:44:51,765 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 [2024-11-22 00:44:51,786 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 [2024-11-22 00:44:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:44:51,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:51,838 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-22 00:44:51,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_33|) 0)) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_733) |v_ULTIMATE.start_main_~t~0#1.base_33| v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-11-22 00:44:51,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:51,919 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 27 treesize of output 33 [2024-11-22 00:44:51,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:51,926 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 131 treesize of output 130 [2024-11-22 00:44:51,931 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 52 treesize of output 50 [2024-11-22 00:44:51,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 50 treesize of output 46 [2024-11-22 00:44:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-22 00:44:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541015433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:52,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2024-11-22 00:44:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784091970] [2024-11-22 00:44:52,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:52,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 00:44:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:52,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 00:44:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=550, Unknown=7, NotChecked=98, Total=756 [2024-11-22 00:44:52,149 INFO L87 Difference]: Start difference. First operand 105 states and 146 transitions. Second operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 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) [2024-11-22 00:44:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:52,429 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2024-11-22 00:44:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 00:44:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 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 37 [2024-11-22 00:44:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:52,430 INFO L225 Difference]: With dead ends: 118 [2024-11-22 00:44:52,430 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 00:44:52,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=773, Unknown=7, NotChecked=118, Total=1056 [2024-11-22 00:44:52,430 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 41 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:52,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 560 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 182 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2024-11-22 00:44:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 00:44:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2024-11-22 00:44:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 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) [2024-11-22 00:44:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-11-22 00:44:52,434 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 37 [2024-11-22 00:44:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:52,434 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-11-22 00:44:52,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 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) [2024-11-22 00:44:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-11-22 00:44:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:44:52,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:52,435 INFO L215 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, 1] [2024-11-22 00:44:52,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-22 00:44:52,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:52,640 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:52,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:52,640 INFO L85 PathProgramCache]: Analyzing trace with hash -677140000, now seen corresponding path program 3 times [2024-11-22 00:44:52,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:52,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315261517] [2024-11-22 00:44:52,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 00:44:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:52,661 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 00:44:52,661 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:44:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315261517] [2024-11-22 00:44:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315261517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340550670] [2024-11-22 00:44:53,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 00:44:53,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:53,117 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) [2024-11-22 00:44:53,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 00:44:53,244 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 00:44:53,244 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:44:53,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-22 00:44:53,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:53,265 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 [2024-11-22 00:44:53,300 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:44:53,300 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 [2024-11-22 00:44:53,342 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 [2024-11-22 00:44:53,345 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 [2024-11-22 00:44:53,382 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-22 00:44:53,382 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 [2024-11-22 00:44:53,389 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 [2024-11-22 00:44:53,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:44:53,396 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 [2024-11-22 00:44:53,447 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 00:44:53,447 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 [2024-11-22 00:44:53,452 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 [2024-11-22 00:44:53,458 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 [2024-11-22 00:44:53,524 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 00:44:53,524 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 34 [2024-11-22 00:44:53,551 INFO L349 Elim1Store]: treesize reduction 28, result has 45.1 percent of original size [2024-11-22 00:44:53,552 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 25 treesize of output 33 [2024-11-22 00:44:53,567 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-22 00:44:53,567 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 [2024-11-22 00:44:53,590 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 [2024-11-22 00:44:53,751 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 [2024-11-22 00:44:53,754 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 [2024-11-22 00:44:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:44:53,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:44:54,216 INFO L349 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2024-11-22 00:44:54,217 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 3147 treesize of output 2969 [2024-11-22 00:44:54,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:54,249 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 577 treesize of output 515 [2024-11-22 00:44:54,831 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 [2024-11-22 00:44:56,147 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_76|))))) (.cse6 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (forall ((v_ArrVal_848 (Array Int Int))) (let ((.cse59 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse59 0) (= .cse59 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (.cse3 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) (.cse4 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse58 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse58 |v_ULTIMATE.start_main_~p~0#1.base_76|)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2))))))) (.cse14 (= .cse2 0)) (.cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse57 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse57 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|))))) (.cse16 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse56 |v_ULTIMATE.start_main_~p~0#1.base_76|))))))) (.cse21 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse0 |v_ULTIMATE.start_main_~p~0#1.base_76|) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse2) 0)))))) (or .cse3 (and .cse4 .cse5 .cse6)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse8 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse8 .cse2)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse9 |v_ULTIMATE.start_main_~p~0#1.base_76|) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|))) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse10 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse11 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= .cse11 .cse2))))))) .cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse13 |v_ULTIMATE.start_main_~p~0#1.base_76|)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2)))))) (or .cse14 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_843 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2)) (not (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse16)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse17 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse17 .cse2) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse18 0) (not (= (select v_arrayElimArr_11 .cse2) 0))))))) (or (and .cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= .cse19 .cse2))))) (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse20 |v_ULTIMATE.start_main_~p~0#1.base_76|)))))) .cse6) .cse21) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_848 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse22 0) (= .cse22 .cse2) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse2) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (let ((.cse31 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse50 |v_ULTIMATE.start_main_~p~0#1.base_76|))))))) (.cse32 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse49 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|))))) (.cse39 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_76|))))) (.cse33 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse47 |v_ULTIMATE.start_main_~p~0#1.base_76|)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2))))))) (.cse40 (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (forall ((v_ArrVal_848 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse46 0) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse24 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse24 .cse2)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse25 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse25 .cse2) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse26 .cse2) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_76|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse27 .cse2) (= .cse27 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse28 |v_ULTIMATE.start_main_~p~0#1.base_76|)))))) (forall ((v_ArrVal_843 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int) (v_ArrVal_850 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |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_76|) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or .cse21 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse30 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= .cse30 .cse2))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_843 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse14) .cse31 .cse32 .cse33)) (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_848 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse34 0) (= .cse34 .cse2) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse2) 0)))) (or .cse3 (and (or .cse14 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_843 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2)) (not (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse37 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= .cse37 .cse2))))))) .cse31 .cse32 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse38 |v_ULTIMATE.start_main_~p~0#1.base_76|)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2)))))))) (or (and .cse39 .cse40 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= .cse41 .cse2))))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse42 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse42 |v_ULTIMATE.start_main_~p~0#1.base_76|))))))) .cse21) (or .cse3 (and .cse39 .cse33 .cse40)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse43 0) (not (= (select v_arrayElimArr_11 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse44 |v_ULTIMATE.start_main_~p~0#1.base_76|) (= .cse44 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse2) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_11 .cse2) 0)))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse51 .cse2) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse52 |v_ULTIMATE.start_main_~p~0#1.base_76|)))))) (or (and .cse4 (or .cse14 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_843 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse53 0) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= .cse53 .cse2))))))) .cse16) .cse21) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_11 .cse2) 0)))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_76| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_848) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse55 .cse2) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_843) |v_ULTIMATE.start_main_~p~0#1.base_76| v_ArrVal_850) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |v_ULTIMATE.start_main_~p~0#1.base_76|))))))) is different from false [2024-11-22 00:44:57,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 58 [2024-11-22 00:44:57,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,316 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 [2024-11-22 00:44:57,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:44:57,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,329 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 90 treesize of output 77 [2024-11-22 00:44:57,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:44:57,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,339 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 [2024-11-22 00:44:57,346 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 [2024-11-22 00:44:57,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,363 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 44 treesize of output 36 [2024-11-22 00:44:57,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,380 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 43 [2024-11-22 00:44:57,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,387 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 [2024-11-22 00:44:57,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:44:57,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,403 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 65 treesize of output 58 [2024-11-22 00:44:57,406 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:44:57,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,414 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 [2024-11-22 00:44:57,426 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 15 [2024-11-22 00:44:57,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,441 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 [2024-11-22 00:44:57,465 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,467 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 1 [2024-11-22 00:44:57,475 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,475 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 78 treesize of output 1 [2024-11-22 00:44:57,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,493 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 [2024-11-22 00:44:57,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,500 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 25 treesize of output 26 [2024-11-22 00:44:57,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:44:57,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:44:57,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:44:57,515 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 61 treesize of output 43 [2024-11-22 00:44:57,520 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 [2024-11-22 00:44:57,522 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 10 treesize of output 4 [2024-11-22 00:44:57,525 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 [2024-11-22 00:44:57,528 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 [2024-11-22 00:44:57,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,535 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 [2024-11-22 00:44:57,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:44:57,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 80 treesize of output 74 [2024-11-22 00:44:57,546 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 [2024-11-22 00:44:57,551 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 25 [2024-11-22 00:44:57,572 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,572 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 26 treesize of output 1 [2024-11-22 00:44:57,580 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,581 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 [2024-11-22 00:44:57,589 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,590 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 26 treesize of output 1 [2024-11-22 00:44:57,599 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,599 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 23 treesize of output 1 [2024-11-22 00:44:57,607 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,607 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 47 treesize of output 1 [2024-11-22 00:44:57,614 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,614 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 23 treesize of output 1 [2024-11-22 00:44:57,621 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,622 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 23 treesize of output 1 [2024-11-22 00:44:57,630 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,631 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 23 treesize of output 1 [2024-11-22 00:44:57,641 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,641 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 72 treesize of output 1 [2024-11-22 00:44:57,653 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,653 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 47 treesize of output 1 [2024-11-22 00:44:57,662 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,662 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 26 treesize of output 1 [2024-11-22 00:44:57,669 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,669 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 47 treesize of output 1 [2024-11-22 00:44:57,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,674 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 70 treesize of output 50 [2024-11-22 00:44:57,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:44:57,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:44:57,686 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 74 treesize of output 67 [2024-11-22 00:44:57,700 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 22 [2024-11-22 00:44:57,727 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,727 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 26 treesize of output 1 [2024-11-22 00:44:57,738 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,739 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 26 treesize of output 1 [2024-11-22 00:44:57,746 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,747 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 23 treesize of output 1 [2024-11-22 00:44:57,754 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,754 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 47 treesize of output 1 [2024-11-22 00:44:57,763 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,763 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 50 treesize of output 1 [2024-11-22 00:44:57,773 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,773 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 47 treesize of output 1 [2024-11-22 00:44:57,779 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,779 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 47 treesize of output 1 [2024-11-22 00:44:57,786 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 00:44:57,787 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 [2024-11-22 00:44:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-22 00:44:57,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340550670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:44:57,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:44:57,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 34 [2024-11-22 00:44:57,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559148514] [2024-11-22 00:44:57,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:44:57,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-22 00:44:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:57,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-22 00:44:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=951, Unknown=2, NotChecked=62, Total=1122 [2024-11-22 00:44:57,941 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 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) [2024-11-22 00:45:05,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 00:45:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:45:06,517 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2024-11-22 00:45:06,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 00:45:06,517 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 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) Word has length 37 [2024-11-22 00:45:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:45:06,518 INFO L225 Difference]: With dead ends: 129 [2024-11-22 00:45:06,518 INFO L226 Difference]: Without dead ends: 123 [2024-11-22 00:45:06,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=238, Invalid=2020, Unknown=2, NotChecked=92, Total=2352 [2024-11-22 00:45:06,519 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 90 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-22 00:45:06,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 779 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 479 Invalid, 1 Unknown, 86 Unchecked, 4.5s Time] [2024-11-22 00:45:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-22 00:45:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2024-11-22 00:45:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 112 states have internal predecessors, (155), 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) [2024-11-22 00:45:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2024-11-22 00:45:06,524 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 155 transitions. Word has length 37 [2024-11-22 00:45:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:45:06,524 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 155 transitions. [2024-11-22 00:45:06,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 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) [2024-11-22 00:45:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2024-11-22 00:45:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:45:06,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:45:06,524 INFO L215 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, 1] [2024-11-22 00:45:06,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 00:45:06,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-22 00:45:06,725 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:45:06,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:45:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1451075936, now seen corresponding path program 1 times [2024-11-22 00:45:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:45:06,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487352908] [2024-11-22 00:45:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:45:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:45:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:45:06,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 00:45:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:45:06,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 00:45:06,765 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 00:45:06,767 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 00:45:06,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 00:45:06,770 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:45:06,792 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 00:45:06,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:45:06 BoogieIcfgContainer [2024-11-22 00:45:06,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 00:45:06,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 00:45:06,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 00:45:06,795 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 00:45:06,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:39" (3/4) ... [2024-11-22 00:45:06,796 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 00:45:06,830 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 00:45:06,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 00:45:06,830 INFO L158 Benchmark]: Toolchain (without parser) took 27752.08ms. Allocated memory was 184.5MB in the beginning and 356.5MB in the end (delta: 172.0MB). Free memory was 126.0MB in the beginning and 144.3MB in the end (delta: -18.3MB). Peak memory consumption was 156.5MB. Max. memory is 16.1GB. [2024-11-22 00:45:06,831 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory was 149.8MB in the beginning and 149.5MB in the end (delta: 277.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:45:06,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.47ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 105.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 00:45:06,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.64ms. Allocated memory is still 184.5MB. Free memory was 105.9MB in the beginning and 103.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:45:06,832 INFO L158 Benchmark]: Boogie Preprocessor took 43.74ms. Allocated memory is still 184.5MB. Free memory was 103.5MB in the beginning and 99.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 00:45:06,832 INFO L158 Benchmark]: RCFGBuilder took 444.12ms. Allocated memory is still 184.5MB. Free memory was 99.7MB in the beginning and 74.1MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 00:45:06,832 INFO L158 Benchmark]: TraceAbstraction took 26847.59ms. Allocated memory was 184.5MB in the beginning and 356.5MB in the end (delta: 172.0MB). Free memory was 73.7MB in the beginning and 147.5MB in the end (delta: -73.8MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2024-11-22 00:45:06,832 INFO L158 Benchmark]: Witness Printer took 35.49ms. Allocated memory is still 356.5MB. Free memory was 147.5MB in the beginning and 144.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 00:45:06,835 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.16ms. Allocated memory is still 184.5MB. Free memory was 149.8MB in the beginning and 149.5MB in the end (delta: 277.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.47ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 105.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.64ms. Allocated memory is still 184.5MB. Free memory was 105.9MB in the beginning and 103.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.74ms. Allocated memory is still 184.5MB. Free memory was 103.5MB in the beginning and 99.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 444.12ms. Allocated memory is still 184.5MB. Free memory was 99.7MB in the beginning and 74.1MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26847.59ms. Allocated memory was 184.5MB in the beginning and 356.5MB in the end (delta: 172.0MB). Free memory was 73.7MB in the beginning and 147.5MB in the end (delta: -73.8MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. * Witness Printer took 35.49ms. Allocated memory is still 356.5MB. Free memory was 147.5MB in the beginning and 144.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 620]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; VAL [root={-1:0}] [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] EXPR n->left [L579] n->left || n->right VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) VAL [n={-1:0}, root={0:0}] [L576] COND FALSE !(\read(*root)) [L595] List a = (List) malloc(sizeof(struct node)); [L596] COND FALSE !(a == 0) VAL [a={-2:0}] [L597] List t; [L598] List p = a; VAL [a={-2:0}, p={-2:0}] [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) [L602] COND FALSE !(t == 0) VAL [a={-2:0}, p={-2:0}, t={-3:0}] [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) [L609] COND FALSE !(t == 0) VAL [a={-2:0}, p={-3:0}, t={-4:0}] [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a VAL [p={-2:0}] [L615] EXPR p->h [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n VAL [p={-3:0}] [L617] EXPR p->h [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h [L619] COND TRUE p->h != 3 [L620] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 596 mSDsluCounter, 5216 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 669 IncrementalHoareTripleChecker+Unchecked, 4473 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2299 IncrementalHoareTripleChecker+Invalid, 3136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 743 mSDtfsCounter, 2299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 477 SyntacticMatches, 7 SemanticMatches, 224 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=10, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 91 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 734 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 941 ConstructedInterpolants, 89 QuantifiedInterpolants, 15112 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1720 ConjunctsInSsa, 348 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 50/182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-22 00:45:06,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE