./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu --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 a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:56:48,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:56:48,547 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:56:48,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:56:48,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:56:48,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:56:48,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:56:48,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:56:48,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:56:48,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:56:48,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:56:48,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:56:48,600 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:56:48,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:56:48,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:56:48,605 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:56:48,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:56:48,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:56:48,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:56:48,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:56:48,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:56:48,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:56:48,610 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:56:48,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:56:48,611 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:56:48,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:56:48,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:56:48,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:56:48,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:56:48,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:56:48,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:56:48,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:56:48,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:56:48,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:56:48,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:56:48,618 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:56:48,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:56:48,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:56:48,620 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:56:48,621 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_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/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_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu 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 -> a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 [2023-11-19 07:56:48,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:56:49,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:56:49,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:56:49,029 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:56:49,031 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:56:49,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-11-19 07:56:52,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:56:52,549 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:56:52,550 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-11-19 07:56:52,568 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/data/974e9d9c1/a17e010a961e4f809b51ac4a01d3e951/FLAGca7a56377 [2023-11-19 07:56:52,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/data/974e9d9c1/a17e010a961e4f809b51ac4a01d3e951 [2023-11-19 07:56:52,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:56:52,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:56:52,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:56:52,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:56:52,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:56:52,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:52" (1/1) ... [2023-11-19 07:56:52,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bce70b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:52, skipping insertion in model container [2023-11-19 07:56:52,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:52" (1/1) ... [2023-11-19 07:56:52,673 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:56:53,057 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_a24c3a07-ee28-4233-80ca-0a035b994bef/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-11-19 07:56:53,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:56:53,074 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:56:53,116 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_a24c3a07-ee28-4233-80ca-0a035b994bef/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-11-19 07:56:53,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:56:53,151 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:56:53,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53 WrapperNode [2023-11-19 07:56:53,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:56:53,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:56:53,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:56:53,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:56:53,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,235 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-11-19 07:56:53,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:56:53,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:56:53,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:56:53,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:56:53,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:56:53,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:56:53,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:56:53,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:56:53,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (1/1) ... [2023-11-19 07:56:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:56:53,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:53,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:53,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:56:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-19 07:56:53,391 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-19 07:56:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:56:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:56:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:56:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:56:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:56:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:56:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:56:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:56:53,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:56:53,526 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:56:53,531 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:56:53,589 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-19 07:56:53,731 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:56:53,739 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:56:53,740 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:56:53,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:53 BoogieIcfgContainer [2023-11-19 07:56:53,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:56:53,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:56:53,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:56:53,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:56:53,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:56:52" (1/3) ... [2023-11-19 07:56:53,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41edf5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:56:53, skipping insertion in model container [2023-11-19 07:56:53,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:53" (2/3) ... [2023-11-19 07:56:53,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41edf5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:56:53, skipping insertion in model container [2023-11-19 07:56:53,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:53" (3/3) ... [2023-11-19 07:56:53,756 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2023-11-19 07:56:53,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:56:53,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:56:53,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:56:53,855 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;@271bf809, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:56:53,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:56:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 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-19 07:56:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 07:56:53,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:53,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:53,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:53,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2087165485, now seen corresponding path program 1 times [2023-11-19 07:56:53,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:53,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314881246] [2023-11-19 07:56:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,189 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-19 07:56:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:54,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314881246] [2023-11-19 07:56:54,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314881246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:54,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:54,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:56:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936106892] [2023-11-19 07:56:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:54,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:56:54,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:54,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:56:54,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:56:54,258 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 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.5) internal successors, (9), 2 states have internal predecessors, (9), 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-19 07:56:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:54,281 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2023-11-19 07:56:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:56:54,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2023-11-19 07:56:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:54,293 INFO L225 Difference]: With dead ends: 39 [2023-11-19 07:56:54,294 INFO L226 Difference]: Without dead ends: 18 [2023-11-19 07:56:54,297 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-19 07:56:54,303 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:54,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-19 07:56:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-19 07:56:54,342 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-19 07:56:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-19 07:56:54,345 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2023-11-19 07:56:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:54,347 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-19 07:56:54,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-19 07:56:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-19 07:56:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 07:56:54,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:54,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:54,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:56:54,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:54,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:54,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2034265922, now seen corresponding path program 1 times [2023-11-19 07:56:54,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:54,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392057114] [2023-11-19 07:56:54,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,482 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-19 07:56:54,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:54,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392057114] [2023-11-19 07:56:54,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392057114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:54,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:54,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:56:54,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673903534] [2023-11-19 07:56:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:54,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:56:54,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:54,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:56:54,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:56:54,487 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-19 07:56:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:54,504 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2023-11-19 07:56:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:56:54,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2023-11-19 07:56:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:54,506 INFO L225 Difference]: With dead ends: 28 [2023-11-19 07:56:54,506 INFO L226 Difference]: Without dead ends: 19 [2023-11-19 07:56:54,507 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-19 07:56:54,508 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:54,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-19 07:56:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-19 07:56:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-19 07:56:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-11-19 07:56:54,521 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2023-11-19 07:56:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:54,522 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-19 07:56:54,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-19 07:56:54,522 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-11-19 07:56:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 07:56:54,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:54,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:54,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:56:54,530 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:54,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:54,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1977007620, now seen corresponding path program 1 times [2023-11-19 07:56:54,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:54,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490754241] [2023-11-19 07:56:54,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:54,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,694 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-19 07:56:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490754241] [2023-11-19 07:56:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490754241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:56:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931543912] [2023-11-19 07:56:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:54,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:56:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:56:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:56:54,698 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-19 07:56:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:54,747 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-11-19 07:56:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:56:54,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2023-11-19 07:56:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:54,749 INFO L225 Difference]: With dead ends: 39 [2023-11-19 07:56:54,749 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 07:56:54,750 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-19 07:56:54,752 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:54,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 07:56:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-11-19 07:56:54,757 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-19 07:56:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-19 07:56:54,758 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2023-11-19 07:56:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:54,759 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-19 07:56:54,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-19 07:56:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-19 07:56:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 07:56:54,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:54,761 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:54,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:56:54,761 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:54,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1102443704, now seen corresponding path program 1 times [2023-11-19 07:56:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:54,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245287337] [2023-11-19 07:56:54,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,898 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-19 07:56:54,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:54,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245287337] [2023-11-19 07:56:54,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245287337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:54,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:54,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:56:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891709144] [2023-11-19 07:56:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:54,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:56:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:56:54,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:56:54,903 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:54,951 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-11-19 07:56:54,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:56:54,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-19 07:56:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:54,954 INFO L225 Difference]: With dead ends: 32 [2023-11-19 07:56:54,954 INFO L226 Difference]: Without dead ends: 29 [2023-11-19 07:56:54,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 07:56:54,956 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 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.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:54,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-19 07:56:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2023-11-19 07:56:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-11-19 07:56:54,965 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2023-11-19 07:56:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:54,966 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-19 07:56:54,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-11-19 07:56:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 07:56:54,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:54,968 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:54,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:56:54,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:54,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash 379985990, now seen corresponding path program 1 times [2023-11-19 07:56:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28606673] [2023-11-19 07:56:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:55,207 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-19 07:56:55,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:55,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28606673] [2023-11-19 07:56:55,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28606673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:55,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934987704] [2023-11-19 07:56:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:55,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:55,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:55,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:55,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:56:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:55,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:56:55,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:55,500 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-19 07:56:55,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:55,582 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-19 07:56:55,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934987704] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:55,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-19 07:56:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514994978] [2023-11-19 07:56:55,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:55,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:56:55,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:55,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:56:55,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:56:55,587 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-19 07:56:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:55,706 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2023-11-19 07:56:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:56:55,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-19 07:56:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:55,709 INFO L225 Difference]: With dead ends: 56 [2023-11-19 07:56:55,710 INFO L226 Difference]: Without dead ends: 40 [2023-11-19 07:56:55,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 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-19 07:56:55,715 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:55,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:56:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-19 07:56:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2023-11-19 07:56:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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-19 07:56:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-11-19 07:56:55,731 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2023-11-19 07:56:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:55,733 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-19 07:56:55,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-19 07:56:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-11-19 07:56:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 07:56:55,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:55,738 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:55,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:55,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:55,959 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:55,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1481516270, now seen corresponding path program 2 times [2023-11-19 07:56:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160914163] [2023-11-19 07:56:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,402 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-19 07:56:56,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160914163] [2023-11-19 07:56:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160914163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330282920] [2023-11-19 07:56:56,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:56:56,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:56,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:56,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:56,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:56:56,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:56:56,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:56:56,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-19 07:56:56,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:56,683 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-19 07:56:56,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:56,856 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-19 07:56:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330282920] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:56,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:56,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-11-19 07:56:56,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581167142] [2023-11-19 07:56:56,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:56,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:56:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:56,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:56:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:56:56,871 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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-19 07:56:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:57,118 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2023-11-19 07:56:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-19 07:56:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-19 07:56:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:57,120 INFO L225 Difference]: With dead ends: 86 [2023-11-19 07:56:57,121 INFO L226 Difference]: Without dead ends: 70 [2023-11-19 07:56:57,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2023-11-19 07:56:57,123 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:57,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 86 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:56:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-19 07:56:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-11-19 07:56:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-11-19 07:56:57,135 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 36 [2023-11-19 07:56:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:57,136 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-11-19 07:56:57,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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-19 07:56:57,137 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-11-19 07:56:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-19 07:56:57,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:57,140 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:57,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:57,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:57,355 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:57,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1904311442, now seen corresponding path program 3 times [2023-11-19 07:56:57,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:57,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486146483] [2023-11-19 07:56:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:57,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:03,539 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-19 07:57:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:03,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486146483] [2023-11-19 07:57:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486146483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:57:03,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384594402] [2023-11-19 07:57:03,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:57:03,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:57:03,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:03,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:57:03,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a24c3a07-ee28-4233-80ca-0a035b994bef/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:57:16,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-19 07:57:16,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:57:16,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 184 conjunts are in the unsatisfiable core [2023-11-19 07:57:16,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:57:16,497 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-19 07:57:16,580 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:57:16,581 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-19 07:57:16,670 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-19 07:57:16,752 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-19 07:57:16,752 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-19 07:57:16,842 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 07:57:16,842 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-19 07:57:16,928 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:16,928 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-19 07:57:16,952 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-19 07:57:17,073 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:57:17,073 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-19 07:57:17,160 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:17,161 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-19 07:57:17,288 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:57:17,289 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-19 07:57:17,428 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-19 07:57:17,428 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 25 treesize of output 39 [2023-11-19 07:57:17,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:57:17,578 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:17,578 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 21 treesize of output 20 [2023-11-19 07:57:17,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 07:57:17,765 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-19 07:57:17,765 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 33 treesize of output 47 [2023-11-19 07:57:17,790 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:17,790 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 29 treesize of output 28 [2023-11-19 07:57:18,050 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:57:18,051 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 35 treesize of output 27 [2023-11-19 07:57:18,067 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:18,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-11-19 07:57:18,239 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:57:18,240 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 41 treesize of output 33 [2023-11-19 07:57:18,281 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-19 07:57:18,281 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 30 treesize of output 44 [2023-11-19 07:57:18,500 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:18,501 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 28 treesize of output 27 [2023-11-19 07:57:18,512 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:57:18,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 31 [2023-11-19 07:57:18,760 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2023-11-19 07:57:18,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 83 [2023-11-19 07:57:18,783 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:18,783 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 40 treesize of output 39 [2023-11-19 07:57:19,474 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:57:19,476 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 42 treesize of output 34 [2023-11-19 07:57:19,492 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:19,493 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 31 treesize of output 28 [2023-11-19 07:57:19,766 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2023-11-19 07:57:19,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2023-11-19 07:57:19,791 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:19,795 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 44 treesize of output 41 [2023-11-19 07:57:20,244 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:20,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 32 [2023-11-19 07:57:20,265 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:57:20,265 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 38 treesize of output 30 [2023-11-19 07:57:20,436 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:20,440 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 50 treesize of output 47 [2023-11-19 07:57:20,505 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2023-11-19 07:57:20,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 83 [2023-11-19 07:57:20,970 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:57:20,971 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 42 treesize of output 34 [2023-11-19 07:57:20,987 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:57:20,988 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 31 treesize of output 28 [2023-11-19 07:57:21,344 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:57:21,345 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 64 treesize of output 45 [2023-11-19 07:57:21,412 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2023-11-19 07:57:21,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 79 [2023-11-19 07:57:22,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:22,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 82 [2023-11-19 07:57:22,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-19 07:57:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 241 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 07:57:22,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:57:23,401 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_625 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (forall ((v_ArrVal_627 (Array Int Int))) (or (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= v_ArrVal_627 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~counter~0#1|) .cse0 (select v_ArrVal_627 .cse0))))))))) is different from false [2023-11-19 07:57:23,624 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_625 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_627 (Array Int Int))) (let ((.cse0 (select v_ArrVal_627 |c_ULTIMATE.start_main_~p~0#1.offset|))) (or (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= v_ArrVal_627 (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| .cse0) .cse1 (select v_ArrVal_627 .cse1))))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (< .cse0 10)))) is different from false [2023-11-19 07:57:23,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:23,854 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-19 07:57:23,878 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_627 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_623)) (.cse0 (select v_ArrVal_627 0))) (or (< .cse0 10) (not (= 2 (select (select (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= v_ArrVal_627 (store (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse0) 4 (select v_ArrVal_627 4))))))) is different from false [2023-11-19 07:57:23,978 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_614) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_623)) (.cse0 (select v_ArrVal_627 0))) (or (< .cse0 10) (not (= 2 (select (select (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.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|)) |v_ULTIMATE.start_main_~p~0#1.base_40| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= v_ArrVal_627 (store (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse0) 4 (select v_ArrVal_627 4))))))) is different from false [2023-11-19 07:57:24,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:24,030 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 24 treesize of output 28 [2023-11-19 07:57:24,059 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (select v_ArrVal_627 0)) (.cse0 (store (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_614) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_623))) (or (not (= v_ArrVal_627 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse1) 4 (select v_ArrVal_627 4)))) (< .cse1 10) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) |v_ULTIMATE.start_main_~p~0#1.base_40| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) is different from false [2023-11-19 07:57:24,171 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_41| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (select v_ArrVal_627 0)) (.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_606) |v_ULTIMATE.start_main_~p~0#1.base_41| v_ArrVal_614) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_623))) (or (not (= v_ArrVal_627 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse1) 4 (select v_ArrVal_627 4)))) (< .cse1 10) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.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|)) |v_ULTIMATE.start_main_~p~0#1.base_41| v_arrayElimArr_2) |v_ULTIMATE.start_main_~p~0#1.base_40| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_1 4) 0) (= (select v_arrayElimArr_2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))) is different from false [2023-11-19 07:57:24,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:24,233 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 27 treesize of output 31 [2023-11-19 07:57:24,271 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_623 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_41| Int) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (select v_ArrVal_627 0)) (.cse0 (store (store (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_606) |v_ULTIMATE.start_main_~p~0#1.base_41| v_ArrVal_614) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_623))) (or (not (= v_ArrVal_627 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse1) 4 (select v_ArrVal_627 4)))) (= (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (< .cse1 10) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) |v_ULTIMATE.start_main_~p~0#1.base_41| v_arrayElimArr_2) |v_ULTIMATE.start_main_~p~0#1.base_40| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= 2 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select v_arrayElimArr_2 4) 0)))) is different from false [2023-11-19 07:57:24,413 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_623 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_42| Int) (v_ArrVal_627 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_41| Int) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (select v_ArrVal_627 0)) (.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_602) |v_ULTIMATE.start_main_~p~0#1.base_42| v_ArrVal_606) |v_ULTIMATE.start_main_~p~0#1.base_41| v_ArrVal_614) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_623))) (or (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_600) |v_ULTIMATE.start_main_~p~0#1.base_42| v_arrayElimArr_3) |v_ULTIMATE.start_main_~p~0#1.base_41| v_arrayElimArr_2) |v_ULTIMATE.start_main_~p~0#1.base_40| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= v_ArrVal_627 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse1) 4 (select v_ArrVal_627 4)))) (not (= v_ArrVal_602 (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 (select v_ArrVal_602 .cse2))))) (< .cse1 10) (= (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= (select v_arrayElimArr_1 4) 0) (= (select v_arrayElimArr_2 4) 0) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))) is different from false [2023-11-19 07:57:24,537 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_623 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_42| Int) (v_ArrVal_627 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_41| Int) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_602) |v_ULTIMATE.start_main_~p~0#1.base_42| v_ArrVal_606) |v_ULTIMATE.start_main_~p~0#1.base_41| v_ArrVal_614) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_623)) (.cse2 (select v_ArrVal_627 0))) (or (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= v_ArrVal_602 (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~counter~0#1|) .cse1 (select v_ArrVal_602 .cse1))))) (not (= v_ArrVal_627 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse2) 4 (select v_ArrVal_627 4)))) (< .cse2 10) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_600) |v_ULTIMATE.start_main_~p~0#1.base_42| v_arrayElimArr_3) |v_ULTIMATE.start_main_~p~0#1.base_41| v_arrayElimArr_2) |v_ULTIMATE.start_main_~p~0#1.base_40| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0)))) is different from false [2023-11-19 07:57:24,763 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_623 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_42| Int) (v_ArrVal_627 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_41| Int) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_594))) (let ((.cse0 (select v_ArrVal_602 |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse4 (store (store (store (store .cse2 |v_ULTIMATE.start_main_~p~0#1.base_43| v_ArrVal_602) |v_ULTIMATE.start_main_~p~0#1.base_42| v_ArrVal_606) |v_ULTIMATE.start_main_~p~0#1.base_41| v_ArrVal_614) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_623)) (.cse1 (select v_ArrVal_627 0))) (or (< .cse0 (+ |c_ULTIMATE.start_main_~counter~0#1| 1)) (< .cse1 10) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.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|)) |v_ULTIMATE.start_main_~p~0#1.base_43| v_ArrVal_600) |v_ULTIMATE.start_main_~p~0#1.base_42| v_arrayElimArr_3) |v_ULTIMATE.start_main_~p~0#1.base_41| v_arrayElimArr_2) |v_ULTIMATE.start_main_~p~0#1.base_40| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (store (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_43|) |c_ULTIMATE.start_main_~t~0#1.offset| .cse0) .cse3 (select v_ArrVal_602 .cse3))) v_ArrVal_602)) (not (= (select (select (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= v_ArrVal_627 (store (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse1) 4 (select v_ArrVal_627 4)))) (= (select v_arrayElimArr_1 4) 0) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0))))) is different from false [2023-11-19 07:57:24,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:24,879 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 33 treesize of output 37 [2023-11-19 07:57:24,951 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_623 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_42| Int) (v_ArrVal_627 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_41| Int) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_594))) (let ((.cse1 (select v_ArrVal_627 0)) (.cse2 (store (store (store (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_43| v_ArrVal_602) |v_ULTIMATE.start_main_~p~0#1.base_42| v_ArrVal_606) |v_ULTIMATE.start_main_~p~0#1.base_41| v_ArrVal_614) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_623)) (.cse0 (select v_ArrVal_602 0))) (or (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (< .cse0 (+ |c_ULTIMATE.start_main_~counter~0#1| 1)) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_ArrVal_600) |v_ULTIMATE.start_main_~p~0#1.base_42| v_arrayElimArr_3) |v_ULTIMATE.start_main_~p~0#1.base_41| v_arrayElimArr_2) |v_ULTIMATE.start_main_~p~0#1.base_40| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (< .cse1 10) (not (= v_ArrVal_627 (store (store (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse1) 4 (select v_ArrVal_627 4)))) (= (select v_arrayElimArr_1 4) 0) (not (= 2 (select (select (store .cse2 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0) (not (= v_ArrVal_602 (store (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_43|) 0 .cse0) 4 (select v_ArrVal_602 4)))))))) is different from false [2023-11-19 07:57:25,245 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int)) (v_ArrVal_623 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_42| Int) (v_ArrVal_627 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_41| Int) (|v_ULTIMATE.start_main_~p~0#1.base_44| Int) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_588) |v_ULTIMATE.start_main_~p~0#1.base_44| v_ArrVal_594))) (let ((.cse3 (select v_ArrVal_602 0)) (.cse0 (store (store (store (store .cse2 |v_ULTIMATE.start_main_~p~0#1.base_43| v_ArrVal_602) |v_ULTIMATE.start_main_~p~0#1.base_42| v_ArrVal_606) |v_ULTIMATE.start_main_~p~0#1.base_41| v_ArrVal_614) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_623)) (.cse1 (select v_ArrVal_627 0))) (or (not (= 2 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< .cse1 10) (not (= v_ArrVal_602 (store (store (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_43|) 0 .cse3) 4 (select v_ArrVal_602 4)))) (not (= v_ArrVal_588 (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 (select v_ArrVal_588 .cse4))))) (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= (select v_arrayElimArr_1 4) 0) (< .cse3 (+ 2 |c_ULTIMATE.start_main_~counter~0#1|)) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_587) |v_ULTIMATE.start_main_~p~0#1.base_44| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_ArrVal_600) |v_ULTIMATE.start_main_~p~0#1.base_42| v_arrayElimArr_3) |v_ULTIMATE.start_main_~p~0#1.base_41| v_arrayElimArr_2) |v_ULTIMATE.start_main_~p~0#1.base_40| v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_625) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 .cse1) 4 (select v_ArrVal_627 4)) v_ArrVal_627)))))) is different from false [2023-11-19 07:57:25,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:25,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 12632281 treesize of output 12615907 [2023-11-19 07:57:27,130 INFO L349 Elim1Store]: treesize reduction 28, result has 53.3 percent of original size [2023-11-19 07:57:27,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 3565 treesize of output 3500 [2023-11-19 07:57:27,436 INFO L349 Elim1Store]: treesize reduction 71, result has 40.3 percent of original size [2023-11-19 07:57:27,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 3555 treesize of output 3572 [2023-11-19 07:57:27,701 INFO L349 Elim1Store]: treesize reduction 28, result has 53.3 percent of original size [2023-11-19 07:57:27,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 3445 treesize of output 3284 [2023-11-19 07:57:28,455 INFO L349 Elim1Store]: treesize reduction 28, result has 53.3 percent of original size [2023-11-19 07:57:28,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 3269 treesize of output 2916