./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme --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 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:52:55,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:52:56,093 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:52:56,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:52:56,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:52:56,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:52:56,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:52:56,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:52:56,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:52:56,158 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:52:56,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:52:56,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:52:56,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:52:56,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:52:56,161 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:52:56,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:52:56,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:52:56,163 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:52:56,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:52:56,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:52:56,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:52:56,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:52:56,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:52:56,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:52:56,167 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:52:56,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:52:56,168 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:52:56,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:52:56,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:52:56,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:52:56,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:52:56,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:52:56,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:52:56,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:52:56,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:52:56,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:52:56,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:52:56,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:52:56,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:52:56,175 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:52:56,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:52:56,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:52:56,176 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme 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 -> 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 [2023-11-26 11:52:56,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:52:56,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:52:56,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:52:56,485 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:52:56,486 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:52:56,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2023-11-26 11:52:59,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:53:00,100 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:53:00,101 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2023-11-26 11:53:00,130 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/data/0ed179229/d25656d4f9d84ba8b096c0d0645ad597/FLAGbaa3373f3 [2023-11-26 11:53:00,146 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/data/0ed179229/d25656d4f9d84ba8b096c0d0645ad597 [2023-11-26 11:53:00,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:53:00,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:53:00,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:53:00,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:53:00,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:53:00,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eff715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00, skipping insertion in model container [2023-11-26 11:53:00,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,214 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:53:00,576 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-26 11:53:00,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:53:00,594 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:53:00,650 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-26 11:53:00,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:53:00,700 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:53:00,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00 WrapperNode [2023-11-26 11:53:00,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:53:00,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:53:00,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:53:00,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:53:00,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,769 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-11-26 11:53:00,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:53:00,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:53:00,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:53:00,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:53:00,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,825 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-11-26 11:53:00,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:53:00,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:53:00,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:53:00,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:53:00,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (1/1) ... [2023-11-26 11:53:00,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:53:00,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:53:00,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:53:00,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:53:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-26 11:53:00,947 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-26 11:53:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:53:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:53:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:53:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:53:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:53:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:53:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 11:53:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 11:53:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 11:53:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 11:53:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:53:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:53:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:53:00,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:53:01,117 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:53:01,119 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:53:01,195 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-26 11:53:01,339 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:53:01,365 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:53:01,365 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 11:53:01,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:53:01 BoogieIcfgContainer [2023-11-26 11:53:01,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:53:01,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:53:01,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:53:01,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:53:01,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:53:00" (1/3) ... [2023-11-26 11:53:01,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616c1e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:53:01, skipping insertion in model container [2023-11-26 11:53:01,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:00" (2/3) ... [2023-11-26 11:53:01,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616c1e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:53:01, skipping insertion in model container [2023-11-26 11:53:01,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:53:01" (3/3) ... [2023-11-26 11:53:01,378 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2023-11-26 11:53:01,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:53:01,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:53:01,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:53:01,458 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65c86183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:53:01,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:53:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-26 11:53:01,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:01,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:01,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:01,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-11-26 11:53:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:01,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066853096] [2023-11-26 11:53:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:01,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:53:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:01,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066853096] [2023-11-26 11:53:01,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066853096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:01,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:01,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:53:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789925620] [2023-11-26 11:53:01,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:01,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:53:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:53:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:53:01,797 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:01,825 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-26 11:53:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:53:01,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-11-26 11:53:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:01,837 INFO L225 Difference]: With dead ends: 34 [2023-11-26 11:53:01,837 INFO L226 Difference]: Without dead ends: 17 [2023-11-26 11:53:01,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:53:01,844 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:01,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:53:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-26 11:53:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-26 11:53:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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) [2023-11-26 11:53:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-26 11:53:01,884 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-11-26 11:53:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:01,885 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-26 11:53:01,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-26 11:53:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-26 11:53:01,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:01,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:01,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:53:01,888 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:01,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-11-26 11:53:01,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:01,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888271199] [2023-11-26 11:53:01,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:01,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:53:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:02,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888271199] [2023-11-26 11:53:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888271199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:53:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353332245] [2023-11-26 11:53:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:02,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:53:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:02,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:53:02,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:53:02,049 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:02,080 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-26 11:53:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:53:02,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-11-26 11:53:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:02,082 INFO L225 Difference]: With dead ends: 27 [2023-11-26 11:53:02,083 INFO L226 Difference]: Without dead ends: 18 [2023-11-26 11:53:02,083 INFO L412 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 [2023-11-26 11:53:02,085 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:02,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:53:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-26 11:53:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-26 11:53:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-26 11:53:02,096 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-11-26 11:53:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:02,096 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-26 11:53:02,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-26 11:53:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-26 11:53:02,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:02,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:02,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:53:02,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:02,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:02,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2049023080, now seen corresponding path program 1 times [2023-11-26 11:53:02,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:02,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373627547] [2023-11-26 11:53:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:53:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:02,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373627547] [2023-11-26 11:53:02,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373627547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:02,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:02,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:53:02,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739018851] [2023-11-26 11:53:02,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:02,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:53:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:02,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:53:02,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:53:02,333 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:02,417 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-26 11:53:02,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:53:02,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-11-26 11:53:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:02,421 INFO L225 Difference]: With dead ends: 38 [2023-11-26 11:53:02,422 INFO L226 Difference]: Without dead ends: 23 [2023-11-26 11:53:02,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:53:02,424 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:02,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:53:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-26 11:53:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-26 11:53:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-26 11:53:02,436 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-11-26 11:53:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:02,436 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-26 11:53:02,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-26 11:53:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-26 11:53:02,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:02,438 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:02,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:53:02,438 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:02,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-11-26 11:53:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723259383] [2023-11-26 11:53:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 11:53:02,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723259383] [2023-11-26 11:53:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723259383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:02,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:02,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:53:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873122677] [2023-11-26 11:53:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:02,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:53:02,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:02,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:53:02,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:53:02,563 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:02,610 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-11-26 11:53:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:53:02,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-26 11:53:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:02,613 INFO L225 Difference]: With dead ends: 31 [2023-11-26 11:53:02,613 INFO L226 Difference]: Without dead ends: 28 [2023-11-26 11:53:02,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:53:02,625 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:02,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:53:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-26 11:53:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2023-11-26 11:53:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-26 11:53:02,639 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-11-26 11:53:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:02,640 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-26 11:53:02,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-26 11:53:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-26 11:53:02,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:02,643 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:02,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:53:02,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:02,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1477352526, now seen corresponding path program 1 times [2023-11-26 11:53:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:02,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328867218] [2023-11-26 11:53:02,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:02,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:53:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328867218] [2023-11-26 11:53:02,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328867218] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:53:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70693430] [2023-11-26 11:53:02,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:02,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:53:02,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:53:02,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:53:02,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:53:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:03,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:53:03,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:53:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:53:03,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:53:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:53:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70693430] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:53:03,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:53:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-26 11:53:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475536299] [2023-11-26 11:53:03,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:53:03,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:53:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:03,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:53:03,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:53:03,218 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:03,354 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-11-26 11:53:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:53:03,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-26 11:53:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:03,357 INFO L225 Difference]: With dead ends: 55 [2023-11-26 11:53:03,357 INFO L226 Difference]: Without dead ends: 39 [2023-11-26 11:53:03,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:53:03,359 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:03,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:53:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-26 11:53:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-11-26 11:53:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-26 11:53:03,373 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2023-11-26 11:53:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:03,374 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-26 11:53:03,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-26 11:53:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-26 11:53:03,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:03,377 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:03,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:53:03,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:53:03,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:03,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 2 times [2023-11-26 11:53:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:03,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166864609] [2023-11-26 11:53:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:53:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:03,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166864609] [2023-11-26 11:53:03,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166864609] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:53:03,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852481052] [2023-11-26 11:53:03,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:53:03,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:53:03,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:53:03,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:53:03,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:53:04,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:53:04,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:53:04,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-26 11:53:04,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:53:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:53:04,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:53:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:53:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852481052] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:53:04,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:53:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-11-26 11:53:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291120621] [2023-11-26 11:53:04,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:53:04,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-26 11:53:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:04,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-26 11:53:04,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-11-26 11:53:04,209 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:04,448 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-11-26 11:53:04,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-26 11:53:04,449 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 [2023-11-26 11:53:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:04,451 INFO L225 Difference]: With dead ends: 85 [2023-11-26 11:53:04,451 INFO L226 Difference]: Without dead ends: 69 [2023-11-26 11:53:04,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2023-11-26 11:53:04,453 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:04,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:53:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-26 11:53:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-11-26 11:53:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-11-26 11:53:04,463 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-11-26 11:53:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:04,464 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-11-26 11:53:04,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:53:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-11-26 11:53:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-26 11:53:04,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:04,467 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:04,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:53:04,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-26 11:53:04,674 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:04,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 3 times [2023-11-26 11:53:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929496702] [2023-11-26 11:53:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-26 11:53:10,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:10,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929496702] [2023-11-26 11:53:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929496702] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:53:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361520812] [2023-11-26 11:53:10,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 11:53:10,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:53:10,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:53:10,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:53:10,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d70cef-0887-4d0b-a516-bb412234f2c5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 11:53:23,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-26 11:53:23,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:53:23,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-26 11:53:23,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:53:23,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:53:23,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:53:23,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-26 11:53:23,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:53:23,774 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-26 11:53:23,775 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 32 treesize of output 23 [2023-11-26 11:53:23,860 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:53:23,860 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 33 treesize of output 32 [2023-11-26 11:53:23,945 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-26 11:53:23,945 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 25 treesize of output 22 [2023-11-26 11:53:23,972 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 13 treesize of output 9 [2023-11-26 11:53:24,139 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-26 11:53:24,140 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 37 treesize of output 25 [2023-11-26 11:53:24,238 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-26 11:53:24,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-26 11:53:24,353 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-26 11:53:24,354 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 28 treesize of output 20 [2023-11-26 11:53:24,465 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-26 11:53:24,465 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 17 treesize of output 16 [2023-11-26 11:53:24,546 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-26 11:53:24,546 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 28 treesize of output 20 [2023-11-26 11:53:24,656 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-26 11:53:24,656 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 17 treesize of output 16 [2023-11-26 11:53:24,737 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-26 11:53:24,737 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 28 treesize of output 20 [2023-11-26 11:53:24,830 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-26 11:53:24,830 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 17 treesize of output 16 [2023-11-26 11:53:24,911 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-26 11:53:24,912 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 28 treesize of output 20 [2023-11-26 11:53:24,966 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-26 11:53:24,967 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 17 treesize of output 16 [2023-11-26 11:53:25,026 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-26 11:53:25,026 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 28 treesize of output 20 [2023-11-26 11:53:25,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-26 11:53:25,124 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-26 11:53:25,125 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 17 treesize of output 16 [2023-11-26 11:53:25,239 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-26 11:53:25,240 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 28 treesize of output 20 [2023-11-26 11:53:25,411 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-26 11:53:25,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 51 [2023-11-26 11:53:25,426 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-11-26 11:53:25,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-26 11:53:25,491 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 18 treesize of output 12 [2023-11-26 11:53:25,515 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 48 treesize of output 42 [2023-11-26 11:53:25,757 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-26 11:53:25,757 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 54 treesize of output 46 [2023-11-26 11:53:26,128 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-26 11:53:26,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 86 [2023-11-26 11:53:26,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 1 [2023-11-26 11:53:26,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:26,302 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 88 treesize of output 108 [2023-11-26 11:53:27,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:27,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 135 [2023-11-26 11:53:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 56 proven. 135 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-26 11:53:27,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:53:27,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:27,547 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 40 treesize of output 44 [2023-11-26 11:53:27,569 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 67 treesize of output 63 [2023-11-26 11:53:27,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:27,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 25 [2023-11-26 11:53:28,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:28,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 95 treesize of output 94 [2023-11-26 11:53:28,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:28,331 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 105 treesize of output 110 [2023-11-26 11:53:28,373 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 12 treesize of output 10 [2023-11-26 11:53:28,393 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 12 treesize of output 10 [2023-11-26 11:53:28,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_2 .cse3))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (= .cse0 0) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse1 v_arrayElimArr_1) .cse0 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse1 .cse0)))) (= .cse1 0)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse4 (select v_prenex_4 4)) (.cse5 (select v_arrayElimArr_2 .cse3))) (or (= .cse4 0) (= .cse5 .cse4) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse5 v_prenex_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse5 0))))))) is different from false [2023-11-26 11:53:28,645 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 .cse4))) (or (not (= 0 (select (select (store (store (store .cse0 v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse2 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= .cse1 .cse2) (= .cse2 0) (= .cse1 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_2 .cse4))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse5 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse5) (= .cse6 .cse5) (= .cse5 0) (not (= (select (select (store (store (store .cse0 v_subst_2 v_arrayElimArr_2) .cse6 v_arrayElimArr_1) .cse5 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0))))) (= .cse6 0)))))) is different from false [2023-11-26 11:53:28,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:28,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 107 treesize of output 106 [2023-11-26 11:53:28,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= (select v_arrayElimArr_3 .cse2) 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse0 0) (= .cse1 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 .cse2) 0) (forall ((v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse5 (select v_prenex_9 4)) (.cse4 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse4) (= .cse5 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse5 v_arrayElimArr_1) .cse4 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse4 0) (= .cse5 .cse4)))))))) is different from false [2023-11-26 11:53:29,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:29,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 123 treesize of output 122 [2023-11-26 11:53:32,134 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select v_prenex_9 4)) (.cse2 (select v_arrayElimArr_1 4))) (or (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse1 v_arrayElimArr_1) .cse2 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse2) (= .cse1 0) (= .cse2 0) (= .cse1 .cse2) (= (select v_arrayElimArr_3 4) 0)))))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_3 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse4 (select v_prenex_4 4)) (.cse5 (select v_arrayElimArr_2 4))) (or (= .cse4 .cse5) (= (select v_arrayElimArr_4 .cse0) 0) (= (select v_prenex_11 4) 0) (= .cse4 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse5 v_prenex_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-26 11:53:32,376 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select v_prenex_9 4)) (.cse0 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (= .cse1 0) (= .cse0 0) (= .cse1 .cse0) (not (= (select (select (store (store (store (store (store .cse2 v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse1 v_arrayElimArr_1) .cse0 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_4 .cse4) 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse5 (select v_prenex_4 4)) (.cse6 (select v_arrayElimArr_2 4))) (or (= .cse5 .cse6) (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store .cse2 v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse6 v_prenex_4) .cse5 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_4 .cse4) 0) (= .cse5 0) (= .cse6 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-26 11:53:32,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:32,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 139 treesize of output 138 [2023-11-26 11:53:33,553 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select v_prenex_9 4)) (.cse0 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (= .cse1 0) (= .cse0 0) (= .cse1 .cse0) (not (= (select (select (store (store (store (store (store (store .cse2 v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse1 v_arrayElimArr_1) .cse0 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_5 .cse4) 0))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_2 4)) (.cse5 (select v_prenex_4 4))) (or (= .cse5 .cse6) (= (select v_prenex_11 4) 0) (= (select v_prenex_13 4) 0) (= .cse5 0) (= (select v_arrayElimArr_5 .cse4) 0) (= .cse6 0) (not (= (select (select (store (store (store (store (store (store .cse2 v_subst_7 v_arrayElimArr_5) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse6 v_prenex_4) .cse5 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-26 11:53:33,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:33,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 155 treesize of output 154 [2023-11-26 11:53:37,897 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse2 (select v_prenex_9 4)) (.cse1 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse1) (= (select v_arrayElimArr_5 4) 0) (= .cse2 0) (not (= 0 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse2 v_arrayElimArr_1) .cse1 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= .cse1 0) (= .cse2 .cse1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse4 (select v_prenex_4 4)) (.cse5 (select v_arrayElimArr_2 4))) (or (= (select v_arrayElimArr_6 .cse0) 0) (= .cse4 .cse5) (= (select v_prenex_11 4) 0) (= (select v_prenex_13 4) 0) (= .cse4 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_7 v_prenex_15) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse5 v_prenex_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 0) (= (select v_prenex_15 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-26 11:53:39,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:39,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 171 treesize of output 170 [2023-11-26 11:53:50,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:50,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 187 treesize of output 186