./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fdb5189ea0a06d32886b44c2108d225ef2901fa5113fdc3856a252d0f653190 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:07:39,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:07:40,119 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-11-08 12:07:40,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:07:40,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:07:40,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:07:40,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:07:40,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:07:40,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:07:40,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:07:40,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:07:40,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:07:40,179 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:07:40,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:07:40,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:07:40,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:07:40,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:07:40,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:07:40,186 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 12:07:40,186 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 12:07:40,187 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 12:07:40,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:07:40,188 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:07:40,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:07:40,190 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 12:07:40,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:07:40,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:07:40,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:07:40,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:07:40,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:07:40,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:07:40,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:07:40,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:07:40,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:07:40,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:07:40,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:07:40,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:07:40,198 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-08 12:07:40,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-08 12:07:40,199 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-08 12:07:40,199 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-08 12:07:40,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/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_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter 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 -> 6fdb5189ea0a06d32886b44c2108d225ef2901fa5113fdc3856a252d0f653190 [2024-11-08 12:07:40,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:07:40,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:07:40,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:07:40,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:07:40,578 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:07:40,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/../../sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c Unable to find full path for "g++" [2024-11-08 12:07:42,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:07:43,199 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:07:43,200 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c [2024-11-08 12:07:43,212 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/data/098ce4651/7049fb8a33124b578fbc69b785675c25/FLAG6f80caa61 [2024-11-08 12:07:43,247 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/data/098ce4651/7049fb8a33124b578fbc69b785675c25 [2024-11-08 12:07:43,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:07:43,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:07:43,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:07:43,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:07:43,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:07:43,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d7109fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43, skipping insertion in model container [2024-11-08 12:07:43,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:07:43,597 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 12:07:43,621 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 12:07:43,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:07:43,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:07:43,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:07:43,763 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:07:43,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43 WrapperNode [2024-11-08 12:07:43,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:07:43,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:07:43,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:07:43,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:07:43,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,862 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 19, calls inlined = 27, statements flattened = 355 [2024-11-08 12:07:43,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:07:43,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:07:43,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:07:43,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:07:43,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:43,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:07:43,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:07:43,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:07:43,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:07:43,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (1/1) ... [2024-11-08 12:07:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:07:44,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:07:44,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-08 12:07:44,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-08 12:07:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:07:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-08 12:07:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 12:07:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 12:07:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-08 12:07:44,105 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 12:07:44,105 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 12:07:44,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 12:07:44,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 12:07:44,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 12:07:44,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 12:07:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 12:07:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 12:07:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 12:07:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 12:07:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:07:44,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:07:44,111 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 12:07:44,288 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:07:44,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:07:45,166 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 12:07:45,167 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:07:45,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:07:45,981 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 12:07:45,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:07:45 BoogieIcfgContainer [2024-11-08 12:07:45,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:07:45,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:07:45,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:07:45,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:07:45,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:07:43" (1/3) ... [2024-11-08 12:07:45,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cda4f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:07:45, skipping insertion in model container [2024-11-08 12:07:45,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:07:43" (2/3) ... [2024-11-08 12:07:45,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cda4f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:07:45, skipping insertion in model container [2024-11-08 12:07:45,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:07:45" (3/3) ... [2024-11-08 12:07:45,999 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2024-11-08 12:07:46,026 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:07:46,027 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-11-08 12:07:46,027 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 12:07:46,267 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 12:07:46,340 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:07:46,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-08 12:07:46,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:07:46,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-08 12:07:46,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-08 12:07:46,385 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:07:46,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread2Thread1of1ForFork1 ======== [2024-11-08 12:07:46,409 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@2dfea114, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:07:46,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-08 12:07:47,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:07:47,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:07:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash -896539903, now seen corresponding path program 1 times [2024-11-08 12:07:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:07:47,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598632255] [2024-11-08 12:07:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:07:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:07:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:07:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598632255] [2024-11-08 12:07:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598632255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:07:47,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:07:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:07:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163022030] [2024-11-08 12:07:47,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:07:47,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:07:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:07:47,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:07:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:07:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:47,879 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:07:47,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:07:47,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:48,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:07:48,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:07:48,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:07:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash -615037395, now seen corresponding path program 1 times [2024-11-08 12:07:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:07:48,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470700129] [2024-11-08 12:07:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:07:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:07:48,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:07:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470700129] [2024-11-08 12:07:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470700129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:07:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045834250] [2024-11-08 12:07:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:48,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:07:48,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:07:48,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:07:48,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:07:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:48,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 12:07:48,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:07:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:07:48,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:07:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:07:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045834250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:07:48,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:07:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-08 12:07:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774473333] [2024-11-08 12:07:48,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:07:49,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:07:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:07:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:07:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:07:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:49,005 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:07:49,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:07:49,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:49,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:49,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:49,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 12:07:49,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:07:49,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:07:49,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:07:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash 685607169, now seen corresponding path program 2 times [2024-11-08 12:07:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:07:49,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778550849] [2024-11-08 12:07:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:49,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:07:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:07:50,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:07:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778550849] [2024-11-08 12:07:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778550849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:07:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:07:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:07:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121935840] [2024-11-08 12:07:50,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:07:50,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:07:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:07:50,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:07:50,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:07:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:50,137 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:07:50,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:07:50,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:50,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:50,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:50,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:07:50,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:07:50,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:07:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash 685607170, now seen corresponding path program 1 times [2024-11-08 12:07:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:07:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809006939] [2024-11-08 12:07:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:07:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 12:07:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:07:51,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809006939] [2024-11-08 12:07:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809006939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:07:51,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91248035] [2024-11-08 12:07:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:51,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:07:51,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:07:51,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:07:51,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 12:07:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:51,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 12:07:51,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:07:51,464 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 8 treesize of output 1 [2024-11-08 12:07:51,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 12:07:51,717 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 12:07:51,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2024-11-08 12:07:51,777 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 12:07:51,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-08 12:07:52,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:07:52,304 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 12:07:52,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2024-11-08 12:07:52,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:07:52,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 12:07:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:07:52,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:07:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 12:07:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91248035] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 12:07:53,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:07:53,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 18 [2024-11-08 12:07:53,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419427675] [2024-11-08 12:07:53,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:07:53,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 12:07:53,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:07:53,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 12:07:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-08 12:07:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:53,897 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:07:53,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2024-11-08 12:07:53,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:53,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:53,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:53,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:07:55,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 12:07:55,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:07:55,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:07:55,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:07:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash -230675113, now seen corresponding path program 1 times [2024-11-08 12:07:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:07:55,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382283241] [2024-11-08 12:07:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:07:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:07:55,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:07:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382283241] [2024-11-08 12:07:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382283241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:07:55,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:07:55,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 12:07:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954874611] [2024-11-08 12:07:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:07:55,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 12:07:55,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:07:55,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 12:07:55,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 12:07:55,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:55,902 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:07:55,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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) [2024-11-08 12:07:55,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:55,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:55,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:55,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:07:55,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:07:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:07:56,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 12:07:56,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:07:56,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:07:56,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1659591579, now seen corresponding path program 1 times [2024-11-08 12:07:56,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:07:56,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867048685] [2024-11-08 12:07:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:56,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:07:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:07:56,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:07:56,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867048685] [2024-11-08 12:07:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867048685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:07:56,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:07:56,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:07:56,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654757247] [2024-11-08 12:07:56,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:07:56,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:07:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:07:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:07:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:07:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:56,555 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:07:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:07:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:07:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:07:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:07:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:07:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:07:56,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 12:07:56,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:07:56,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:07:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash 747444909, now seen corresponding path program 1 times [2024-11-08 12:07:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:07:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318383065] [2024-11-08 12:07:56,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:07:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:07:57,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:07:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318383065] [2024-11-08 12:07:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318383065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:07:57,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:07:57,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:07:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122997136] [2024-11-08 12:07:57,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:07:57,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:07:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:07:57,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:07:57,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:07:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:57,132 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:07:57,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:07:57,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:57,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:57,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:57,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:07:57,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:07:57,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:07:57,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:07:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:07:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:07:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:57,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 12:07:57,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:07:57,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:07:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash 747444910, now seen corresponding path program 1 times [2024-11-08 12:07:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:07:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314099537] [2024-11-08 12:07:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:07:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 12:07:58,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:07:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314099537] [2024-11-08 12:07:58,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314099537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:07:58,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945481695] [2024-11-08 12:07:58,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:07:58,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:07:58,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:07:58,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:07:58,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 12:07:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:07:58,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 12:07:58,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:07:58,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 12:07:58,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:07:58,503 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 12:07:58,524 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 12:07:58,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-08 12:07:58,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:07:58,574 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 12:07:58,586 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:07:58,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 12:07:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 12:07:58,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:07:59,196 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 162 treesize of output 156 [2024-11-08 12:07:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 12:07:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945481695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:07:59,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:07:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-11-08 12:07:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930785320] [2024-11-08 12:07:59,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:07:59,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 12:07:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:07:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 12:07:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-11-08 12:07:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:59,812 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:07:59,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.45) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:07:59,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:59,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:07:59,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:59,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:07:59,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:07:59,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:07:59,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:07:59,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:08:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:02,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:02,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 12:08:02,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 12:08:02,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:08:02,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:08:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2026084186, now seen corresponding path program 1 times [2024-11-08 12:08:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:08:02,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096032465] [2024-11-08 12:08:02,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:08:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:08:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:08:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096032465] [2024-11-08 12:08:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096032465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:08:02,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:08:02,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:08:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728970642] [2024-11-08 12:08:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:08:02,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:08:02,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:08:02,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:08:02,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:08:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:02,910 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:08:02,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:08:02,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:02,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:02,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:02,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:02,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:08:02,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:02,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:02,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:02,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:08:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:03,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 12:08:03,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:08:03,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:08:03,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2026084187, now seen corresponding path program 1 times [2024-11-08 12:08:03,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:08:03,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320918639] [2024-11-08 12:08:03,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:08:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:08:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:08:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320918639] [2024-11-08 12:08:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320918639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:08:03,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:08:03,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 12:08:03,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126047909] [2024-11-08 12:08:03,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:08:03,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 12:08:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:08:03,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 12:08:03,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 12:08:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:03,500 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:08:03,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:08:03,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:03,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:03,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:03,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:03,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:08:03,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:03,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:03,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:03,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:03,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:04,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:04,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 12:08:04,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:08:04,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:08:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash 820251990, now seen corresponding path program 1 times [2024-11-08 12:08:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:08:04,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330241448] [2024-11-08 12:08:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:04,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:08:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 12:08:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:08:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330241448] [2024-11-08 12:08:04,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330241448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:08:04,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:08:04,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 12:08:04,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532937483] [2024-11-08 12:08:04,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:08:04,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:08:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:08:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:08:04,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:08:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:04,808 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:08:04,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:08:04,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:04,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:04,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:04,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:04,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:04,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:04,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:04,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:04,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:04,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:04,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:05,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:05,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 12:08:05,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:08:05,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:08:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash 820251993, now seen corresponding path program 1 times [2024-11-08 12:08:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:08:05,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492442508] [2024-11-08 12:08:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:05,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:08:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:08:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:08:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492442508] [2024-11-08 12:08:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492442508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:08:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371041388] [2024-11-08 12:08:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:06,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:08:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:08:06,325 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:08:06,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 12:08:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:06,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 12:08:06,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:08:06,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 12:08:06,737 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 23 treesize of output 1 [2024-11-08 12:08:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 12:08:07,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:08:07,681 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 25 treesize of output 9 [2024-11-08 12:08:07,927 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 20 treesize of output 18 [2024-11-08 12:08:07,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2024-11-08 12:08:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 12:08:08,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371041388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:08:08,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:08:08,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-08 12:08:08,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506859918] [2024-11-08 12:08:08,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:08:08,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 12:08:08,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:08:08,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 12:08:08,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2024-11-08 12:08:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:08,169 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:08:08,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.76) internal successors, (94), 26 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:08:08,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:08,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:08,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:08,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:08:10,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 12:08:10,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 12:08:10,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:08:10,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:08:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash 820251994, now seen corresponding path program 1 times [2024-11-08 12:08:10,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:08:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102999427] [2024-11-08 12:08:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:08:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:08:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:08:13,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102999427] [2024-11-08 12:08:13,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102999427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:08:13,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484089717] [2024-11-08 12:08:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:13,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:08:13,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:08:13,047 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:08:13,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 12:08:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:13,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 12:08:13,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:08:13,538 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 23 treesize of output 1 [2024-11-08 12:08:13,545 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 23 treesize of output 1 [2024-11-08 12:08:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:08:15,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:08:16,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:08:16,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 103 [2024-11-08 12:08:17,027 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 86 treesize of output 82 [2024-11-08 12:08:17,032 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 82 treesize of output 80 [2024-11-08 12:08:17,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:08:17,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 110 [2024-11-08 12:08:17,059 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 117 treesize of output 105 [2024-11-08 12:08:17,559 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 46 treesize of output 42 [2024-11-08 12:08:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:08:17,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484089717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:08:17,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:08:17,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 49 [2024-11-08 12:08:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347362252] [2024-11-08 12:08:17,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:08:17,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-08 12:08:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:08:17,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-08 12:08:17,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2222, Unknown=0, NotChecked=0, Total=2450 [2024-11-08 12:08:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:17,724 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:08:17,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:17,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:17,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:17,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:17,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:17,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:08:17,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:08:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:08:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-11-08 12:08:34,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 12:08:35,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 12:08:35,019 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:08:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:08:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash -577296165, now seen corresponding path program 1 times [2024-11-08 12:08:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:08:35,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401601723] [2024-11-08 12:08:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:08:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 12:08:35,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:08:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401601723] [2024-11-08 12:08:35,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401601723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:08:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903863773] [2024-11-08 12:08:35,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:35,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:08:35,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:08:35,416 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:08:35,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 12:08:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:35,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 12:08:35,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:08:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 12:08:35,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:08:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 12:08:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903863773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:08:36,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:08:36,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-08 12:08:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952385851] [2024-11-08 12:08:36,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:08:36,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 12:08:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:08:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 12:08:36,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-08 12:08:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:36,206 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:08:36,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:08:36,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:36,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:36,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:36,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:36,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:36,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:36,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:36,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:08:36,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:36,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:36,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:36,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:08:36,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-11-08 12:08:36,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:08:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:08:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-08 12:08:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:08:40,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 12:08:40,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 12:08:40,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:08:40,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:08:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2076817730, now seen corresponding path program 2 times [2024-11-08 12:08:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:08:40,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792397774] [2024-11-08 12:08:40,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:08:40,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:08:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:08:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 12:08:42,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:08:42,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792397774] [2024-11-08 12:08:42,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792397774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:08:42,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928643601] [2024-11-08 12:08:42,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:08:42,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:08:42,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:08:42,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:08:42,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 12:08:42,604 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:08:42,604 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:08:42,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-08 12:08:42,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:08:42,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 12:08:42,680 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 12:08:42,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 12:08:42,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:08:42,904 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-08 12:08:42,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-08 12:08:43,011 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 34 treesize of output 25 [2024-11-08 12:08:43,151 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-08 12:08:43,152 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 57 treesize of output 33 [2024-11-08 12:08:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 12:08:45,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:08:45,444 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 46 treesize of output 22 [2024-11-08 12:08:46,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:08:46,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-08 12:08:46,209 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 66 treesize of output 62 [2024-11-08 12:08:46,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:08:46,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-11-08 12:08:46,236 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 27 treesize of output 21 [2024-11-08 12:08:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 12:08:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928643601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:08:47,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:08:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 44 [2024-11-08 12:08:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313762912] [2024-11-08 12:08:47,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:08:47,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-08 12:08:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:08:47,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-08 12:08:47,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1798, Unknown=6, NotChecked=0, Total=1980 [2024-11-08 12:08:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:47,298 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:08:47,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 45 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:08:47,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:47,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:47,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:47,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:08:47,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:08:47,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:47,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:08:47,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:08:47,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:08:47,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:08:47,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:08:47,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:08:47,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-11-08 12:08:47,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:08:47,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:08:53,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:55,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:09:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:09:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:09:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-08 12:09:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:09:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-08 12:09:03,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 12:09:03,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 12:09:03,827 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:09:03,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:09:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2076817729, now seen corresponding path program 2 times [2024-11-08 12:09:03,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:09:03,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347309675] [2024-11-08 12:09:03,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:09:03,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:09:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:09:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 12:09:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:09:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347309675] [2024-11-08 12:09:08,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347309675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:09:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080815387] [2024-11-08 12:09:08,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:09:08,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:09:08,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:09:08,802 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:09:08,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 12:09:09,091 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:09:09,091 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:09:09,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-08 12:09:09,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:09:09,144 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 8 treesize of output 1 [2024-11-08 12:09:09,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 12:09:09,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:09:09,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 12:09:09,673 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 12:09:09,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2024-11-08 12:09:09,723 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-08 12:09:09,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2024-11-08 12:09:09,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 12:09:09,906 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 30 treesize of output 23 [2024-11-08 12:09:10,218 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 12:09:10,218 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 23 treesize of output 22 [2024-11-08 12:09:10,240 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-08 12:09:10,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 33 [2024-11-08 12:09:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:09:15,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:09:16,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:09:16,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 103 [2024-11-08 12:09:21,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:09:21,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 158 [2024-11-08 12:09:21,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:09:21,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 134 [2024-11-08 12:09:21,223 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 185 treesize of output 181 [2024-11-08 12:09:21,235 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 293 treesize of output 285 [2024-11-08 12:09:21,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:09:21,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 204 [2024-11-08 12:09:21,284 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 214 treesize of output 208 [2024-11-08 12:09:21,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:09:21,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 242 treesize of output 242 [2024-11-08 12:09:21,355 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 194 treesize of output 182 [2024-11-08 12:09:21,372 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 147 treesize of output 141 [2024-11-08 12:09:26,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:09:26,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 400 [2024-11-08 12:09:26,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:09:26,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 282 treesize of output 436 [2024-11-08 12:09:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:09:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080815387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:09:27,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:09:27,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 66 [2024-11-08 12:09:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485652382] [2024-11-08 12:09:27,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:09:27,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-08 12:09:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:09:27,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-08 12:09:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=4108, Unknown=1, NotChecked=0, Total=4422 [2024-11-08 12:09:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:09:27,602 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:09:27,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.9242424242424243) internal successors, (127), 67 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:09:27,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:09:27,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:09:27,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:09:27,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:09:27,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:09:27,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:09:27,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:09:27,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:09:27,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:09:27,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:09:27,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:09:27,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:09:27,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-11-08 12:09:27,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:09:27,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-11-08 12:09:27,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:09:30,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:34,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:55,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:57,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:17,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:19,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:22,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:27,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:11:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:11:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-11-08 12:11:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:11:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-08 12:11:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2024-11-08 12:11:12,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 12:11:12,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 12:11:12,523 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-08 12:11:12,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:11:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash 906238601, now seen corresponding path program 3 times [2024-11-08 12:11:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:11:12,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469647982] [2024-11-08 12:11:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:11:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:11:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:11:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:11:25,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:11:25,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469647982] [2024-11-08 12:11:25,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469647982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:11:25,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225416296] [2024-11-08 12:11:25,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 12:11:25,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:11:25,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:11:25,932 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:11:25,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d33247-dd6e-4366-b151-e2ca66196093/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 12:11:28,006 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-08 12:11:28,007 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:11:28,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 202 conjuncts are in the unsatisfiable core [2024-11-08 12:11:28,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:11:28,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 12:11:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:11:28,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:11:28,372 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 12:11:28,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-08 12:11:28,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 12:11:28,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 12:11:28,778 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 12:11:28,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-08 12:11:28,958 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 12:11:28,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-08 12:11:28,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-08 12:11:29,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 12:11:29,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 12:11:29,502 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 [2024-11-08 12:11:29,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 12:11:29,709 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 12:11:29,709 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2024-11-08 12:11:29,788 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-08 12:11:29,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-08 12:11:30,108 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 8 treesize of output 1 [2024-11-08 12:11:30,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-08 12:11:30,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 12:11:30,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 12:11:30,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-11-08 12:11:30,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 12:11:31,188 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-08 12:11:31,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2024-11-08 12:11:31,305 INFO L349 Elim1Store]: treesize reduction 72, result has 33.3 percent of original size [2024-11-08 12:11:31,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 48 [2024-11-08 12:11:31,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 59 [2024-11-08 12:11:31,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 12:11:31,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-08 12:11:32,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 12:11:32,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 12:11:32,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 58 [2024-11-08 12:11:33,434 INFO L349 Elim1Store]: treesize reduction 122, result has 18.7 percent of original size [2024-11-08 12:11:33,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 61 [2024-11-08 12:11:33,536 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-08 12:11:33,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2024-11-08 12:11:34,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-08 12:11:34,263 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 8 treesize of output 1 [2024-11-08 12:11:34,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 83 [2024-11-08 12:11:35,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 12:11:35,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 12:11:35,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 81 [2024-11-08 12:11:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:11:42,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:11:45,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) c_~mult~0.offset))) (let ((.cse2 (store (select |c_#memory_$Pointer$.offset| c_~mult~0.base) .cse8 |c_ULTIMATE.start_main_#t~ret47#1.offset|))) (and (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse4 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (+ (* .cse4 4) c_~mult~0.offset))) (or (< .cse0 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse1 1)) (< 0 (+ (select .cse2 .cse0) 1 (* .cse1 4))) (< .cse1 0)))) (< |c_ULTIMATE.start_main_~i~3#1| .cse4)))))) (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse6 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (let ((.cse5 (+ (* .cse6 4) c_~mult~0.offset))) (or (< .cse5 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse6) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse7 (select (select .cse9 ~B~0.base) ~B~0.offset))) (or (< (+ 3 (select .cse2 .cse5) (* .cse7 4)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_~mult~0.base) .cse8 |c_ULTIMATE.start_main_#t~ret47#1.base|) .cse5))) (< c_~maxB~0 (+ .cse7 1)) (< .cse7 0)))))))))))) is different from false [2024-11-08 12:11:45,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) c_~mult~0.offset))) (let ((.cse3 (store (select |c_#memory_$Pointer$.offset| c_~mult~0.base) .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse1 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (+ (* .cse1 4) c_~mult~0.offset))) (or (< .cse0 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse1) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse2 (select (select .cse4 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse2 1)) (< 0 (+ (select .cse3 .cse0) 1 (* .cse2 4))) (< .cse2 0))))))))) (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse9 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (let ((.cse5 (+ (* .cse9 4) c_~mult~0.offset))) (or (< .cse5 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse6 (select (select .cse8 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse6 1)) (< .cse6 0) (< (+ 3 (select .cse3 .cse5) (* .cse6 4)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_~mult~0.base) .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5)))))) (< |c_ULTIMATE.start_main_~i~3#1| .cse9))))))))) is different from false [2024-11-08 12:12:17,856 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:17,857 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:17,858 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:17,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:12:17,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 88 [2024-11-08 12:12:17,876 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:17,880 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 85 treesize of output 81 [2024-11-08 12:12:17,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:12:17,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 525 treesize of output 521 [2024-11-08 12:12:18,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:18,469 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:18,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:18,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:12:18,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 193 [2024-11-08 12:12:18,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:18,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:18,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:18,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:12:18,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 156 [2024-11-08 12:12:18,528 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:18,534 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 153 treesize of output 149 [2024-11-08 12:12:18,546 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:12:18,553 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 148 treesize of output 144 [2024-11-08 12:12:18,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:12:18,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1043 treesize of output 1039 [2024-11-08 12:12:18,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:12:18,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5084 treesize of output 4926 [2024-11-08 12:12:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 51 refuted. 11 times theorem prover too weak. 10 trivial. 6 not checked. [2024-11-08 12:12:39,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225416296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:12:39,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:12:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 33, 29] total 100 [2024-11-08 12:12:39,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527889750] [2024-11-08 12:12:39,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:12:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-11-08 12:12:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:39,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-11-08 12:12:39,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=9101, Unknown=33, NotChecked=390, Total=10100 [2024-11-08 12:12:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:39,606 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:12:39,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 1.96) internal successors, (196), 101 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:12:39,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:12:39,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:12:39,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:12:39,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-11-08 12:12:39,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 154 states. [2024-11-08 12:12:39,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:31,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:33,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:35,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:37,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:40,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:42,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:44,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:50,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) c_~mult~0.offset))) (let ((.cse2 (store (select |c_#memory_$Pointer$.offset| c_~mult~0.base) .cse8 |c_ULTIMATE.start_main_#t~ret47#1.offset|))) (and (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse4 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (+ (* .cse4 4) c_~mult~0.offset))) (or (< .cse0 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse1 (select (select .cse3 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse1 1)) (< 0 (+ (select .cse2 .cse0) 1 (* .cse1 4))) (< .cse1 0)))) (< |c_ULTIMATE.start_main_~i~3#1| .cse4)))))) (= c_~A~0.offset 0) (= (select |c_#valid| c_~A~0.base) 1) (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse6 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (let ((.cse5 (+ (* .cse6 4) c_~mult~0.offset))) (or (< .cse5 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse6) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse7 (select (select .cse9 ~B~0.base) ~B~0.offset))) (or (< (+ 3 (select .cse2 .cse5) (* .cse7 4)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_~mult~0.base) .cse8 |c_ULTIMATE.start_main_#t~ret47#1.base|) .cse5))) (< c_~maxB~0 (+ .cse7 1)) (< .cse7 0)))))))))))) is different from false [2024-11-08 12:13:51,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) c_~mult~0.offset))) (let ((.cse5 (store (select |c_#memory_$Pointer$.offset| c_~mult~0.base) .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse0 (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse10 (select (select .cse12 c_~A~0.base) c_~A~0.offset))) (let ((.cse9 (+ (* .cse10 4) c_~mult~0.offset))) (or (< .cse9 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse10) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse11 (select (select .cse12 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse11 1)) (< 0 (+ (select .cse5 .cse9) 1 (* .cse11 4))) (< .cse11 0)))))))))) (.cse1 (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse8 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (+ (* .cse8 4) c_~mult~0.offset))) (or (< .cse3 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse4 (select (select .cse7 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse4 1)) (< .cse4 0) (< (+ 3 (select .cse5 .cse3) (* .cse4 4)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_~mult~0.base) .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3)))))) (< |c_ULTIMATE.start_main_~i~3#1| .cse8)))))))) (and (= |c_ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) .cse0 (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~4#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and .cse0 .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (let ((.cse2 (div |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))) (or (< .cse2 0) (< (+ (select |c_#length| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* .cse2 4294967296)) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4) 1)))) .cse1 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2024-11-08 12:14:07,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:20,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:43,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:45,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:48,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:05,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:09,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:14,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:16,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:18,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:20,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:23,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:25,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:28,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:31,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:33,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:36,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:38,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:40,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:53,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:55,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:58,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:16:16,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:16:29,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:16:30,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) c_~mult~0.offset))) (let ((.cse5 (store (select |c_#memory_$Pointer$.offset| c_~mult~0.base) .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse0 (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse10 (select (select .cse12 c_~A~0.base) c_~A~0.offset))) (let ((.cse9 (+ (* .cse10 4) c_~mult~0.offset))) (or (< .cse9 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse10) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse11 (select (select .cse12 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse11 1)) (< 0 (+ (select .cse5 .cse9) 1 (* .cse11 4))) (< .cse11 0)))))))))) (.cse1 (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse8 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (+ (* .cse8 4) c_~mult~0.offset))) (or (< .cse3 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse4 (select (select .cse7 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse4 1)) (< .cse4 0) (< (+ 3 (select .cse5 .cse3) (* .cse4 4)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_~mult~0.base) .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3)))))) (< |c_ULTIMATE.start_main_~i~3#1| .cse8)))))))) (and (= |c_ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) .cse0 (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~4#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and .cse0 .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (let ((.cse2 (div |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))) (or (< .cse2 0) (< (+ (select |c_#length| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* .cse2 4294967296)) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4) 1)))) (= c_~A~0.offset 0) .cse1 (= (select |c_#valid| c_~A~0.base) 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2024-11-08 12:17:20,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:17:22,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:17:24,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:17:26,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:17:28,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:17:36,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:18:30,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:18:32,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:18:34,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:18:36,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:19:00,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:19:04,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:19:07,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:19:35,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:19:39,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:20:14,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:20:16,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:20:18,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:20:20,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:20:22,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:20:24,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:20:26,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:20:28,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:21:02,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse100 (* |c_ULTIMATE.start_main_~i~3#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~3#1| 1)) (.cse20 (+ |c_ULTIMATE.start_main_~i~3#1| 2)) (.cse33 (+ |c_ULTIMATE.start_main_~i~3#1| 3)) (.cse0 (= (select |c_#valid| c_~mult~0.base) 1)) (.cse44 (select |c_#memory_$Pointer$.offset| c_~mult~0.base)) (.cse45 (select |c_#memory_$Pointer$.base| c_~mult~0.base)) (.cse48 (+ .cse100 c_~mult~0.offset))) (let ((.cse13 (store |c_#memory_$Pointer$.base| c_~mult~0.base (store .cse45 .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| c_~mult~0.base (store .cse44 .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse58 (* |c_ULTIMATE.start_create_fresh_int_array_~i~4#1| 4)) (.cse7 (+ .cse100 c_~mult~0.offset 4)) (.cse23 (+ .cse100 c_~mult~0.offset 8)) (.cse72 (store .cse44 .cse48 |c_ULTIMATE.start_main_#t~ret47#1.offset|)) (.cse1 (< 1 c_~maxB~0)) (.cse2 (not .cse0)) (.cse75 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (let ((.cse96 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| 1))) (or (not (= (select .cse96 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int)) (or (not (= (select (store .cse96 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)) (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int))) (let ((.cse99 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse97 (select (select .cse99 c_~A~0.base) c_~A~0.offset))) (or (= .cse97 .cse33) (= .cse3 .cse97) (= .cse20 .cse97) (< .cse33 .cse97) (< (+ (* .cse97 4) c_~mult~0.offset) 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse98 (select (select .cse99 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse98 1)) (< .cse98 0)))) (= |c_ULTIMATE.start_main_~i~3#1| .cse97)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231|) 0))))) (.cse12 (* c_~maxB~0 4)) (.cse19 (not (= c_~maxB~0 1))) (.cse16 (<= 4 (select |c_#length| (select .cse45 0)))) (.cse17 (= |c_ULTIMATE.start_main_~i~3#1| 1)) (.cse18 (= (select .cse44 0) 0))) (and .cse0 (or .cse1 .cse2 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse4 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (+ c_~mult~0.offset (* .cse4 4)))) (or (< .cse3 .cse4) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse5 (select (select .cse9 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse5 1)) (< 0 (+ (* 4 .cse5) 1 (select (store (select (store .cse6 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1162) c_~mult~0.base) .cse7 0) .cse8))) (< .cse5 0)))) (< .cse8 0)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse15 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (let ((.cse11 (+ c_~mult~0.offset (* .cse15 4)))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse10 (select (select .cse14 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse10 1)) (< (+ 3 (* 4 .cse10) (select (store (select (store .cse6 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1162) c_~mult~0.base) .cse7 0) .cse11)) (select (store |c_#length| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| .cse12) (select (store (select (store .cse13 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1163) c_~mult~0.base) .cse7 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) .cse11))) (< .cse10 0)))) (< .cse3 .cse15) (< .cse11 0)))))))))) (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret47#1.base|) 1) .cse16 (= |c_ULTIMATE.start_main_#t~ret47#1.offset| 0) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_#t~ret47#1.base|)) .cse17 .cse18) .cse19) (or .cse1 .cse2 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1154 (Array Int Int))) (or (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse21 (select (select .cse25 c_~A~0.base) c_~A~0.offset))) (let ((.cse24 (+ c_~mult~0.offset (* .cse21 4)))) (or (< .cse20 .cse21) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse22 (select (select .cse25 ~B~0.base) ~B~0.offset))) (or (< (+ (* .cse22 4) (select (store (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1156) c_~mult~0.base (store (select (store .cse6 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1156) c_~mult~0.base) .cse7 0)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1162) c_~mult~0.base) .cse23 0) .cse24) 3) (select (store (store |c_#length| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| .cse12) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| .cse12) (select (store (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1154) c_~mult~0.base (store (select (store .cse13 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1154) c_~mult~0.base) .cse7 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1163) c_~mult~0.base) .cse23 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) .cse24))) (< .cse22 0) (< c_~maxB~0 (+ .cse22 1))))) (< .cse24 0)))))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1155 (Array Int Int))) (or (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse26 (select (select .cse29 c_~A~0.base) c_~A~0.offset))) (let ((.cse27 (+ c_~mult~0.offset (* .cse26 4)))) (or (< .cse20 .cse26) (< .cse27 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse28 (select (select .cse29 ~B~0.base) ~B~0.offset))) (or (< 0 (+ (* .cse28 4) (select (store (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1156) c_~mult~0.base (store (select (store .cse6 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1156) c_~mult~0.base) .cse7 0)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1162) c_~mult~0.base) .cse23 0) .cse27) 1)) (< .cse28 0) (< c_~maxB~0 (+ .cse28 1)))))))))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)))))) (or .cse1 (and (forall ((v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (let ((.cse34 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| 1))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int)) (or (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int))) (let ((.cse31 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1138) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse32 (select (select .cse31 c_~A~0.base) c_~A~0.offset))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse30 (select (select .cse31 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse30 1)) (< (+ (* .cse30 4) 3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (store (store (store |c_#length| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| .cse12) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| .cse12) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| .cse12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< .cse30 0)))) (= .cse3 .cse32) (= .cse20 .cse32) (= .cse32 .cse33) (< .cse33 .cse32) (< (+ (* .cse32 4) c_~mult~0.offset) 0))))) (not (= (select (store .cse34 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)))) (not (= (select .cse34 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231|) 0)))) (forall ((v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (let ((.cse35 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| 1))) (or (not (= (select .cse35 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int)) (or (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int))) (let ((.cse38 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1138) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse36 (select (select .cse38 c_~A~0.base) c_~A~0.offset))) (or (= .cse3 .cse36) (= |c_ULTIMATE.start_main_~i~3#1| .cse36) (= .cse20 .cse36) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse37 (select (select .cse38 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse37 1)) (< .cse37 0)))) (= .cse36 .cse33) (< .cse33 .cse36) (< (+ (* .cse36 4) c_~mult~0.offset) 0))))) (not (= (select (store .cse35 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231|) 0)))) (forall ((v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (let ((.cse39 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| 1))) (or (not (= (select .cse39 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int)) (or (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int))) (let ((.cse41 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1138) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse42 (select (select .cse41 c_~A~0.base) c_~A~0.offset))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse40 (select (select .cse41 ~B~0.base) ~B~0.offset))) (or (< 0 (+ (* .cse40 4) 1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~maxB~0 (+ .cse40 1)) (< .cse40 0)))) (= .cse3 .cse42) (= .cse20 .cse42) (= .cse42 .cse33) (< .cse33 .cse42) (< (+ (* .cse42 4) c_~mult~0.offset) 0))))) (not (= (select (store .cse39 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231|) 0))))) .cse2) (or .cse19 (let ((.cse43 (select .cse45 4))) (and .cse0 (= (select |c_#valid| .cse43) 1) (= |c_ULTIMATE.start_main_~i~3#1| 2) .cse16 (<= 4 (select |c_#length| .cse43)) .cse18 (= 0 (select .cse44 4))))) (= c_~mult~0.offset 0) (or .cse1 .cse2 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1154 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse52 (select (select .cse51 c_~A~0.base) c_~A~0.offset))) (let ((.cse49 (+ (* .cse52 4) c_~mult~0.offset))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse46 (select (select .cse51 ~B~0.base) ~B~0.offset))) (or (< .cse46 0) (< (+ (* .cse46 4) 3 (select (store (select (store (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1156))) (store .cse47 c_~mult~0.base (store (select .cse47 c_~mult~0.base) .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1162) c_~mult~0.base) .cse7 0) .cse49)) (select (store |c_#length| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| .cse12) (select (store (select (store (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1154))) (store .cse50 c_~mult~0.base (store (select .cse50 c_~mult~0.base) .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1163) c_~mult~0.base) .cse7 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) .cse49))) (< c_~maxB~0 (+ .cse46 1))))) (< .cse3 .cse52) (< .cse49 0)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1155 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse57 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse53 (select (select .cse57 c_~A~0.base) c_~A~0.offset))) (let ((.cse54 (+ (* .cse53 4) c_~mult~0.offset))) (or (< .cse3 .cse53) (< .cse54 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse55 (select (select .cse57 ~B~0.base) ~B~0.offset))) (or (< 0 (+ (* .cse55 4) (select (store (select (store (let ((.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1156))) (store .cse56 c_~mult~0.base (store (select .cse56 c_~mult~0.base) .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1162) c_~mult~0.base) .cse7 0) .cse54) 1)) (< .cse55 0) (< c_~maxB~0 (+ .cse55 1))))))))))))) (< (select |c_#length| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse58 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1)) .cse1 (< (+ .cse58 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) .cse2 (and (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1155 (Array Int Int))) (or (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse63 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse60 (select (select .cse63 c_~A~0.base) c_~A~0.offset))) (let ((.cse59 (+ (* .cse60 4) c_~mult~0.offset))) (or (< .cse59 0) (< .cse20 .cse60) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse61 (select (select .cse63 ~B~0.base) ~B~0.offset))) (or (< .cse61 0) (< 0 (+ (select (store (select (store (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1146))) (store (store .cse62 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1156) c_~mult~0.base (store (select (store (store .cse62 c_~mult~0.base (store (select .cse62 c_~mult~0.base) .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1156) c_~mult~0.base) .cse7 0))) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1162) c_~mult~0.base) .cse23 0) .cse59) (* .cse61 4) 1)) (< c_~maxB~0 (+ .cse61 1)))))))))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)))))) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int) (v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1154 (Array Int Int))) (or (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse69 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse65 (select (select .cse69 c_~A~0.base) c_~A~0.offset))) (let ((.cse64 (+ (* .cse65 4) c_~mult~0.offset))) (or (< .cse64 0) (< .cse20 .cse65) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse66 (select (select .cse69 ~B~0.base) ~B~0.offset))) (or (< .cse66 0) (< c_~maxB~0 (+ .cse66 1)) (< (+ (select (store (select (store (let ((.cse67 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1146))) (store (store .cse67 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1156) c_~mult~0.base (store (select (store (store .cse67 c_~mult~0.base (store (select .cse67 c_~mult~0.base) .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1156) c_~mult~0.base) .cse7 0))) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1162) c_~mult~0.base) .cse23 0) .cse64) (* .cse66 4) 3) (select (store (store |c_#length| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| .cse12) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| .cse12) (select (store (select (store (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1147))) (store (store .cse68 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1154) c_~mult~0.base (store (select (store (store .cse68 c_~mult~0.base (store (select .cse68 c_~mult~0.base) .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1154) c_~mult~0.base) .cse7 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|))) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1163) c_~mult~0.base) .cse23 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) .cse64))))))))))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)))))))) (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse73 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse74 (select (select .cse73 c_~A~0.base) c_~A~0.offset))) (let ((.cse70 (+ (* .cse74 4) c_~mult~0.offset))) (or (< .cse70 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse71 (select (select .cse73 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse71 1)) (< 0 (+ (select .cse72 .cse70) 1 (* .cse71 4))) (< .cse71 0)))) (< |c_ULTIMATE.start_main_~i~3#1| .cse74)))))) (= c_~A~0.offset 0) (= (select |c_#valid| c_~A~0.base) 1) (or .cse1 (and .cse75 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (let ((.cse79 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| 1))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int)) (or (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int))) (let ((.cse78 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse76 (select (select .cse78 c_~A~0.base) c_~A~0.offset))) (or (= .cse76 .cse33) (= .cse3 .cse76) (= .cse20 .cse76) (< .cse33 .cse76) (< (+ (* .cse76 4) c_~mult~0.offset) 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse77 (select (select .cse78 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse77 1)) (< .cse77 0) (< 0 (+ (* .cse77 4) 1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))) (not (= (select (store .cse79 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)))) (not (= (select .cse79 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231|) 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (let ((.cse80 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| 1))) (or (not (= (select .cse80 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int)) (or (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int))) (let ((.cse83 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse81 (select (select .cse83 c_~A~0.base) c_~A~0.offset))) (or (= .cse81 .cse33) (= .cse3 .cse81) (= .cse20 .cse81) (< .cse33 .cse81) (< (+ (* .cse81 4) c_~mult~0.offset) 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse82 (select (select .cse83 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse82 1)) (< (+ (* .cse82 4) 3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (store (store (store |c_#length| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| .cse12) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| .cse12) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| .cse12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< .cse82 0)))))))) (not (= (select (store .cse80 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231|) 0))))) .cse2) (forall ((v_ArrVal_1166 (Array Int Int))) (let ((.cse87 (store |c_#memory_int| c_~mult~0.base v_ArrVal_1166))) (let ((.cse85 (select (select .cse87 c_~A~0.base) c_~A~0.offset))) (let ((.cse84 (+ (* .cse85 4) c_~mult~0.offset))) (or (< .cse84 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse85) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse86 (select (select .cse87 ~B~0.base) ~B~0.offset))) (or (< (+ 3 (select .cse72 .cse84) (* .cse86 4)) (select |c_#length| (select (store .cse45 .cse48 |c_ULTIMATE.start_main_#t~ret47#1.base|) .cse84))) (< c_~maxB~0 (+ .cse86 1)) (< .cse86 0))))))))) (or .cse1 .cse2 (and .cse75 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (let ((.cse88 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| 1))) (or (not (= (select .cse88 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int)) (or (not (= (select (store .cse88 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0)) (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int))) (let ((.cse91 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse89 (select (select .cse91 c_~A~0.base) c_~A~0.offset))) (or (= .cse89 .cse33) (= .cse3 .cse89) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse90 (select (select .cse91 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse90 1)) (< .cse90 0) (< 0 (+ (* .cse90 4) |c_ULTIMATE.start_main_#t~ret47#1.offset| 1))))) (= .cse20 .cse89) (< .cse33 .cse89) (< (+ (* .cse89 4) c_~mult~0.offset) 0)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231|) 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (let ((.cse92 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| 1))) (or (not (= (select .cse92 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| Int) (v_ArrVal_1153 Int)) (or (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1164 (Array Int Int))) (let ((.cse95 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| v_ArrVal_1145) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1155) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| v_ArrVal_1164) c_~mult~0.base v_ArrVal_1166))) (let ((.cse93 (select (select .cse95 c_~A~0.base) c_~A~0.offset))) (or (= .cse93 .cse33) (= .cse3 .cse93) (= .cse20 .cse93) (< .cse33 .cse93) (< (+ (* .cse93 4) c_~mult~0.offset) 0) (forall ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse94 (select (select .cse95 ~B~0.base) ~B~0.offset))) (or (< c_~maxB~0 (+ .cse94 1)) (< (+ (* .cse94 4) 3 |c_ULTIMATE.start_main_#t~ret47#1.offset|) (select (store (store (store |c_#length| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231| .cse12) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| .cse12) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229| .cse12) |c_ULTIMATE.start_main_#t~ret47#1.base|)) (< .cse94 0)))))))) (not (= (select (store .cse92 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_ArrVal_1153) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_229|) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_231|) 0)))))) (or .cse19 (and .cse16 .cse17 .cse18)))))) is different from false