./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i --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_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:22:47,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:22:47,891 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 12:22:47,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:22:47,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:22:47,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:22:47,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:22:47,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:22:47,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:22:47,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:22:47,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:22:47,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:22:47,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:22:47,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:22:47,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:22:47,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:22:47,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:22:47,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:22:47,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:22:47,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:22:47,952 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 12:22:47,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 12:22:47,953 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 12:22:47,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:22:47,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:22:47,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:22:47,954 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 12:22:47,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:22:47,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:22:47,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:22:47,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:22:47,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:22:47,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:22:47,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:22:47,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:22:47,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:22:47,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:22:47,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:22:47,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:22:47,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:22:47,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:22:47,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:22:47,962 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/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_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-08 12:22:48,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:22:48,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:22:48,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:22:48,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:22:48,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:22:48,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i Unable to find full path for "g++" [2024-11-08 12:22:50,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:22:50,644 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:22:50,649 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i [2024-11-08 12:22:50,666 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/data/ccaa5c1c8/cc9d8e279d7e47adb178cd23ee94f6f6/FLAG94aa85c4e [2024-11-08 12:22:50,905 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/data/ccaa5c1c8/cc9d8e279d7e47adb178cd23ee94f6f6 [2024-11-08 12:22:50,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:22:50,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:22:50,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:22:50,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:22:50,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:22:50,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:22:50" (1/1) ... [2024-11-08 12:22:50,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2243894e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:50, skipping insertion in model container [2024-11-08 12:22:50,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:22:50" (1/1) ... [2024-11-08 12:22:50,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:22:51,482 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:22:51,542 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:22:51,550 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:22:51,558 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:22:51,568 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:22:51,625 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:22:51,627 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:22:51,633 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:22:51,644 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:22:51,654 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:22:51,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:22:51,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:22:51,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:22:51,862 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:22:51,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51 WrapperNode [2024-11-08 12:22:51,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:22:51,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:22:51,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:22:51,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:22:51,880 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:22:51" (1/1) ... [2024-11-08 12:22:51,933 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:22:51" (1/1) ... [2024-11-08 12:22:52,026 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1529 [2024-11-08 12:22:52,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:22:52,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:22:52,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:22:52,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:22:52,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,199 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-08 12:22:52,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:22:52,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:22:52,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:22:52,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:22:52,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (1/1) ... [2024-11-08 12:22:52,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:22:52,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:22:52,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 12:22:52,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 12:22:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 12:22:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 12:22:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 12:22:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 12:22:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 12:22:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 12:22:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 12:22:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 12:22:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 12:22:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:22:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 12:22:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 12:22:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 12:22:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 12:22:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:22:52,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 12:22:52,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 12:22:52,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:22:52,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:22:52,604 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:22:52,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:22:52,614 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 12:22:52,675 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 12:22:55,563 INFO L? ?]: Removed 1501 outVars from TransFormulas that were not future-live. [2024-11-08 12:22:55,564 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:22:55,603 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:22:55,603 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-08 12:22:55,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:22:55 BoogieIcfgContainer [2024-11-08 12:22:55,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:22:55,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:22:55,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:22:55,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:22:55,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:22:50" (1/3) ... [2024-11-08 12:22:55,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1caae0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:22:55, skipping insertion in model container [2024-11-08 12:22:55,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:51" (2/3) ... [2024-11-08 12:22:55,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1caae0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:22:55, skipping insertion in model container [2024-11-08 12:22:55,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:22:55" (3/3) ... [2024-11-08 12:22:55,613 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test4-1.i [2024-11-08 12:22:55,631 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:22:55,632 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-08 12:22:55,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:22:55,714 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@197259a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:22:55,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-08 12:22:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 1438 states, 808 states have (on average 2.0693069306930694) internal successors, (1672), 1430 states have internal predecessors, (1672), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 12:22:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 12:22:55,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:55,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 12:22:55,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:22:55,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1482226, now seen corresponding path program 1 times [2024-11-08 12:22:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:55,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214535430] [2024-11-08 12:22:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:55,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,933 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:22:55,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:55,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214535430] [2024-11-08 12:22:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214535430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:55,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:22:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024773029] [2024-11-08 12:22:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:55,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:22:55,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:55,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:22:55,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:55,989 INFO L87 Difference]: Start difference. First operand has 1438 states, 808 states have (on average 2.0693069306930694) internal successors, (1672), 1430 states have internal predecessors, (1672), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:22:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:57,106 INFO L93 Difference]: Finished difference Result 1445 states and 1633 transitions. [2024-11-08 12:22:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 12:22:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:57,140 INFO L225 Difference]: With dead ends: 1445 [2024-11-08 12:22:57,140 INFO L226 Difference]: Without dead ends: 1441 [2024-11-08 12:22:57,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:57,146 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 30 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:22:57,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2574 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 12:22:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2024-11-08 12:22:57,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1432. [2024-11-08 12:22:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 813 states have (on average 1.982779827798278) internal successors, (1612), 1424 states have internal predecessors, (1612), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 12:22:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1624 transitions. [2024-11-08 12:22:57,300 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1624 transitions. Word has length 4 [2024-11-08 12:22:57,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:57,300 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1624 transitions. [2024-11-08 12:22:57,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:22:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1624 transitions. [2024-11-08 12:22:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 12:22:57,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:57,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:22:57,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:22:57,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:22:57,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1134576318, now seen corresponding path program 1 times [2024-11-08 12:22:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:57,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274073192] [2024-11-08 12:22:57,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:57,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:57,403 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:22:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:57,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274073192] [2024-11-08 12:22:57,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274073192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:57,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:57,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:22:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466867075] [2024-11-08 12:22:57,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:57,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:22:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:22:57,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:57,408 INFO L87 Difference]: Start difference. First operand 1432 states and 1624 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:22:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:58,529 INFO L93 Difference]: Finished difference Result 1338 states and 1528 transitions. [2024-11-08 12:22:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:58,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-08 12:22:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:58,534 INFO L225 Difference]: With dead ends: 1338 [2024-11-08 12:22:58,534 INFO L226 Difference]: Without dead ends: 1338 [2024-11-08 12:22:58,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:58,536 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 1363 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:22:58,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 905 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 12:22:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-11-08 12:22:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2024-11-08 12:22:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 813 states have (on average 1.86469864698647) internal successors, (1516), 1330 states have internal predecessors, (1516), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 12:22:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1528 transitions. [2024-11-08 12:22:58,567 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1528 transitions. Word has length 7 [2024-11-08 12:22:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:58,567 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 1528 transitions. [2024-11-08 12:22:58,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:22:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1528 transitions. [2024-11-08 12:22:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 12:22:58,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:58,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:22:58,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:22:58,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:22:58,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:58,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1134576319, now seen corresponding path program 1 times [2024-11-08 12:22:58,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:58,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512054361] [2024-11-08 12:22:58,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:58,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,690 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:22:58,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:58,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512054361] [2024-11-08 12:22:58,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512054361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:58,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:58,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:22:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399050933] [2024-11-08 12:22:58,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:58,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:22:58,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:58,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:22:58,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:58,694 INFO L87 Difference]: Start difference. First operand 1338 states and 1528 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:22:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:59,931 INFO L93 Difference]: Finished difference Result 1756 states and 2026 transitions. [2024-11-08 12:22:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:59,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-08 12:22:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:59,938 INFO L225 Difference]: With dead ends: 1756 [2024-11-08 12:22:59,939 INFO L226 Difference]: Without dead ends: 1756 [2024-11-08 12:22:59,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:59,940 INFO L432 NwaCegarLoop]: 1262 mSDtfsCounter, 826 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:22:59,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1893 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 12:22:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2024-11-08 12:22:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1602. [2024-11-08 12:22:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1087 states have (on average 1.8325666973321066) internal successors, (1992), 1594 states have internal predecessors, (1992), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 12:22:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2004 transitions. [2024-11-08 12:22:59,979 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2004 transitions. Word has length 7 [2024-11-08 12:22:59,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:59,980 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2004 transitions. [2024-11-08 12:22:59,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:22:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2004 transitions. [2024-11-08 12:22:59,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 12:22:59,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:59,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:22:59,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:22:59,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:22:59,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1142022877, now seen corresponding path program 1 times [2024-11-08 12:22:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:59,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605972660] [2024-11-08 12:22:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:59,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,065 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:23:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605972660] [2024-11-08 12:23:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605972660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279127373] [2024-11-08 12:23:00,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:00,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:00,067 INFO L87 Difference]: Start difference. First operand 1602 states and 2004 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:00,512 INFO L93 Difference]: Finished difference Result 2658 states and 3361 transitions. [2024-11-08 12:23:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 12:23:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:00,523 INFO L225 Difference]: With dead ends: 2658 [2024-11-08 12:23:00,523 INFO L226 Difference]: Without dead ends: 2656 [2024-11-08 12:23:00,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:00,526 INFO L432 NwaCegarLoop]: 1493 mSDtfsCounter, 1005 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 4242 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:00,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 4242 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 12:23:00,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2024-11-08 12:23:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2357. [2024-11-08 12:23:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1842 states have (on average 1.8132464712269272) internal successors, (3340), 2346 states have internal predecessors, (3340), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3358 transitions. [2024-11-08 12:23:00,597 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3358 transitions. Word has length 8 [2024-11-08 12:23:00,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:00,597 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 3358 transitions. [2024-11-08 12:23:00,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3358 transitions. [2024-11-08 12:23:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 12:23:00,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:00,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:00,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:23:00,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:00,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1758992263, now seen corresponding path program 1 times [2024-11-08 12:23:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230647037] [2024-11-08 12:23:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:00,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,694 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:23:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230647037] [2024-11-08 12:23:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230647037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:00,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090516126] [2024-11-08 12:23:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:00,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:00,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:00,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:00,697 INFO L87 Difference]: Start difference. First operand 2357 states and 3358 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:23:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:02,046 INFO L93 Difference]: Finished difference Result 2432 states and 3464 transitions. [2024-11-08 12:23:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 12:23:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:02,055 INFO L225 Difference]: With dead ends: 2432 [2024-11-08 12:23:02,055 INFO L226 Difference]: Without dead ends: 2432 [2024-11-08 12:23:02,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:02,057 INFO L432 NwaCegarLoop]: 869 mSDtfsCounter, 1632 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:02,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 1597 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 12:23:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-11-08 12:23:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2334. [2024-11-08 12:23:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 1842 states have (on average 1.788273615635179) internal successors, (3294), 2323 states have internal predecessors, (3294), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3312 transitions. [2024-11-08 12:23:02,150 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3312 transitions. Word has length 14 [2024-11-08 12:23:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:02,151 INFO L471 AbstractCegarLoop]: Abstraction has 2334 states and 3312 transitions. [2024-11-08 12:23:02,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:23:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3312 transitions. [2024-11-08 12:23:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 12:23:02,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:02,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:02,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 12:23:02,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:02,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1758992262, now seen corresponding path program 1 times [2024-11-08 12:23:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118974466] [2024-11-08 12:23:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,358 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:23:02,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:02,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118974466] [2024-11-08 12:23:02,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118974466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:02,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:02,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:02,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294244649] [2024-11-08 12:23:02,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:02,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:02,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:02,361 INFO L87 Difference]: Start difference. First operand 2334 states and 3312 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:23:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:04,041 INFO L93 Difference]: Finished difference Result 2804 states and 3786 transitions. [2024-11-08 12:23:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:04,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 12:23:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:04,051 INFO L225 Difference]: With dead ends: 2804 [2024-11-08 12:23:04,051 INFO L226 Difference]: Without dead ends: 2804 [2024-11-08 12:23:04,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:04,052 INFO L432 NwaCegarLoop]: 1329 mSDtfsCounter, 1242 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:04,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 2877 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 12:23:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2024-11-08 12:23:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2452. [2024-11-08 12:23:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1960 states have (on average 1.7540816326530613) internal successors, (3438), 2441 states have internal predecessors, (3438), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3456 transitions. [2024-11-08 12:23:04,128 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3456 transitions. Word has length 14 [2024-11-08 12:23:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:04,129 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3456 transitions. [2024-11-08 12:23:04,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:23:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3456 transitions. [2024-11-08 12:23:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 12:23:04,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:04,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:04,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 12:23:04,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:04,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:04,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1995083698, now seen corresponding path program 1 times [2024-11-08 12:23:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417057914] [2024-11-08 12:23:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 12:23:04,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:04,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417057914] [2024-11-08 12:23:04,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417057914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:04,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:04,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:04,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704304240] [2024-11-08 12:23:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:04,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:04,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:04,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:04,419 INFO L87 Difference]: Start difference. First operand 2452 states and 3456 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:23:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:04,459 INFO L93 Difference]: Finished difference Result 2183 states and 3080 transitions. [2024-11-08 12:23:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 12:23:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:04,467 INFO L225 Difference]: With dead ends: 2183 [2024-11-08 12:23:04,467 INFO L226 Difference]: Without dead ends: 2183 [2024-11-08 12:23:04,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:04,468 INFO L432 NwaCegarLoop]: 1344 mSDtfsCounter, 51 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:04,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 2645 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2024-11-08 12:23:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2183. [2024-11-08 12:23:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1714 states have (on average 1.7864644107351224) internal successors, (3062), 2172 states have internal predecessors, (3062), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3080 transitions. [2024-11-08 12:23:04,511 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3080 transitions. Word has length 52 [2024-11-08 12:23:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3080 transitions. [2024-11-08 12:23:04,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:23:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3080 transitions. [2024-11-08 12:23:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 12:23:04,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:04,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:04,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 12:23:04,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:04,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1123904235, now seen corresponding path program 1 times [2024-11-08 12:23:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:04,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866914697] [2024-11-08 12:23:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:04,647 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:23:04,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:04,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866914697] [2024-11-08 12:23:04,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866914697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:04,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:04,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:04,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654687763] [2024-11-08 12:23:04,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:04,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:04,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:04,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:04,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:04,650 INFO L87 Difference]: Start difference. First operand 2183 states and 3080 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:04,754 INFO L93 Difference]: Finished difference Result 2209 states and 3098 transitions. [2024-11-08 12:23:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:04,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-08 12:23:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:04,761 INFO L225 Difference]: With dead ends: 2209 [2024-11-08 12:23:04,762 INFO L226 Difference]: Without dead ends: 2209 [2024-11-08 12:23:04,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:04,762 INFO L432 NwaCegarLoop]: 1336 mSDtfsCounter, 56 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:04,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3935 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2024-11-08 12:23:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 2207. [2024-11-08 12:23:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 1738 states have (on average 1.7710011507479861) internal successors, (3078), 2196 states have internal predecessors, (3078), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3096 transitions. [2024-11-08 12:23:04,801 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3096 transitions. Word has length 63 [2024-11-08 12:23:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:04,802 INFO L471 AbstractCegarLoop]: Abstraction has 2207 states and 3096 transitions. [2024-11-08 12:23:04,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3096 transitions. [2024-11-08 12:23:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 12:23:04,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:04,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:04,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 12:23:04,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:04,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1385985353, now seen corresponding path program 1 times [2024-11-08 12:23:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:04,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536470562] [2024-11-08 12:23:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:04,942 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:23:04,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536470562] [2024-11-08 12:23:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536470562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:04,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:04,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109857399] [2024-11-08 12:23:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:04,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:04,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:04,945 INFO L87 Difference]: Start difference. First operand 2207 states and 3096 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:04,999 INFO L93 Difference]: Finished difference Result 1975 states and 2691 transitions. [2024-11-08 12:23:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:05,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-08 12:23:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:05,006 INFO L225 Difference]: With dead ends: 1975 [2024-11-08 12:23:05,006 INFO L226 Difference]: Without dead ends: 1975 [2024-11-08 12:23:05,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:05,010 INFO L432 NwaCegarLoop]: 1351 mSDtfsCounter, 75 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:05,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2674 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2024-11-08 12:23:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1975. [2024-11-08 12:23:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1506 states have (on average 1.7749003984063745) internal successors, (2673), 1964 states have internal predecessors, (2673), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2691 transitions. [2024-11-08 12:23:05,046 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2691 transitions. Word has length 71 [2024-11-08 12:23:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:05,048 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 2691 transitions. [2024-11-08 12:23:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2691 transitions. [2024-11-08 12:23:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 12:23:05,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:05,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:05,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 12:23:05,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:05,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1818784399, now seen corresponding path program 1 times [2024-11-08 12:23:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:05,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427001320] [2024-11-08 12:23:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:05,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,715 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:23:05,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427001320] [2024-11-08 12:23:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427001320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:05,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:05,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:23:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669214368] [2024-11-08 12:23:05,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:05,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:23:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:05,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:23:05,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:23:05,717 INFO L87 Difference]: Start difference. First operand 1975 states and 2691 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:07,253 INFO L93 Difference]: Finished difference Result 1891 states and 2566 transitions. [2024-11-08 12:23:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:07,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-08 12:23:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:07,260 INFO L225 Difference]: With dead ends: 1891 [2024-11-08 12:23:07,260 INFO L226 Difference]: Without dead ends: 1891 [2024-11-08 12:23:07,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:23:07,261 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 2312 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:07,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 1144 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 12:23:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2024-11-08 12:23:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1617. [2024-11-08 12:23:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1232 states have (on average 1.6737012987012987) internal successors, (2062), 1606 states have internal predecessors, (2062), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2080 transitions. [2024-11-08 12:23:07,295 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2080 transitions. Word has length 74 [2024-11-08 12:23:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:07,295 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2080 transitions. [2024-11-08 12:23:07,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2080 transitions. [2024-11-08 12:23:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 12:23:07,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:07,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:07,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 12:23:07,297 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:07,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1326524278, now seen corresponding path program 1 times [2024-11-08 12:23:07,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:07,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237590538] [2024-11-08 12:23:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:07,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,648 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:23:07,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:07,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237590538] [2024-11-08 12:23:07,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237590538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:07,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:07,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:07,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142654587] [2024-11-08 12:23:07,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:07,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:23:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:07,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:23:07,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:07,650 INFO L87 Difference]: Start difference. First operand 1617 states and 2080 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:08,708 INFO L93 Difference]: Finished difference Result 1616 states and 2078 transitions. [2024-11-08 12:23:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:23:08,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-08 12:23:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:08,714 INFO L225 Difference]: With dead ends: 1616 [2024-11-08 12:23:08,714 INFO L226 Difference]: Without dead ends: 1616 [2024-11-08 12:23:08,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:23:08,715 INFO L432 NwaCegarLoop]: 1263 mSDtfsCounter, 2 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:08,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3569 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 12:23:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-11-08 12:23:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1616. [2024-11-08 12:23:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1232 states have (on average 1.672077922077922) internal successors, (2060), 1605 states have internal predecessors, (2060), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2078 transitions. [2024-11-08 12:23:08,745 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2078 transitions. Word has length 79 [2024-11-08 12:23:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:08,745 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2078 transitions. [2024-11-08 12:23:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2078 transitions. [2024-11-08 12:23:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 12:23:08,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:08,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:08,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 12:23:08,747 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:08,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:08,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1326524277, now seen corresponding path program 1 times [2024-11-08 12:23:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:08,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081912185] [2024-11-08 12:23:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:08,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,245 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:23:09,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:09,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081912185] [2024-11-08 12:23:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081912185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:09,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:09,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154013890] [2024-11-08 12:23:09,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:09,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:23:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:09,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:23:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:09,247 INFO L87 Difference]: Start difference. First operand 1616 states and 2078 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:10,668 INFO L93 Difference]: Finished difference Result 1615 states and 2076 transitions. [2024-11-08 12:23:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:23:10,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-08 12:23:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:10,673 INFO L225 Difference]: With dead ends: 1615 [2024-11-08 12:23:10,673 INFO L226 Difference]: Without dead ends: 1615 [2024-11-08 12:23:10,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:23:10,674 INFO L432 NwaCegarLoop]: 1263 mSDtfsCounter, 1 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:10,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3584 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 12:23:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-08 12:23:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2024-11-08 12:23:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1230 states have (on average 1.673170731707317) internal successors, (2058), 1604 states have internal predecessors, (2058), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2076 transitions. [2024-11-08 12:23:10,701 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2076 transitions. Word has length 79 [2024-11-08 12:23:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:10,701 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2076 transitions. [2024-11-08 12:23:10,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:23:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2076 transitions. [2024-11-08 12:23:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 12:23:10,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:10,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:10,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 12:23:10,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:10,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1874297167, now seen corresponding path program 1 times [2024-11-08 12:23:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929856752] [2024-11-08 12:23:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:11,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:11,051 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:23:11,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:11,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929856752] [2024-11-08 12:23:11,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929856752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:11,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:11,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 12:23:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272292328] [2024-11-08 12:23:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:11,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 12:23:11,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:11,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 12:23:11,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:23:11,055 INFO L87 Difference]: Start difference. First operand 1615 states and 2076 transitions. Second operand has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:12,946 INFO L93 Difference]: Finished difference Result 1633 states and 2106 transitions. [2024-11-08 12:23:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:23:12,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-11-08 12:23:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:12,955 INFO L225 Difference]: With dead ends: 1633 [2024-11-08 12:23:12,955 INFO L226 Difference]: Without dead ends: 1633 [2024-11-08 12:23:12,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:23:12,956 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 10 mSDsluCounter, 4284 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5536 SdHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:12,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5536 Invalid, 2056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 12:23:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-08 12:23:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1624. [2024-11-08 12:23:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1238 states have (on average 1.6712439418416802) internal successors, (2069), 1611 states have internal predecessors, (2069), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 12:23:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2096 transitions. [2024-11-08 12:23:12,996 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2096 transitions. Word has length 87 [2024-11-08 12:23:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:12,997 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2096 transitions. [2024-11-08 12:23:12,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2096 transitions. [2024-11-08 12:23:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 12:23:12,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:12,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 12:23:12,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:12,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1874297166, now seen corresponding path program 1 times [2024-11-08 12:23:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:13,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256400675] [2024-11-08 12:23:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,663 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:23:13,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256400675] [2024-11-08 12:23:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256400675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:13,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 12:23:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980385307] [2024-11-08 12:23:13,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:13,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 12:23:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:13,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 12:23:13,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:23:13,666 INFO L87 Difference]: Start difference. First operand 1624 states and 2096 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:15,315 INFO L93 Difference]: Finished difference Result 1624 states and 2094 transitions. [2024-11-08 12:23:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:23:15,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-11-08 12:23:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:15,321 INFO L225 Difference]: With dead ends: 1624 [2024-11-08 12:23:15,321 INFO L226 Difference]: Without dead ends: 1624 [2024-11-08 12:23:15,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 12:23:15,322 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 5 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4630 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:15,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4630 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 12:23:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-11-08 12:23:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2024-11-08 12:23:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1238 states have (on average 1.6696284329563813) internal successors, (2067), 1611 states have internal predecessors, (2067), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 12:23:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2094 transitions. [2024-11-08 12:23:15,351 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2094 transitions. Word has length 87 [2024-11-08 12:23:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:15,352 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2094 transitions. [2024-11-08 12:23:15,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2094 transitions. [2024-11-08 12:23:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 12:23:15,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:15,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:15,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 12:23:15,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:15,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:15,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2057122848, now seen corresponding path program 1 times [2024-11-08 12:23:15,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:15,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92921745] [2024-11-08 12:23:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:16,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:16,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92921745] [2024-11-08 12:23:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92921745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:16,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445008423] [2024-11-08 12:23:16,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:16,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:16,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:16,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:23:16,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 12:23:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:16,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 12:23:16,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:16,324 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:23:16,501 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:23:16,502 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:23:16,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:23:16,621 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:23:16,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:23:16,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:23:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:16,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:23:16,729 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-08 12:23:16,730 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 21 treesize of output 20 [2024-11-08 12:23:16,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-08 12:23:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445008423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:16,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:23:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-08 12:23:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792846162] [2024-11-08 12:23:16,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:23:16,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 12:23:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 12:23:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-08 12:23:16,755 INFO L87 Difference]: Start difference. First operand 1624 states and 2094 transitions. Second operand has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:23:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:19,690 INFO L93 Difference]: Finished difference Result 1623 states and 2092 transitions. [2024-11-08 12:23:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:23:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-08 12:23:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:19,695 INFO L225 Difference]: With dead ends: 1623 [2024-11-08 12:23:19,696 INFO L226 Difference]: Without dead ends: 1623 [2024-11-08 12:23:19,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-08 12:23:19,697 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 1224 mSDsluCounter, 6010 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 6783 SdHoareTripleChecker+Invalid, 4604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:19,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 6783 Invalid, 4604 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 12:23:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2024-11-08 12:23:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1623. [2024-11-08 12:23:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1238 states have (on average 1.6680129240710824) internal successors, (2065), 1610 states have internal predecessors, (2065), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 12:23:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2092 transitions. [2024-11-08 12:23:19,727 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2092 transitions. Word has length 88 [2024-11-08 12:23:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:19,727 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2092 transitions. [2024-11-08 12:23:19,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:23:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2092 transitions. [2024-11-08 12:23:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 12:23:19,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:19,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:19,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 12:23:19,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 12:23:19,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:19,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2057122847, now seen corresponding path program 1 times [2024-11-08 12:23:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:19,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314260738] [2024-11-08 12:23:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:20,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:20,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314260738] [2024-11-08 12:23:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314260738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253848920] [2024-11-08 12:23:20,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:20,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:20,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:23:20,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:23:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:21,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 12:23:21,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:21,274 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:23:21,419 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:23:21,419 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:23:21,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:23:21,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:23:21,700 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:23:21,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-08 12:23:21,708 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 49 treesize of output 30 [2024-11-08 12:23:21,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-08 12:23:21,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-08 12:23:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:21,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:23:21,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:23:21,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-08 12:23:22,034 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_prenex_1 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))) (forall ((v_ArrVal_627 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem50#1.base|)))) is different from false [2024-11-08 12:23:22,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253848920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:22,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:23:22,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-11-08 12:23:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109738001] [2024-11-08 12:23:22,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:23:22,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 12:23:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:22,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 12:23:22,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=399, Unknown=1, NotChecked=40, Total=506 [2024-11-08 12:23:22,040 INFO L87 Difference]: Start difference. First operand 1623 states and 2092 transitions. Second operand has 20 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:23:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:25,412 INFO L93 Difference]: Finished difference Result 1622 states and 2090 transitions. [2024-11-08 12:23:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:23:25,413 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2024-11-08 12:23:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:25,417 INFO L225 Difference]: With dead ends: 1622 [2024-11-08 12:23:25,417 INFO L226 Difference]: Without dead ends: 1622 [2024-11-08 12:23:25,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=596, Unknown=1, NotChecked=50, Total=756 [2024-11-08 12:23:25,418 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 1201 mSDsluCounter, 5607 mSDsCounter, 0 mSdLazyCounter, 4900 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 6379 SdHoareTripleChecker+Invalid, 4930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:25,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 6379 Invalid, 4930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4900 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 12:23:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-08 12:23:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1613. [2024-11-08 12:23:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1230 states have (on average 1.6699186991869919) internal successors, (2054), 1602 states have internal predecessors, (2054), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2072 transitions. [2024-11-08 12:23:25,448 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2072 transitions. Word has length 88 [2024-11-08 12:23:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:25,448 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2072 transitions. [2024-11-08 12:23:25,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:23:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2072 transitions. [2024-11-08 12:23:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 12:23:25,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:25,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:25,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 12:23:25,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 12:23:25,654 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:25,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1683520950, now seen corresponding path program 1 times [2024-11-08 12:23:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:25,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644719685] [2024-11-08 12:23:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:26,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:26,327 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:23:26,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:26,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644719685] [2024-11-08 12:23:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644719685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:26,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:26,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 12:23:26,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342278004] [2024-11-08 12:23:26,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:26,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:23:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:26,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:23:26,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:23:26,332 INFO L87 Difference]: Start difference. First operand 1613 states and 2072 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:29,197 INFO L93 Difference]: Finished difference Result 1629 states and 2098 transitions. [2024-11-08 12:23:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:23:29,198 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-08 12:23:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:29,201 INFO L225 Difference]: With dead ends: 1629 [2024-11-08 12:23:29,201 INFO L226 Difference]: Without dead ends: 1629 [2024-11-08 12:23:29,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-08 12:23:29,202 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 1253 mSDsluCounter, 6001 mSDsCounter, 0 mSdLazyCounter, 4596 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 6773 SdHoareTripleChecker+Invalid, 4617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:29,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 6773 Invalid, 4617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4596 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 12:23:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-08 12:23:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1628. [2024-11-08 12:23:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1244 states have (on average 1.664790996784566) internal successors, (2071), 1615 states have internal predecessors, (2071), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 12:23:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2098 transitions. [2024-11-08 12:23:29,227 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2098 transitions. Word has length 90 [2024-11-08 12:23:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:29,227 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2098 transitions. [2024-11-08 12:23:29,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2098 transitions. [2024-11-08 12:23:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 12:23:29,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:29,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:29,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 12:23:29,229 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:29,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1683520951, now seen corresponding path program 1 times [2024-11-08 12:23:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:29,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305206345] [2024-11-08 12:23:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:30,101 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:23:30,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:30,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305206345] [2024-11-08 12:23:30,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305206345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:30,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:30,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 12:23:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951682534] [2024-11-08 12:23:30,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:30,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 12:23:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:30,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 12:23:30,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 12:23:30,104 INFO L87 Difference]: Start difference. First operand 1628 states and 2098 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:32,865 INFO L93 Difference]: Finished difference Result 1628 states and 2096 transitions. [2024-11-08 12:23:32,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:23:32,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-08 12:23:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:32,868 INFO L225 Difference]: With dead ends: 1628 [2024-11-08 12:23:32,869 INFO L226 Difference]: Without dead ends: 1628 [2024-11-08 12:23:32,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-08 12:23:32,871 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1246 mSDsluCounter, 3983 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 4762 SdHoareTripleChecker+Invalid, 4088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:32,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 4762 Invalid, 4088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 12:23:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-11-08 12:23:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2024-11-08 12:23:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1244 states have (on average 1.6631832797427653) internal successors, (2069), 1615 states have internal predecessors, (2069), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 12:23:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2096 transitions. [2024-11-08 12:23:32,893 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2096 transitions. Word has length 90 [2024-11-08 12:23:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:32,893 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2096 transitions. [2024-11-08 12:23:32,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2096 transitions. [2024-11-08 12:23:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 12:23:32,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:32,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:32,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 12:23:32,895 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:32,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1142189607, now seen corresponding path program 1 times [2024-11-08 12:23:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:32,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86190305] [2024-11-08 12:23:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86190305] [2024-11-08 12:23:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86190305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073980322] [2024-11-08 12:23:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:33,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:33,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:33,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:23:33,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 12:23:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:33,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 12:23:33,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:33,830 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:23:33,957 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:23:33,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 12:23:33,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:23:34,074 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:23:34,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:23:34,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:23:34,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:23:34,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:23:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:34,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:23:34,190 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_883) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-08 12:23:34,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-08 12:23:34,248 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-08 12:23:34,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-08 12:23:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073980322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:34,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:23:34,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2024-11-08 12:23:34,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410250505] [2024-11-08 12:23:34,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:23:34,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 12:23:34,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:34,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 12:23:34,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=280, Unknown=13, NotChecked=70, Total=420 [2024-11-08 12:23:34,311 INFO L87 Difference]: Start difference. First operand 1628 states and 2096 transitions. Second operand has 18 states, 16 states have (on average 8.5) internal successors, (136), 17 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:23:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:36,682 INFO L93 Difference]: Finished difference Result 1627 states and 2094 transitions. [2024-11-08 12:23:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:23:36,682 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 17 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-11-08 12:23:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:36,686 INFO L225 Difference]: With dead ends: 1627 [2024-11-08 12:23:36,686 INFO L226 Difference]: Without dead ends: 1627 [2024-11-08 12:23:36,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=580, Unknown=14, NotChecked=102, Total=812 [2024-11-08 12:23:36,687 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 1222 mSDsluCounter, 4497 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 3602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:36,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 5269 Invalid, 3602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 12:23:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-08 12:23:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2024-11-08 12:23:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1244 states have (on average 1.6615755627009647) internal successors, (2067), 1614 states have internal predecessors, (2067), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 12:23:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2094 transitions. [2024-11-08 12:23:36,731 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2094 transitions. Word has length 91 [2024-11-08 12:23:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:36,732 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 2094 transitions. [2024-11-08 12:23:36,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 17 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:23:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2094 transitions. [2024-11-08 12:23:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 12:23:36,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:36,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:36,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 12:23:36,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:36,939 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:36,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:36,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1142189608, now seen corresponding path program 1 times [2024-11-08 12:23:36,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:36,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804682585] [2024-11-08 12:23:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:38,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:38,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804682585] [2024-11-08 12:23:38,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804682585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:38,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369639356] [2024-11-08 12:23:38,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:38,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:38,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:38,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:23:38,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 12:23:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:38,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 12:23:38,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:38,409 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:23:38,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:23:38,539 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:23:38,544 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 8 treesize of output 1 [2024-11-08 12:23:38,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:23:38,558 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 13 treesize of output 9 [2024-11-08 12:23:38,628 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 22 treesize of output 10 [2024-11-08 12:23:38,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:23:38,765 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:23:38,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:23:38,772 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 13 [2024-11-08 12:23:38,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:23:38,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:23:38,872 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 13 [2024-11-08 12:23:38,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:23:38,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:23:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:38,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:23:38,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1029 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 12:23:39,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1029 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-08 12:23:39,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) .cse1 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-08 12:23:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369639356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:39,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:23:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-08 12:23:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388398483] [2024-11-08 12:23:39,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:23:39,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 12:23:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 12:23:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=293, Unknown=3, NotChecked=108, Total=462 [2024-11-08 12:23:39,074 INFO L87 Difference]: Start difference. First operand 1627 states and 2094 transitions. Second operand has 17 states, 15 states have (on average 9.0) internal successors, (135), 16 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:23:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:44,480 INFO L93 Difference]: Finished difference Result 1634 states and 2100 transitions. [2024-11-08 12:23:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:23:44,480 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.0) internal successors, (135), 16 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-11-08 12:23:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:44,484 INFO L225 Difference]: With dead ends: 1634 [2024-11-08 12:23:44,484 INFO L226 Difference]: Without dead ends: 1634 [2024-11-08 12:23:44,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2024-11-08 12:23:44,485 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1201 mSDsluCounter, 6766 mSDsCounter, 0 mSdLazyCounter, 7513 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 7536 SdHoareTripleChecker+Invalid, 7537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:44,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 7536 Invalid, 7537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 7513 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-08 12:23:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-08 12:23:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1616. [2024-11-08 12:23:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1234 states have (on average 1.6653160453808753) internal successors, (2055), 1604 states have internal predecessors, (2055), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:23:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2073 transitions. [2024-11-08 12:23:44,507 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2073 transitions. Word has length 91 [2024-11-08 12:23:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:44,507 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2073 transitions. [2024-11-08 12:23:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.0) internal successors, (135), 16 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:23:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2073 transitions. [2024-11-08 12:23:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 12:23:44,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:44,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:44,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 12:23:44,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:44,715 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:44,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1440120760, now seen corresponding path program 1 times [2024-11-08 12:23:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908634363] [2024-11-08 12:23:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:45,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:45,460 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:23:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908634363] [2024-11-08 12:23:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908634363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:45,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:45,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 12:23:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811349001] [2024-11-08 12:23:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:45,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 12:23:45,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:45,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 12:23:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 12:23:45,463 INFO L87 Difference]: Start difference. First operand 1616 states and 2073 transitions. Second operand has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:48,495 INFO L93 Difference]: Finished difference Result 1641 states and 2108 transitions. [2024-11-08 12:23:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:23:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-08 12:23:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:48,499 INFO L225 Difference]: With dead ends: 1641 [2024-11-08 12:23:48,499 INFO L226 Difference]: Without dead ends: 1641 [2024-11-08 12:23:48,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-08 12:23:48,500 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 1188 mSDsluCounter, 6706 mSDsCounter, 0 mSdLazyCounter, 5108 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 7477 SdHoareTripleChecker+Invalid, 5128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:48,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 7477 Invalid, 5128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5108 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 12:23:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2024-11-08 12:23:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1637. [2024-11-08 12:23:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1254 states have (on average 1.657097288676236) internal successors, (2078), 1623 states have internal predecessors, (2078), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:23:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2098 transitions. [2024-11-08 12:23:48,523 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2098 transitions. Word has length 93 [2024-11-08 12:23:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:48,524 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2098 transitions. [2024-11-08 12:23:48,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2098 transitions. [2024-11-08 12:23:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 12:23:48,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:48,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:48,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 12:23:48,526 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:48,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1440120761, now seen corresponding path program 1 times [2024-11-08 12:23:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:48,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859522140] [2024-11-08 12:23:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:48,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:49,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:49,561 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:23:49,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859522140] [2024-11-08 12:23:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859522140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:49,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 12:23:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423036687] [2024-11-08 12:23:49,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:49,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 12:23:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:49,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 12:23:49,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 12:23:49,565 INFO L87 Difference]: Start difference. First operand 1637 states and 2098 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:53,015 INFO L93 Difference]: Finished difference Result 1640 states and 2106 transitions. [2024-11-08 12:23:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:23:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-08 12:23:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:53,022 INFO L225 Difference]: With dead ends: 1640 [2024-11-08 12:23:53,022 INFO L226 Difference]: Without dead ends: 1640 [2024-11-08 12:23:53,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-08 12:23:53,023 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1207 mSDsluCounter, 5124 mSDsCounter, 0 mSdLazyCounter, 5441 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 5902 SdHoareTripleChecker+Invalid, 5460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:53,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 5902 Invalid, 5460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5441 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 12:23:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-08 12:23:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1637. [2024-11-08 12:23:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1254 states have (on average 1.6555023923444976) internal successors, (2076), 1623 states have internal predecessors, (2076), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:23:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2096 transitions. [2024-11-08 12:23:53,046 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2096 transitions. Word has length 93 [2024-11-08 12:23:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:53,047 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2096 transitions. [2024-11-08 12:23:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:23:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2096 transitions. [2024-11-08 12:23:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 12:23:53,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:53,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:53,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 12:23:53,049 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:53,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:53,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2054689369, now seen corresponding path program 1 times [2024-11-08 12:23:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:53,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680358792] [2024-11-08 12:23:53,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:53,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:53,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680358792] [2024-11-08 12:23:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680358792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325823024] [2024-11-08 12:23:53,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:53,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:53,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:53,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:23:53,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 12:23:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:54,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 12:23:54,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:54,133 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:23:54,251 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:23:54,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 12:23:54,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:23:54,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:23:54,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:23:54,419 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:23:54,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:23:54,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:23:54,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:23:54,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:23:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:54,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:23:54,506 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1316) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-08 12:23:54,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 12:23:54,572 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 12:23:54,615 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-08 12:23:54,616 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 57 treesize of output 56 [2024-11-08 12:23:54,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1319))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1315)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 12:23:54,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325823024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:54,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:23:54,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-08 12:23:54,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151275004] [2024-11-08 12:23:54,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:23:54,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 12:23:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:54,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 12:23:54,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=353, Unknown=11, NotChecked=164, Total=600 [2024-11-08 12:23:54,627 INFO L87 Difference]: Start difference. First operand 1637 states and 2096 transitions. Second operand has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:23:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:58,021 INFO L93 Difference]: Finished difference Result 1639 states and 2104 transitions. [2024-11-08 12:23:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:23:58,022 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-11-08 12:23:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:58,025 INFO L225 Difference]: With dead ends: 1639 [2024-11-08 12:23:58,025 INFO L226 Difference]: Without dead ends: 1639 [2024-11-08 12:23:58,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=731, Unknown=11, NotChecked=236, Total=1122 [2024-11-08 12:23:58,025 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 1216 mSDsluCounter, 8245 mSDsCounter, 0 mSdLazyCounter, 6080 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 9016 SdHoareTripleChecker+Invalid, 6105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:58,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 9016 Invalid, 6105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6080 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 12:23:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-08 12:23:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1636. [2024-11-08 12:23:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1254 states have (on average 1.653907496012759) internal successors, (2074), 1622 states have internal predecessors, (2074), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:23:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2094 transitions. [2024-11-08 12:23:58,053 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2094 transitions. Word has length 94 [2024-11-08 12:23:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:58,053 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2094 transitions. [2024-11-08 12:23:58,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:23:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2094 transitions. [2024-11-08 12:23:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 12:23:58,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:58,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:58,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 12:23:58,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-08 12:23:58,256 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:23:58,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2054689368, now seen corresponding path program 1 times [2024-11-08 12:23:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:58,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131573254] [2024-11-08 12:23:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:23:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:59,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131573254] [2024-11-08 12:23:59,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131573254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:59,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44734969] [2024-11-08 12:23:59,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:59,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:59,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:59,352 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:23:59,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 12:23:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:59,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 12:23:59,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:59,673 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:23:59,787 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:23:59,798 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:23:59,798 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:23:59,829 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 13 treesize of output 9 [2024-11-08 12:23:59,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:23:59,928 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 22 treesize of output 10 [2024-11-08 12:23:59,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:24:00,052 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:00,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:24:00,059 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 13 [2024-11-08 12:24:00,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:00,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:24:00,167 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 13 [2024-11-08 12:24:00,254 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:00,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:24:00,262 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 13 [2024-11-08 12:24:00,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:24:00,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:24:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:24:00,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:24:00,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1474))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1475) .cse0 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1475) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1474) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-08 12:24:00,618 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1475) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1474) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1474))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1475) .cse2 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-08 12:24:00,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1482))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1483) .cse0 v_ArrVal_1475) (select (select (store .cse1 .cse0 v_ArrVal_1474) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1477))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1482))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1474))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1483) .cse3 v_ArrVal_1475) .cse4 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-08 12:24:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44734969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:00,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:24:00,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-11-08 12:24:00,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118860492] [2024-11-08 12:24:00,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:24:00,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 12:24:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:24:00,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 12:24:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=584, Unknown=29, NotChecked=156, Total=870 [2024-11-08 12:24:00,686 INFO L87 Difference]: Start difference. First operand 1636 states and 2094 transitions. Second operand has 23 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:24:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:07,358 INFO L93 Difference]: Finished difference Result 1638 states and 2102 transitions. [2024-11-08 12:24:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:24:07,359 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-08 12:24:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:07,361 INFO L225 Difference]: With dead ends: 1638 [2024-11-08 12:24:07,362 INFO L226 Difference]: Without dead ends: 1638 [2024-11-08 12:24:07,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=937, Unknown=30, NotChecked=198, Total=1332 [2024-11-08 12:24:07,363 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 1176 mSDsluCounter, 10026 mSDsCounter, 0 mSdLazyCounter, 10535 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 10802 SdHoareTripleChecker+Invalid, 10558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 10535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:07,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 10802 Invalid, 10558 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 10535 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-08 12:24:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2024-11-08 12:24:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1614. [2024-11-08 12:24:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1234 states have (on average 1.6620745542949757) internal successors, (2051), 1602 states have internal predecessors, (2051), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:24:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2069 transitions. [2024-11-08 12:24:07,384 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2069 transitions. Word has length 94 [2024-11-08 12:24:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:07,385 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2069 transitions. [2024-11-08 12:24:07,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:24:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2069 transitions. [2024-11-08 12:24:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 12:24:07,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:07,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:07,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 12:24:07,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-08 12:24:07,590 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:24:07,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:07,591 INFO L85 PathProgramCache]: Analyzing trace with hash 209863069, now seen corresponding path program 1 times [2024-11-08 12:24:07,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:07,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298531853] [2024-11-08 12:24:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:07,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:08,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:24:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:08,421 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:24:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:24:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298531853] [2024-11-08 12:24:08,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298531853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:24:08,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:24:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 12:24:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359004556] [2024-11-08 12:24:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:24:08,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 12:24:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:24:08,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 12:24:08,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 12:24:08,424 INFO L87 Difference]: Start difference. First operand 1614 states and 2069 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:10,901 INFO L93 Difference]: Finished difference Result 1645 states and 2110 transitions. [2024-11-08 12:24:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:24:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-08 12:24:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:10,904 INFO L225 Difference]: With dead ends: 1645 [2024-11-08 12:24:10,905 INFO L226 Difference]: Without dead ends: 1645 [2024-11-08 12:24:10,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-08 12:24:10,905 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1251 mSDsluCounter, 5251 mSDsCounter, 0 mSdLazyCounter, 4092 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 4112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:10,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 6021 Invalid, 4112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4092 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 12:24:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-08 12:24:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1641. [2024-11-08 12:24:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1260 states have (on average 1.6507936507936507) internal successors, (2080), 1627 states have internal predecessors, (2080), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:24:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2100 transitions. [2024-11-08 12:24:10,928 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2100 transitions. Word has length 96 [2024-11-08 12:24:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:10,929 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2100 transitions. [2024-11-08 12:24:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2100 transitions. [2024-11-08 12:24:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 12:24:10,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:10,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:10,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 12:24:10,931 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:24:10,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 209863070, now seen corresponding path program 1 times [2024-11-08 12:24:10,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:10,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614676119] [2024-11-08 12:24:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:10,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:24:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:12,048 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:24:12,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:24:12,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614676119] [2024-11-08 12:24:12,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614676119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:24:12,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:24:12,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 12:24:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314423585] [2024-11-08 12:24:12,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:24:12,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:24:12,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:24:12,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:24:12,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:24:12,050 INFO L87 Difference]: Start difference. First operand 1641 states and 2100 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:15,973 INFO L93 Difference]: Finished difference Result 1644 states and 2108 transitions. [2024-11-08 12:24:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:24:15,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-08 12:24:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:15,978 INFO L225 Difference]: With dead ends: 1644 [2024-11-08 12:24:15,978 INFO L226 Difference]: Without dead ends: 1644 [2024-11-08 12:24:15,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-08 12:24:15,979 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1187 mSDsluCounter, 5640 mSDsCounter, 0 mSdLazyCounter, 6130 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 6417 SdHoareTripleChecker+Invalid, 6154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:15,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 6417 Invalid, 6154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6130 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-08 12:24:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-08 12:24:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1641. [2024-11-08 12:24:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1260 states have (on average 1.6492063492063491) internal successors, (2078), 1627 states have internal predecessors, (2078), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:24:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2098 transitions. [2024-11-08 12:24:16,000 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2098 transitions. Word has length 96 [2024-11-08 12:24:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:16,001 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2098 transitions. [2024-11-08 12:24:16,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2098 transitions. [2024-11-08 12:24:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 12:24:16,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:16,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:16,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 12:24:16,002 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:24:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash 623532366, now seen corresponding path program 1 times [2024-11-08 12:24:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:16,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544772306] [2024-11-08 12:24:16,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:24:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:24:16,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:24:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544772306] [2024-11-08 12:24:16,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544772306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284978538] [2024-11-08 12:24:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:24:16,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:24:16,793 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:24:16,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 12:24:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:17,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 12:24:17,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:24:17,115 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:24:17,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:24:17,259 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:24:17,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:24:17,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:17,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:24:17,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:17,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:24:17,487 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:17,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:24:17,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:17,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:24:17,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:24:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:24:17,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:24:17,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-08 12:24:17,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 12:24:17,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 12:24:17,633 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 12:24:17,733 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-08 12:24:17,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-08 12:24:17,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284978538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:17,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:24:17,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2024-11-08 12:24:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804317418] [2024-11-08 12:24:17,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:24:17,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 12:24:17,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:24:17,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 12:24:17,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=544, Unknown=23, NotChecked=204, Total=870 [2024-11-08 12:24:17,806 INFO L87 Difference]: Start difference. First operand 1641 states and 2098 transitions. Second operand has 23 states, 20 states have (on average 7.35) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:24:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:21,115 INFO L93 Difference]: Finished difference Result 1643 states and 2106 transitions. [2024-11-08 12:24:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:24:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.35) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-08 12:24:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:21,119 INFO L225 Difference]: With dead ends: 1643 [2024-11-08 12:24:21,119 INFO L226 Difference]: Without dead ends: 1643 [2024-11-08 12:24:21,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=1061, Unknown=23, NotChecked=284, Total=1560 [2024-11-08 12:24:21,120 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1172 mSDsluCounter, 7453 mSDsCounter, 0 mSdLazyCounter, 5581 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 8223 SdHoareTripleChecker+Invalid, 5603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:21,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 8223 Invalid, 5603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5581 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 12:24:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-11-08 12:24:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1640. [2024-11-08 12:24:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1260 states have (on average 1.6476190476190475) internal successors, (2076), 1626 states have internal predecessors, (2076), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:24:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2096 transitions. [2024-11-08 12:24:21,144 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2096 transitions. Word has length 97 [2024-11-08 12:24:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:21,144 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2096 transitions. [2024-11-08 12:24:21,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.35) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:24:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2096 transitions. [2024-11-08 12:24:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 12:24:21,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:21,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:21,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 12:24:21,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 12:24:21,347 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:24:21,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 623532367, now seen corresponding path program 1 times [2024-11-08 12:24:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216787024] [2024-11-08 12:24:21,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:24:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:24:22,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:24:22,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216787024] [2024-11-08 12:24:22,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216787024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:22,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383042123] [2024-11-08 12:24:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:22,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:24:22,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:24:22,443 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:24:22,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 12:24:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:22,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 12:24:22,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:24:22,779 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:24:22,898 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:24:22,907 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:24:22,907 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:24:22,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:24:22,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 12:24:23,037 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 22 treesize of output 10 [2024-11-08 12:24:23,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:24:23,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:23,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:24:23,185 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 13 [2024-11-08 12:24:23,284 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:23,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:24:23,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 12:24:23,356 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:23,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:24:23,360 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 13 [2024-11-08 12:24:23,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:23,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:24:23,428 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 13 [2024-11-08 12:24:23,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:24:23,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:24:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:24:23,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:24:23,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1962 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-08 12:24:23,653 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1960))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1961) .cse0 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1961) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-08 12:24:23,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1961) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1960))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1961) .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-08 12:24:23,699 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1959))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1958) .cse0 v_ArrVal_1961) (select (select (store .cse1 .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1962))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1959))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1960))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1958) .cse3 v_ArrVal_1961) .cse4 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-08 12:24:23,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1959))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1960))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1958) .cse1 v_ArrVal_1961) .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1959))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1958) .cse6 v_ArrVal_1961) (select (select (store .cse7 .cse6 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1962))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2024-11-08 12:24:23,812 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1968 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1969))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1959))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1960))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1968) .cse0 v_ArrVal_1958) .cse1 v_ArrVal_1961) .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1968 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1969))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1959))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1968) .cse7 v_ArrVal_1958) .cse8 v_ArrVal_1961) (select (select (store .cse9 .cse8 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1962))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-08 12:24:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383042123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:23,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:24:23,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-08 12:24:23,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303883187] [2024-11-08 12:24:23,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:24:23,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 12:24:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:24:23,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 12:24:23,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=652, Unknown=20, NotChecked=342, Total=1122 [2024-11-08 12:24:23,817 INFO L87 Difference]: Start difference. First operand 1640 states and 2096 transitions. Second operand has 25 states, 22 states have (on average 7.045454545454546) internal successors, (155), 24 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:24:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:30,668 INFO L93 Difference]: Finished difference Result 1642 states and 2104 transitions. [2024-11-08 12:24:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:24:30,668 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.045454545454546) internal successors, (155), 24 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-08 12:24:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:30,670 INFO L225 Difference]: With dead ends: 1642 [2024-11-08 12:24:30,670 INFO L226 Difference]: Without dead ends: 1642 [2024-11-08 12:24:30,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1085, Unknown=20, NotChecked=438, Total=1722 [2024-11-08 12:24:30,671 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1175 mSDsluCounter, 9256 mSDsCounter, 0 mSdLazyCounter, 10030 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 10031 SdHoareTripleChecker+Invalid, 10052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 10030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:30,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 10031 Invalid, 10052 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 10030 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-08 12:24:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2024-11-08 12:24:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1612. [2024-11-08 12:24:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1234 states have (on average 1.6588330632090762) internal successors, (2047), 1600 states have internal predecessors, (2047), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:24:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2065 transitions. [2024-11-08 12:24:30,689 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2065 transitions. Word has length 97 [2024-11-08 12:24:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:30,690 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2065 transitions. [2024-11-08 12:24:30,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.045454545454546) internal successors, (155), 24 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:24:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2065 transitions. [2024-11-08 12:24:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 12:24:30,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:30,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:30,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 12:24:30,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-08 12:24:30,892 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:24:30,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1723365985, now seen corresponding path program 1 times [2024-11-08 12:24:30,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:30,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692245825] [2024-11-08 12:24:30,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:30,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:24:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:31,909 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:24:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:24:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692245825] [2024-11-08 12:24:31,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692245825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:24:31,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:24:31,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 12:24:31,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335920817] [2024-11-08 12:24:31,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:24:31,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 12:24:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:24:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 12:24:31,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-08 12:24:31,912 INFO L87 Difference]: Start difference. First operand 1612 states and 2065 transitions. Second operand has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:34,867 INFO L93 Difference]: Finished difference Result 1651 states and 2114 transitions. [2024-11-08 12:24:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:24:34,867 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-08 12:24:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:34,869 INFO L225 Difference]: With dead ends: 1651 [2024-11-08 12:24:34,869 INFO L226 Difference]: Without dead ends: 1651 [2024-11-08 12:24:34,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-08 12:24:34,870 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1213 mSDsluCounter, 5963 mSDsCounter, 0 mSdLazyCounter, 4590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 6738 SdHoareTripleChecker+Invalid, 4617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:34,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 6738 Invalid, 4617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4590 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 12:24:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2024-11-08 12:24:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1647. [2024-11-08 12:24:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1268 states have (on average 1.6435331230283912) internal successors, (2084), 1633 states have internal predecessors, (2084), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:24:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2104 transitions. [2024-11-08 12:24:34,893 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2104 transitions. Word has length 100 [2024-11-08 12:24:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:34,893 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2104 transitions. [2024-11-08 12:24:34,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2104 transitions. [2024-11-08 12:24:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 12:24:34,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:34,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:34,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 12:24:34,895 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:24:34,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1723365984, now seen corresponding path program 1 times [2024-11-08 12:24:34,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:34,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441639639] [2024-11-08 12:24:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:36,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:24:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:36,390 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:24:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:24:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441639639] [2024-11-08 12:24:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441639639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:24:36,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:24:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 12:24:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579071145] [2024-11-08 12:24:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:24:36,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 12:24:36,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:24:36,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 12:24:36,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-08 12:24:36,392 INFO L87 Difference]: Start difference. First operand 1647 states and 2104 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:40,959 INFO L93 Difference]: Finished difference Result 1650 states and 2112 transitions. [2024-11-08 12:24:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:24:40,960 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-08 12:24:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:40,962 INFO L225 Difference]: With dead ends: 1650 [2024-11-08 12:24:40,962 INFO L226 Difference]: Without dead ends: 1650 [2024-11-08 12:24:40,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-08 12:24:40,963 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1209 mSDsluCounter, 6238 mSDsCounter, 0 mSdLazyCounter, 6881 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 7008 SdHoareTripleChecker+Invalid, 6904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:40,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 7008 Invalid, 6904 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6881 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 12:24:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-11-08 12:24:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1647. [2024-11-08 12:24:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1268 states have (on average 1.6419558359621451) internal successors, (2082), 1633 states have internal predecessors, (2082), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:24:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2102 transitions. [2024-11-08 12:24:40,983 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2102 transitions. Word has length 100 [2024-11-08 12:24:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:40,984 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2102 transitions. [2024-11-08 12:24:40,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2102 transitions. [2024-11-08 12:24:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 12:24:40,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:40,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:40,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 12:24:40,985 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:24:40,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1808424144, now seen corresponding path program 1 times [2024-11-08 12:24:40,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:40,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089292571] [2024-11-08 12:24:40,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:42,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:24:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:24:42,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:24:42,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089292571] [2024-11-08 12:24:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089292571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:42,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124373912] [2024-11-08 12:24:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:42,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:24:42,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:24:42,139 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:24:42,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 12:24:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:42,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 12:24:42,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:24:42,548 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:24:42,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:24:42,667 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:24:42,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:24:42,765 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:42,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:24:42,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:42,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:24:42,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:42,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:24:42,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:42,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:24:42,971 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:42,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:24:42,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:24:43,013 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 12:24:43,014 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:24:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:24:43,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:24:43,822 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-08 12:24:43,823 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 597 treesize of output 794 [2024-11-08 12:24:43,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2307 (Array Int Int)) (v_ArrVal_2306 (Array Int Int)) (v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2311))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2304)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2305)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2306)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2307)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-08 12:24:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124373912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:43,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:24:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 21 [2024-11-08 12:24:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640076427] [2024-11-08 12:24:43,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:24:43,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 12:24:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:24:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 12:24:43,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=813, Unknown=45, NotChecked=60, Total=1056 [2024-11-08 12:24:43,847 INFO L87 Difference]: Start difference. First operand 1647 states and 2102 transitions. Second operand has 22 states, 20 states have (on average 7.25) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:48,600 INFO L93 Difference]: Finished difference Result 1649 states and 2110 transitions. [2024-11-08 12:24:48,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 12:24:48,601 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.25) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-08 12:24:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:48,602 INFO L225 Difference]: With dead ends: 1649 [2024-11-08 12:24:48,602 INFO L226 Difference]: Without dead ends: 1649 [2024-11-08 12:24:48,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=1502, Unknown=45, NotChecked=82, Total=1892 [2024-11-08 12:24:48,603 INFO L432 NwaCegarLoop]: 769 mSDtfsCounter, 1213 mSDsluCounter, 10449 mSDsCounter, 0 mSdLazyCounter, 7583 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 11218 SdHoareTripleChecker+Invalid, 7604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 7583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:48,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 11218 Invalid, 7604 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 7583 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-08 12:24:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2024-11-08 12:24:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1646. [2024-11-08 12:24:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1268 states have (on average 1.640378548895899) internal successors, (2080), 1632 states have internal predecessors, (2080), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:24:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2100 transitions. [2024-11-08 12:24:48,621 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2100 transitions. Word has length 101 [2024-11-08 12:24:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:48,622 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 2100 transitions. [2024-11-08 12:24:48,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.25) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:24:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2100 transitions. [2024-11-08 12:24:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 12:24:48,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:48,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:48,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 12:24:48,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:24:48,827 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:24:48,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1808424145, now seen corresponding path program 1 times [2024-11-08 12:24:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545089646] [2024-11-08 12:24:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:50,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:24:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:24:50,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:24:50,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545089646] [2024-11-08 12:24:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545089646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56841656] [2024-11-08 12:24:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:50,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:24:50,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:24:50,276 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:24:50,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 12:24:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:50,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 12:24:50,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:24:50,646 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:24:50,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:24:50,762 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:24:50,769 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 8 treesize of output 1 [2024-11-08 12:24:50,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:24:50,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 12:24:50,834 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 22 treesize of output 10 [2024-11-08 12:24:50,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:24:51,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:51,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:24:51,042 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 13 [2024-11-08 12:24:51,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:51,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:24:51,147 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 13 [2024-11-08 12:24:51,251 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:51,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:24:51,263 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 13 [2024-11-08 12:24:51,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:51,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:24:51,368 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 13 [2024-11-08 12:24:51,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:24:51,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:24:51,493 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 13 [2024-11-08 12:24:51,520 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 42 treesize of output 18 [2024-11-08 12:24:51,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:24:51,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:51,542 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 14 treesize of output 9 [2024-11-08 12:24:51,551 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:24:51,551 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:24:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:24:51,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:24:58,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2502 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2494))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2496))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2498))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2495) .cse0 v_ArrVal_2497) .cse1 v_ArrVal_2499) .cse2 v_ArrVal_2501) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2502) (select (select (store .cse4 .cse2 v_ArrVal_2500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (or (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (< 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2494))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2496))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2495) .cse7 v_ArrVal_2497) .cse8 v_ArrVal_2499) (select (select (store .cse9 .cse8 v_ArrVal_2498) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2501))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false [2024-11-08 12:25:06,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:25:06,354 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 604 treesize of output 622 [2024-11-08 12:25:07,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2502 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2507))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2494))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2496))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2498))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2508) .cse0 v_ArrVal_2495) .cse1 v_ArrVal_2497) .cse2 v_ArrVal_2499) .cse3 v_ArrVal_2501) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2502) (select (select (store .cse5 .cse3 v_ArrVal_2500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_24))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_22))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_25) .cse9 v_prenex_23) .cse10 v_prenex_21) .cse11 v_prenex_18) (select (select (store .cse12 .cse11 v_prenex_19) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_17))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-08 12:25:07,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56841656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:25:07,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:25:07,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2024-11-08 12:25:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748781282] [2024-11-08 12:25:07,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:25:07,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 12:25:07,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:25:07,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 12:25:07,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1049, Unknown=59, NotChecked=138, Total=1406 [2024-11-08 12:25:07,200 INFO L87 Difference]: Start difference. First operand 1646 states and 2100 transitions. Second operand has 26 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:25:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:25:43,827 INFO L93 Difference]: Finished difference Result 1648 states and 2108 transitions. [2024-11-08 12:25:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:25:43,828 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2024-11-08 12:25:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:25:43,830 INFO L225 Difference]: With dead ends: 1648 [2024-11-08 12:25:43,830 INFO L226 Difference]: Without dead ends: 1648 [2024-11-08 12:25:43,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=305, Invalid=2090, Unknown=63, NotChecked=194, Total=2652 [2024-11-08 12:25:43,832 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 1216 mSDsluCounter, 7174 mSDsCounter, 0 mSdLazyCounter, 8390 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 7941 SdHoareTripleChecker+Invalid, 8414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:25:43,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 7941 Invalid, 8414 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 8390 Invalid, 0 Unknown, 0 Unchecked, 34.2s Time] [2024-11-08 12:25:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-08 12:25:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1610. [2024-11-08 12:25:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1234 states have (on average 1.6555915721231766) internal successors, (2043), 1598 states have internal predecessors, (2043), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:25:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2061 transitions. [2024-11-08 12:25:43,857 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2061 transitions. Word has length 101 [2024-11-08 12:25:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:25:43,858 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2061 transitions. [2024-11-08 12:25:43,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 12:25:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2061 transitions. [2024-11-08 12:25:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 12:25:43,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:25:43,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:25:43,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 12:25:44,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:25:44,062 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:25:44,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:25:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1243633797, now seen corresponding path program 1 times [2024-11-08 12:25:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:25:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964513432] [2024-11-08 12:25:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:25:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:25:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:25:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:25:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:25:45,809 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:25:45,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:25:45,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964513432] [2024-11-08 12:25:45,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964513432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:25:45,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:25:45,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 12:25:45,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108205544] [2024-11-08 12:25:45,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:25:45,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 12:25:45,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:25:45,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 12:25:45,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-08 12:25:45,812 INFO L87 Difference]: Start difference. First operand 1610 states and 2061 transitions. Second operand has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:26:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:26:10,447 INFO L93 Difference]: Finished difference Result 1655 states and 2116 transitions. [2024-11-08 12:26:10,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:26:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-08 12:26:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:26:10,450 INFO L225 Difference]: With dead ends: 1655 [2024-11-08 12:26:10,450 INFO L226 Difference]: Without dead ends: 1655 [2024-11-08 12:26:10,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-08 12:26:10,451 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 1252 mSDsluCounter, 8240 mSDsCounter, 0 mSdLazyCounter, 6049 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 9014 SdHoareTripleChecker+Invalid, 6074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2024-11-08 12:26:10,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 9014 Invalid, 6074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 6049 Invalid, 0 Unknown, 0 Unchecked, 23.9s Time] [2024-11-08 12:26:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-11-08 12:26:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1651. [2024-11-08 12:26:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1274 states have (on average 1.6373626373626373) internal successors, (2086), 1637 states have internal predecessors, (2086), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:26:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2106 transitions. [2024-11-08 12:26:10,477 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2106 transitions. Word has length 103 [2024-11-08 12:26:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:26:10,477 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2106 transitions. [2024-11-08 12:26:10,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:26:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2106 transitions. [2024-11-08 12:26:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 12:26:10,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:26:10,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:26:10,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 12:26:10,480 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:26:10,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:26:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1243633798, now seen corresponding path program 1 times [2024-11-08 12:26:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:26:10,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495615035] [2024-11-08 12:26:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:26:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:26:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:26:13,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:26:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:26:13,788 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:26:13,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:26:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495615035] [2024-11-08 12:26:13,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495615035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:26:13,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:26:13,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 12:26:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586724581] [2024-11-08 12:26:13,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:26:13,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 12:26:13,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:26:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 12:26:13,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 12:26:13,790 INFO L87 Difference]: Start difference. First operand 1651 states and 2106 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:26:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:26:41,906 INFO L93 Difference]: Finished difference Result 1654 states and 2114 transitions. [2024-11-08 12:26:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 12:26:41,907 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-08 12:26:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:26:41,909 INFO L225 Difference]: With dead ends: 1654 [2024-11-08 12:26:41,909 INFO L226 Difference]: Without dead ends: 1654 [2024-11-08 12:26:41,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-08 12:26:41,909 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 1209 mSDsluCounter, 5494 mSDsCounter, 0 mSdLazyCounter, 6372 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 6262 SdHoareTripleChecker+Invalid, 6395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:26:41,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 6262 Invalid, 6395 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6372 Invalid, 0 Unknown, 0 Unchecked, 26.6s Time] [2024-11-08 12:26:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2024-11-08 12:26:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1651. [2024-11-08 12:26:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1274 states have (on average 1.6357927786499216) internal successors, (2084), 1637 states have internal predecessors, (2084), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:26:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2104 transitions. [2024-11-08 12:26:41,928 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2104 transitions. Word has length 103 [2024-11-08 12:26:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:26:41,928 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2104 transitions. [2024-11-08 12:26:41,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:26:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2104 transitions. [2024-11-08 12:26:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 12:26:41,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:26:41,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:26:41,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 12:26:41,930 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:26:41,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:26:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1305450572, now seen corresponding path program 1 times [2024-11-08 12:26:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:26:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981082530] [2024-11-08 12:26:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:26:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:26:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:26:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:26:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:26:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:26:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:26:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981082530] [2024-11-08 12:26:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981082530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:26:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:26:42,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 12:26:42,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71879302] [2024-11-08 12:26:42,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:26:42,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 12:26:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:26:42,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 12:26:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:26:42,844 INFO L87 Difference]: Start difference. First operand 1651 states and 2104 transitions. Second operand has 7 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:26:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:26:48,454 INFO L93 Difference]: Finished difference Result 1653 states and 2112 transitions. [2024-11-08 12:26:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:26:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2024-11-08 12:26:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:26:48,458 INFO L225 Difference]: With dead ends: 1653 [2024-11-08 12:26:48,458 INFO L226 Difference]: Without dead ends: 1653 [2024-11-08 12:26:48,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 12:26:48,459 INFO L432 NwaCegarLoop]: 1250 mSDtfsCounter, 6 mSDsluCounter, 3501 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4751 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-08 12:26:48,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4751 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-08 12:26:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-11-08 12:26:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1650. [2024-11-08 12:26:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1274 states have (on average 1.6342229199372056) internal successors, (2082), 1636 states have internal predecessors, (2082), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:26:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2102 transitions. [2024-11-08 12:26:48,477 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2102 transitions. Word has length 104 [2024-11-08 12:26:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:26:48,478 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2102 transitions. [2024-11-08 12:26:48,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:26:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2102 transitions. [2024-11-08 12:26:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 12:26:48,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:26:48,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:26:48,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 12:26:48,479 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:26:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:26:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1305450571, now seen corresponding path program 1 times [2024-11-08 12:26:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:26:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255084072] [2024-11-08 12:26:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:26:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:26:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:26:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:26:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:26:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:26:51,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:26:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255084072] [2024-11-08 12:26:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255084072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:26:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238472039] [2024-11-08 12:26:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:26:51,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:26:51,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:26:51,747 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:26:51,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 12:26:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:26:52,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-08 12:26:52,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:26:52,134 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:26:52,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:26:52,717 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:26:52,743 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 8 treesize of output 1 [2024-11-08 12:26:52,874 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 13 treesize of output 9 [2024-11-08 12:26:52,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:26:53,262 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 22 treesize of output 10 [2024-11-08 12:26:53,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:26:53,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:26:53,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:26:53,990 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 13 [2024-11-08 12:26:54,454 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:26:54,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:26:54,471 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 13 [2024-11-08 12:26:54,794 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:26:54,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:26:54,804 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 13 [2024-11-08 12:26:55,168 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:26:55,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:26:55,178 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 13 [2024-11-08 12:26:55,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:26:55,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 12:26:55,558 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 13 [2024-11-08 12:26:55,997 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-08 12:26:55,997 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 17 treesize of output 17 [2024-11-08 12:26:56,067 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-08 12:26:56,067 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 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-08 12:26:56,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:26:56,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 12:26:56,328 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 13 [2024-11-08 12:26:56,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:26:56,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 12:26:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:26:56,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:26:56,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2976 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 12:26:58,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2971))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2972) .cse0 v_ArrVal_2974) (select (select (store .cse1 .cse0 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2976))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 40)))) (forall ((v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2971))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2973))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2972) .cse3 v_ArrVal_2974) .cse4 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse5 .cse4 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-08 12:26:58,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2969))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2971))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2970) .cse0 v_ArrVal_2972) .cse1 v_ArrVal_2974) (select (select (store .cse2 .cse1 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2976))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 40)))) (forall ((v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2969))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2971))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2973))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2970) .cse5 v_ArrVal_2972) .cse6 v_ArrVal_2974) .cse7 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse8 .cse7 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-08 12:27:06,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2967))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2969))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2971))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2968) .cse1 v_ArrVal_2970) .cse2 v_ArrVal_2972) .cse3 v_ArrVal_2974) (select (select (store .cse4 .cse3 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_2976))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2967))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_2969))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2971))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2973))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2968) .cse8 v_ArrVal_2970) .cse9 v_ArrVal_2972) .cse10 v_ArrVal_2974) .cse11 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse12 .cse11 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-08 12:27:06,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:27:06,829 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 1180 treesize of output 1198 [2024-11-08 12:27:11,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_37 Int)) (or (forall ((v_ArrVal_2977 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2975 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_34))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_prenex_28))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_prenex_38))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_prenex_35))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_prenex_31))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_32) .cse0 v_prenex_27) .cse1 v_prenex_36) .cse2 v_prenex_33) .cse3 v_prenex_30) .cse4 v_prenex_29) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| v_prenex_37 v_ArrVal_2975) (select (select (store .cse6 .cse4 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_37))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2982))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_2967))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_2969))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_2971))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2983) .cse11 v_ArrVal_2968) .cse12 v_ArrVal_2970) .cse13 v_ArrVal_2972) .cse14 v_ArrVal_2974) (select (select (store .cse15 .cse14 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_2976))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))) is different from false [2024-11-08 12:27:11,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238472039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:27:11,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:27:11,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2024-11-08 12:27:11,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286828767] [2024-11-08 12:27:11,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:27:11,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 12:27:11,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:27:11,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 12:27:11,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1552, Unknown=40, NotChecked=430, Total=2256 [2024-11-08 12:27:11,578 INFO L87 Difference]: Start difference. First operand 1650 states and 2102 transitions. Second operand has 34 states, 31 states have (on average 5.451612903225806) internal successors, (169), 32 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:28:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:28:03,312 INFO L93 Difference]: Finished difference Result 1652 states and 2110 transitions. [2024-11-08 12:28:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:28:03,313 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.451612903225806) internal successors, (169), 32 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-08 12:28:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:28:03,315 INFO L225 Difference]: With dead ends: 1652 [2024-11-08 12:28:03,315 INFO L226 Difference]: Without dead ends: 1652 [2024-11-08 12:28:03,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=415, Invalid=2757, Unknown=40, NotChecked=570, Total=3782 [2024-11-08 12:28:03,316 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 1219 mSDsluCounter, 7407 mSDsCounter, 0 mSdLazyCounter, 8240 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 8174 SdHoareTripleChecker+Invalid, 8271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:28:03,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 8174 Invalid, 8271 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 8240 Invalid, 0 Unknown, 0 Unchecked, 48.3s Time] [2024-11-08 12:28:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2024-11-08 12:28:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1608. [2024-11-08 12:28:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1234 states have (on average 1.652350081037277) internal successors, (2039), 1596 states have internal predecessors, (2039), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:28:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2057 transitions. [2024-11-08 12:28:03,341 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2057 transitions. Word has length 104 [2024-11-08 12:28:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:28:03,341 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2057 transitions. [2024-11-08 12:28:03,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.451612903225806) internal successors, (169), 32 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:28:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2057 transitions. [2024-11-08 12:28:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 12:28:03,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:28:03,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:28:03,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 12:28:03,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:28:03,544 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:28:03,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:28:03,545 INFO L85 PathProgramCache]: Analyzing trace with hash 707194630, now seen corresponding path program 1 times [2024-11-08 12:28:03,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:28:03,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016345762] [2024-11-08 12:28:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:28:03,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:28:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:28:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:28:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:28:06,530 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:28:06,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:28:06,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016345762] [2024-11-08 12:28:06,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016345762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:28:06,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:28:06,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 12:28:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979206363] [2024-11-08 12:28:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:28:06,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 12:28:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:28:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 12:28:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 12:28:06,536 INFO L87 Difference]: Start difference. First operand 1608 states and 2057 transitions. Second operand has 18 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:28:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:28:39,157 INFO L93 Difference]: Finished difference Result 1693 states and 2166 transitions. [2024-11-08 12:28:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:28:39,158 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-08 12:28:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:28:39,160 INFO L225 Difference]: With dead ends: 1693 [2024-11-08 12:28:39,160 INFO L226 Difference]: Without dead ends: 1693 [2024-11-08 12:28:39,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-08 12:28:39,160 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 1268 mSDsluCounter, 6051 mSDsCounter, 0 mSdLazyCounter, 4742 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 6831 SdHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:28:39,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 6831 Invalid, 4773 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 4742 Invalid, 0 Unknown, 0 Unchecked, 31.1s Time] [2024-11-08 12:28:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2024-11-08 12:28:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1655. [2024-11-08 12:28:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1280 states have (on average 1.63125) internal successors, (2088), 1641 states have internal predecessors, (2088), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:28:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2108 transitions. [2024-11-08 12:28:39,186 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2108 transitions. Word has length 106 [2024-11-08 12:28:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:28:39,187 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2108 transitions. [2024-11-08 12:28:39,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:28:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2108 transitions. [2024-11-08 12:28:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 12:28:39,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:28:39,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:28:39,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 12:28:39,189 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:28:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:28:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash 707194631, now seen corresponding path program 1 times [2024-11-08 12:28:39,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:28:39,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805824441] [2024-11-08 12:28:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:28:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:28:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:28:43,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:28:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:28:43,376 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:28:43,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:28:43,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805824441] [2024-11-08 12:28:43,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805824441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:28:43,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:28:43,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 12:28:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834660290] [2024-11-08 12:28:43,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:28:43,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 12:28:43,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:28:43,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 12:28:43,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 12:28:43,378 INFO L87 Difference]: Start difference. First operand 1655 states and 2108 transitions. Second operand has 11 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:29:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:29:05,817 INFO L93 Difference]: Finished difference Result 1679 states and 2142 transitions. [2024-11-08 12:29:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:29:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-08 12:29:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:29:05,819 INFO L225 Difference]: With dead ends: 1679 [2024-11-08 12:29:05,819 INFO L226 Difference]: Without dead ends: 1679 [2024-11-08 12:29:05,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-08 12:29:05,819 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 2348 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 3553 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2356 SdHoareTripleChecker+Valid, 4022 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:29:05,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2356 Valid, 4022 Invalid, 3582 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 3553 Invalid, 0 Unknown, 0 Unchecked, 21.3s Time] [2024-11-08 12:29:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2024-11-08 12:29:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1654. [2024-11-08 12:29:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1280 states have (on average 1.628125) internal successors, (2084), 1640 states have internal predecessors, (2084), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:29:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2104 transitions. [2024-11-08 12:29:05,833 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2104 transitions. Word has length 106 [2024-11-08 12:29:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:29:05,833 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2104 transitions. [2024-11-08 12:29:05,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:29:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2104 transitions. [2024-11-08 12:29:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 12:29:05,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:29:05,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:29:05,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 12:29:05,835 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:29:05,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:29:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash 251518327, now seen corresponding path program 1 times [2024-11-08 12:29:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:29:05,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635229881] [2024-11-08 12:29:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:29:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:29:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:29:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:29:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:29:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:29:10,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:29:10,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635229881] [2024-11-08 12:29:10,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635229881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:29:10,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:29:10,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 12:29:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550759749] [2024-11-08 12:29:10,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:29:10,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 12:29:10,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:29:10,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 12:29:10,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-08 12:29:10,583 INFO L87 Difference]: Start difference. First operand 1654 states and 2104 transitions. Second operand has 16 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:29:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:29:50,900 INFO L93 Difference]: Finished difference Result 1678 states and 2140 transitions. [2024-11-08 12:29:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:29:50,901 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-08 12:29:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:29:50,904 INFO L225 Difference]: With dead ends: 1678 [2024-11-08 12:29:50,904 INFO L226 Difference]: Without dead ends: 1678 [2024-11-08 12:29:50,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2024-11-08 12:29:50,905 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 2401 mSDsluCounter, 8199 mSDsCounter, 0 mSdLazyCounter, 6026 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 8974 SdHoareTripleChecker+Invalid, 6058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 6026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:29:50,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 8974 Invalid, 6058 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 6026 Invalid, 0 Unknown, 0 Unchecked, 38.6s Time] [2024-11-08 12:29:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2024-11-08 12:29:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1606. [2024-11-08 12:29:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1234 states have (on average 1.6491085899513775) internal successors, (2035), 1594 states have internal predecessors, (2035), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:29:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2053 transitions. [2024-11-08 12:29:50,928 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2053 transitions. Word has length 107 [2024-11-08 12:29:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:29:50,928 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2053 transitions. [2024-11-08 12:29:50,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:29:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2053 transitions. [2024-11-08 12:29:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 12:29:50,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:29:50,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:29:50,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 12:29:50,930 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:29:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:29:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1221298810, now seen corresponding path program 1 times [2024-11-08 12:29:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:29:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512494390] [2024-11-08 12:29:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:29:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:29:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:29:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:29:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:29:55,190 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:29:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:29:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512494390] [2024-11-08 12:29:55,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512494390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:29:55,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:29:55,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 12:29:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47844783] [2024-11-08 12:29:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:29:55,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 12:29:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:29:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 12:29:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-08 12:29:55,192 INFO L87 Difference]: Start difference. First operand 1606 states and 2053 transitions. Second operand has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:30:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:30:33,389 INFO L93 Difference]: Finished difference Result 1689 states and 2158 transitions. [2024-11-08 12:30:33,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:30:33,389 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-08 12:30:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:30:33,391 INFO L225 Difference]: With dead ends: 1689 [2024-11-08 12:30:33,392 INFO L226 Difference]: Without dead ends: 1689 [2024-11-08 12:30:33,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-08 12:30:33,392 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 1290 mSDsluCounter, 6240 mSDsCounter, 0 mSdLazyCounter, 5766 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 7016 SdHoareTripleChecker+Invalid, 5796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.4s IncrementalHoareTripleChecker+Time [2024-11-08 12:30:33,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 7016 Invalid, 5796 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 5766 Invalid, 0 Unknown, 0 Unchecked, 36.4s Time] [2024-11-08 12:30:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2024-11-08 12:30:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1659. [2024-11-08 12:30:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1286 states have (on average 1.625194401244168) internal successors, (2090), 1645 states have internal predecessors, (2090), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:30:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2110 transitions. [2024-11-08 12:30:33,428 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2110 transitions. Word has length 109 [2024-11-08 12:30:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:30:33,429 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2110 transitions. [2024-11-08 12:30:33,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:30:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2110 transitions. [2024-11-08 12:30:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 12:30:33,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:30:33,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:30:33,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 12:30:33,431 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:30:33,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:30:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1221298809, now seen corresponding path program 1 times [2024-11-08 12:30:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:30:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258107358] [2024-11-08 12:30:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:30:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:30:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:30:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:30:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:30:33,809 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:30:33,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:30:33,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258107358] [2024-11-08 12:30:33,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258107358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:30:33,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:30:33,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:30:33,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270710852] [2024-11-08 12:30:33,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:30:33,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:30:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:30:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:30:33,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:30:33,811 INFO L87 Difference]: Start difference. First operand 1659 states and 2110 transitions. Second operand has 6 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:30:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:30:43,690 INFO L93 Difference]: Finished difference Result 1683 states and 2144 transitions. [2024-11-08 12:30:43,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:30:43,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-08 12:30:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:30:43,693 INFO L225 Difference]: With dead ends: 1683 [2024-11-08 12:30:43,693 INFO L226 Difference]: Without dead ends: 1683 [2024-11-08 12:30:43,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:30:43,693 INFO L432 NwaCegarLoop]: 1237 mSDtfsCounter, 22 mSDsluCounter, 3474 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4711 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-08 12:30:43,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4711 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-08 12:30:43,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-08 12:30:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1658. [2024-11-08 12:30:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1286 states have (on average 1.6220839813374806) internal successors, (2086), 1644 states have internal predecessors, (2086), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 12:30:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2106 transitions. [2024-11-08 12:30:43,716 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2106 transitions. Word has length 109 [2024-11-08 12:30:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:30:43,716 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2106 transitions. [2024-11-08 12:30:43,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:30:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2106 transitions. [2024-11-08 12:30:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 12:30:43,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:30:43,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:30:43,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-08 12:30:43,718 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:30:43,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:30:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1734788503, now seen corresponding path program 1 times [2024-11-08 12:30:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:30:43,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470428661] [2024-11-08 12:30:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:30:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:30:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:30:44,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:30:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:30:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:30:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:30:44,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470428661] [2024-11-08 12:30:44,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470428661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:30:44,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:30:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:30:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128401974] [2024-11-08 12:30:44,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:30:44,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:30:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:30:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:30:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:30:44,267 INFO L87 Difference]: Start difference. First operand 1658 states and 2106 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:30:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:30:54,159 INFO L93 Difference]: Finished difference Result 1682 states and 2142 transitions. [2024-11-08 12:30:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:30:54,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-08 12:30:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:30:54,161 INFO L225 Difference]: With dead ends: 1682 [2024-11-08 12:30:54,161 INFO L226 Difference]: Without dead ends: 1682 [2024-11-08 12:30:54,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:30:54,162 INFO L432 NwaCegarLoop]: 1237 mSDtfsCounter, 21 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4721 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-08 12:30:54,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4721 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-08 12:30:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-08 12:30:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1604. [2024-11-08 12:30:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1234 states have (on average 1.6458670988654782) internal successors, (2031), 1592 states have internal predecessors, (2031), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:30:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2049 transitions. [2024-11-08 12:30:54,176 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2049 transitions. Word has length 110 [2024-11-08 12:30:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:30:54,176 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2049 transitions. [2024-11-08 12:30:54,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:30:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2049 transitions. [2024-11-08 12:30:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 12:30:54,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:30:54,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:30:54,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 12:30:54,177 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:30:54,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:30:54,178 INFO L85 PathProgramCache]: Analyzing trace with hash -794441910, now seen corresponding path program 1 times [2024-11-08 12:30:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:30:54,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282300702] [2024-11-08 12:30:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:30:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:30:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:30:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:30:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:30:58,856 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:30:58,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:30:58,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282300702] [2024-11-08 12:30:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282300702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:30:58,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:30:58,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 12:30:58,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681203685] [2024-11-08 12:30:58,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:30:58,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 12:30:58,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:30:58,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 12:30:58,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-08 12:30:58,859 INFO L87 Difference]: Start difference. First operand 1604 states and 2049 transitions. Second operand has 20 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:31:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:31:38,933 INFO L93 Difference]: Finished difference Result 1687 states and 2152 transitions. [2024-11-08 12:31:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 12:31:38,934 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-08 12:31:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:31:38,936 INFO L225 Difference]: With dead ends: 1687 [2024-11-08 12:31:38,936 INFO L226 Difference]: Without dead ends: 1687 [2024-11-08 12:31:38,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 12:31:38,937 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1243 mSDsluCounter, 7495 mSDsCounter, 0 mSdLazyCounter, 5665 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 8265 SdHoareTripleChecker+Invalid, 5693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.8s IncrementalHoareTripleChecker+Time [2024-11-08 12:31:38,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 8265 Invalid, 5693 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 5665 Invalid, 0 Unknown, 0 Unchecked, 37.8s Time] [2024-11-08 12:31:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2024-11-08 12:31:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1659. [2024-11-08 12:31:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1288 states have (on average 1.6195652173913044) internal successors, (2086), 1645 states have internal predecessors, (2086), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 12:31:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2110 transitions. [2024-11-08 12:31:38,956 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2110 transitions. Word has length 110 [2024-11-08 12:31:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:31:38,956 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2110 transitions. [2024-11-08 12:31:38,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:31:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2110 transitions. [2024-11-08 12:31:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 12:31:38,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:31:38,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:31:38,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-08 12:31:38,958 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:31:38,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:31:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash -794441909, now seen corresponding path program 1 times [2024-11-08 12:31:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:31:38,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860236058] [2024-11-08 12:31:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:31:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:31:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:31:44,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:31:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:31:44,446 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:31:44,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:31:44,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860236058] [2024-11-08 12:31:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860236058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:31:44,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:31:44,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 12:31:44,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94467473] [2024-11-08 12:31:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:31:44,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 12:31:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:31:44,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 12:31:44,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-11-08 12:31:44,448 INFO L87 Difference]: Start difference. First operand 1659 states and 2110 transitions. Second operand has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 21 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:32:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:32:31,254 INFO L93 Difference]: Finished difference Result 1686 states and 2150 transitions. [2024-11-08 12:32:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:32:31,254 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 21 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-08 12:32:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:32:31,256 INFO L225 Difference]: With dead ends: 1686 [2024-11-08 12:32:31,256 INFO L226 Difference]: Without dead ends: 1686 [2024-11-08 12:32:31,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 12:32:31,257 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1286 mSDsluCounter, 6707 mSDsCounter, 0 mSdLazyCounter, 6653 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 7482 SdHoareTripleChecker+Invalid, 6679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.7s IncrementalHoareTripleChecker+Time [2024-11-08 12:32:31,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 7482 Invalid, 6679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 6653 Invalid, 0 Unknown, 0 Unchecked, 43.7s Time] [2024-11-08 12:32:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-08 12:32:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1659. [2024-11-08 12:32:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1286 states have (on average 1.6205287713841368) internal successors, (2084), 1645 states have internal predecessors, (2084), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 12:32:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2108 transitions. [2024-11-08 12:32:31,283 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2108 transitions. Word has length 110 [2024-11-08 12:32:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:32:31,283 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2108 transitions. [2024-11-08 12:32:31,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 21 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 12:32:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2108 transitions. [2024-11-08 12:32:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 12:32:31,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:32:31,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:32:31,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 12:32:31,285 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:32:31,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:32:31,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2056131899, now seen corresponding path program 1 times [2024-11-08 12:32:31,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:32:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609225136] [2024-11-08 12:32:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:32:31,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:32:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:32:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:32:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:32:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:32:36,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:32:36,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609225136] [2024-11-08 12:32:36,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609225136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:32:36,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619816488] [2024-11-08 12:32:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:32:36,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:32:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:32:36,578 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:32:36,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 12:32:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:32:37,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 12:32:37,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:32:37,099 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:32:38,180 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:32:38,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 12:32:38,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:32:38,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:32:39,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:32:39,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:32:39,150 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 20 treesize of output 1 [2024-11-08 12:32:39,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:32:39,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:32:39,487 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 20 treesize of output 1 [2024-11-08 12:32:39,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:32:39,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:32:39,915 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 20 treesize of output 1 [2024-11-08 12:32:40,319 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:32:40,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:32:40,337 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 20 treesize of output 1 [2024-11-08 12:32:40,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:32:40,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:32:40,764 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 20 treesize of output 1 [2024-11-08 12:32:41,122 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:32:41,661 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 12:32:41,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 63 [2024-11-08 12:32:41,680 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 42 treesize of output 25 [2024-11-08 12:32:42,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:32:42,593 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 12:32:42,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-08 12:32:42,615 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 42 treesize of output 25 [2024-11-08 12:32:42,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-08 12:32:43,146 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-08 12:32:43,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-08 12:32:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:32:43,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:32:43,315 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (or (not (= (let ((.cse0 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base|) .cse0 (select v_ArrVal_3944 .cse0))) v_ArrVal_3944)) (= (select |c_#valid| (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3944))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) 1))) is different from false [2024-11-08 12:32:43,393 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_3944))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse3 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select |c_#memory_$Pointer$#1.base| .cse2) .cse3 (select v_ArrVal_3944 .cse3))) v_ArrVal_3944)))))) is different from false [2024-11-08 12:32:43,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3943))) (or (not (= v_ArrVal_3944 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))))) (= (select |c_#valid| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-11-08 12:32:43,613 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 272 treesize of output 184 [2024-11-08 12:32:43,721 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_12|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3943))) (or (not (= v_ArrVal_3944 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))))) (= (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-11-08 12:32:43,838 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_3944 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_3944 .cse5))))))))))) is different from false [2024-11-08 12:32:44,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3940)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3939))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_3943)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_3944 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|))))))) is different from false [2024-11-08 12:32:44,314 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_3939))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_3944 .cse4))) v_ArrVal_3944)) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|))))))))) is different from false [2024-11-08 12:32:44,818 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3938)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3937) .cse9 v_ArrVal_3939))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_3943)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_3944 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|))))))))) is different from false [2024-11-08 12:32:44,994 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_3938))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_3937) .cse10 v_ArrVal_3939))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_3943)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_3944))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_3944 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3944 .cse5))))))))))))))) is different from false [2024-11-08 12:32:45,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3936)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3938))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3935) .cse9 v_ArrVal_3937) .cse10 v_ArrVal_3939))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_3944 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_3944 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-08 12:32:45,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_3936))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3938))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_3935) .cse10 v_ArrVal_3937) .cse11 v_ArrVal_3939))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_3943))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))) v_ArrVal_3944)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 12:32:45,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3933)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3936))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3938))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3934) .cse9 v_ArrVal_3935) .cse10 v_ArrVal_3937) .cse11 v_ArrVal_3939))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_3944 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_3944 .cse5))))))))))))))))) is different from false [2024-11-08 12:32:46,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_3933))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3936))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3938))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_3934) .cse10 v_ArrVal_3935) .cse11 v_ArrVal_3937) .cse12 v_ArrVal_3939))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_3944 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_3944 .cse5))))))))))))))))))) is different from false [2024-11-08 12:32:46,683 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (v_ArrVal_3950 (Array Int Int)) (v_ArrVal_3951 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3950)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_3933))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3936))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3938))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3951) .cse9 v_ArrVal_3934) .cse10 v_ArrVal_3935) .cse11 v_ArrVal_3937) .cse12 v_ArrVal_3939))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_3943)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_3944))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3944 .cse5))) v_ArrVal_3944)))))))))))))))) is different from false [2024-11-08 12:32:46,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619816488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:32:46,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:32:46,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2024-11-08 12:32:46,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681859133] [2024-11-08 12:32:46,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:32:46,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 12:32:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:32:46,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 12:32:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1024, Unknown=14, NotChecked=1078, Total=2256 [2024-11-08 12:32:46,698 INFO L87 Difference]: Start difference. First operand 1659 states and 2108 transitions. Second operand has 34 states, 31 states have (on average 5.741935483870968) internal successors, (178), 33 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:33:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:40,355 INFO L93 Difference]: Finished difference Result 1683 states and 2146 transitions. [2024-11-08 12:33:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:33:40,356 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.741935483870968) internal successors, (178), 33 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 111 [2024-11-08 12:33:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:40,359 INFO L225 Difference]: With dead ends: 1683 [2024-11-08 12:33:40,359 INFO L226 Difference]: Without dead ends: 1683 [2024-11-08 12:33:40,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=258, Invalid=2040, Unknown=14, NotChecked=1470, Total=3782 [2024-11-08 12:33:40,361 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1244 mSDsluCounter, 9792 mSDsCounter, 0 mSdLazyCounter, 7264 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 10562 SdHoareTripleChecker+Invalid, 7301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 7264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:40,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 10562 Invalid, 7301 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 7264 Invalid, 0 Unknown, 0 Unchecked, 50.2s Time] [2024-11-08 12:33:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-08 12:33:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1658. [2024-11-08 12:33:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1286 states have (on average 1.6189735614307932) internal successors, (2082), 1644 states have internal predecessors, (2082), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 12:33:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2106 transitions. [2024-11-08 12:33:40,378 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2106 transitions. Word has length 111 [2024-11-08 12:33:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:40,378 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2106 transitions. [2024-11-08 12:33:40,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.741935483870968) internal successors, (178), 33 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:33:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2106 transitions. [2024-11-08 12:33:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 12:33:40,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:40,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:40,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 12:33:40,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:33:40,580 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:33:40,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:40,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2056131900, now seen corresponding path program 1 times [2024-11-08 12:33:40,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:40,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405254551] [2024-11-08 12:33:40,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:40,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:45,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:33:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:33:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405254551] [2024-11-08 12:33:46,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405254551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:33:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949873404] [2024-11-08 12:33:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:46,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:33:46,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:33:46,440 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:33:46,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 12:33:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:46,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 12:33:46,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:46,962 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:33:48,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:33:48,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 12:33:48,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:33:48,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:33:49,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:33:49,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:33:49,143 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 20 treesize of output 1 [2024-11-08 12:33:49,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:33:49,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:33:49,503 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 20 treesize of output 1 [2024-11-08 12:33:49,948 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:33:49,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:33:49,962 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 20 treesize of output 1 [2024-11-08 12:33:50,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:33:50,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:33:50,510 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 20 treesize of output 1 [2024-11-08 12:33:51,002 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:33:51,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 12:33:51,024 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 20 treesize of output 1 [2024-11-08 12:33:51,490 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:33:52,025 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 12:33:52,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-11-08 12:33:52,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-08 12:33:52,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:33:53,110 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 12:33:53,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-08 12:33:53,214 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-08 12:33:53,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-11-08 12:33:54,069 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-08 12:33:54,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-11-08 12:33:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:54,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:34:00,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse1 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (and (forall ((v_ArrVal_4170 (Array Int Int))) (or (forall ((v_ArrVal_4169 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4169 .cse1)) v_ArrVal_4169)) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4170)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4169))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ 383 (select (select .cse2 .cse3) .cse4)) (select |c_#length| (select (select .cse5 .cse3) .cse4))))))) (not (= v_ArrVal_4170 (store .cse7 .cse1 (select v_ArrVal_4170 .cse1)))))) (forall ((v_ArrVal_4170 (Array Int Int))) (or (not (= v_ArrVal_4170 (store .cse7 .cse1 (select v_ArrVal_4170 .cse1)))) (forall ((v_ArrVal_4169 (Array Int Int))) (or (< 0 (+ (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4170))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1)) (not (= (store .cse0 .cse1 (select v_ArrVal_4169 .cse1)) v_ArrVal_4169)))))))) is different from false [2024-11-08 12:34:00,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse0) (forall ((v_ArrVal_4170 (Array Int Int))) (let ((.cse8 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (forall ((v_ArrVal_4169 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4170)) (.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_4169))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select .cse1 .cse2) .cse3) 383) (select |c_#length| (select (select .cse4 .cse2) .cse3))))) (not (= v_ArrVal_4169 (store .cse7 .cse8 (select v_ArrVal_4169 .cse8)))))) (not (= v_ArrVal_4170 (store .cse9 .cse8 (select v_ArrVal_4170 .cse8))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse0) (forall ((v_ArrVal_4170 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (forall ((v_ArrVal_4169 (Array Int Int))) (or (not (= v_ArrVal_4169 (store .cse7 .cse10 (select v_ArrVal_4169 .cse10)))) (< 0 (+ (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4170))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)))) (not (= v_ArrVal_4170 (store .cse9 .cse10 (select v_ArrVal_4170 .cse10))))))))))))) is different from false [2024-11-08 12:34:01,460 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.base|))) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.offset|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse0 (select .cse7 .cse5)) (.cse2 (select .cse4 .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (or (forall ((v_ArrVal_4170 (Array Int Int))) (let ((.cse1 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= v_ArrVal_4170 (store .cse0 .cse1 (select v_ArrVal_4170 .cse1)))) (forall ((v_ArrVal_4169 (Array Int Int))) (or (not (= v_ArrVal_4169 (store .cse2 .cse1 (select v_ArrVal_4169 .cse1)))) (< 0 (+ 1 (let ((.cse3 (store .cse7 .cse5 v_ArrVal_4170))) (select (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse8))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse8) (forall ((v_ArrVal_4170 (Array Int Int))) (let ((.cse9 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= v_ArrVal_4170 (store .cse0 .cse9 (select v_ArrVal_4170 .cse9)))) (forall ((v_ArrVal_4169 (Array Int Int))) (or (not (= v_ArrVal_4169 (store .cse2 .cse9 (select v_ArrVal_4169 .cse9)))) (let ((.cse10 (store .cse7 .cse5 v_ArrVal_4170)) (.cse13 (store .cse4 .cse5 v_ArrVal_4169))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse12 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ 383 (select (select .cse10 .cse11) .cse12)) (select |c_#length| (select (select .cse13 .cse11) .cse12)))))))))))))))) is different from false [2024-11-08 12:34:01,521 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 757 treesize of output 664 [2024-11-08 12:34:03,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| 0))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse2 (+ 40 v_prenex_42))) (or (not (= v_prenex_41 (store (select .cse0 .cse1) .cse2 (select v_prenex_41 .cse2)))) (< 0 (+ (let ((.cse3 (store .cse0 .cse1 v_prenex_41))) (select (select .cse3 (select (select (store .cse4 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)) (not (= (store (select .cse4 .cse1) .cse2 (select v_prenex_40 .cse2)) v_prenex_40)) (< v_prenex_42 .cse6))))) (forall ((v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse9 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= v_ArrVal_4170 (store (select .cse0 .cse8) .cse9 (select v_ArrVal_4170 .cse9)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse6) (< (let ((.cse10 (store .cse0 .cse8 v_ArrVal_4170))) (select (select .cse10 (select (select (store .cse11 .cse8 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1) (not (= v_ArrVal_4169 (store (select .cse11 .cse8) .cse9 (select v_ArrVal_4169 .cse9)))))))) (forall ((v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse13 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (not (= v_ArrVal_4170 (store (select .cse0 .cse12) .cse13 (select v_ArrVal_4170 .cse13)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse6) (not (= v_ArrVal_4169 (store (select .cse14 .cse12) .cse13 (select v_ArrVal_4169 .cse13)))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse15 (store .cse14 .cse12 v_ArrVal_4169))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse0 .cse12 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) is different from false [2024-11-08 12:34:06,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4163)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4164))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse3 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse0 .cse2) .cse3 (select v_ArrVal_4170 .cse3)) v_ArrVal_4170)) (not (= (store (select .cse4 .cse2) .cse3 (select v_ArrVal_4169 .cse3)) v_ArrVal_4169)) (= (select (let ((.cse5 (store .cse4 .cse2 v_ArrVal_4169))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse2 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4163)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4164))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse10 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse14 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse11 (store .cse10 .cse13 v_ArrVal_4170))) (select (select .cse11 (select (select (store .cse12 .cse13 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (select .cse10 .cse13) .cse14 (select v_ArrVal_4170 .cse14)) v_ArrVal_4170)) (not (= (store (select .cse12 .cse13) .cse14 (select v_ArrVal_4169 .cse14)) v_ArrVal_4169)))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4163)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4164))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (+ 40 v_prenex_42))) (or (< v_prenex_42 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse20 .cse21) .cse22 (select v_prenex_40 .cse22)) v_prenex_40)) (< 0 (+ (let ((.cse23 (store .cse19 .cse21 v_prenex_41))) (select (select .cse23 (select (select (store .cse20 .cse21 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (select .cse19 .cse21) .cse22 (select v_prenex_41 .cse22)) v_prenex_41)))))))))) is different from false [2024-11-08 12:34:07,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4163)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4164))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4169))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4169 (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4169 .cse5)))) (not (= v_ArrVal_4170 (store (select (store .cse6 .cse7 (store v_ArrVal_4163 .cse8 0)) .cse4) .cse5 (select v_ArrVal_4170 .cse5)))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse20 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4163)) (.cse12 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4164))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse14 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse15 (+ 40 v_prenex_42)) (.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse16 (store .cse20 .cse13 (store (select .cse20 .cse13) .cse14 0)))) (or (not (= v_prenex_40 (store (let ((.cse11 (store .cse12 .cse13 (store v_ArrVal_4164 .cse14 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse15 (select v_prenex_40 .cse15)))) (not (= (store (select .cse16 .cse17) .cse15 (select v_prenex_41 .cse15)) v_prenex_41)) (< 0 (+ (let ((.cse18 (store .cse16 .cse17 v_prenex_41))) (select (select .cse18 (select (select (store .cse19 .cse17 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_42 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4163)) (.cse23 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4164))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse21 (store .cse30 .cse24 (store (select .cse30 .cse24) .cse25 0))) (.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse22 (store .cse23 .cse24 (store v_ArrVal_4164 .cse25 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse26 (select v_ArrVal_4169 .cse26)) v_ArrVal_4169)) (< (let ((.cse27 (store .cse21 .cse29 v_ArrVal_4170))) (select (select .cse27 (select (select (store .cse28 .cse29 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4170 (store (select .cse21 .cse29) .cse26 (select v_ArrVal_4170 .cse26))))))))))))) is different from false [2024-11-08 12:34:08,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4162))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4161) .cse12 v_ArrVal_4163)) (.cse5 (store .cse11 .cse12 v_ArrVal_4164))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse2 (+ 40 v_prenex_42)) (.cse0 (store .cse10 .cse6 (store (select .cse10 .cse6) .cse7 0))) (.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_prenex_41 .cse2)) v_prenex_41)) (< v_prenex_42 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_prenex_40 (store (let ((.cse4 (store .cse5 .cse6 (store v_ArrVal_4164 .cse7 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse2 (select v_prenex_40 .cse2)))) (< 0 (+ (let ((.cse8 (store .cse0 .cse1 v_prenex_41))) (select (select .cse8 (select (select (store .cse9 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4162))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse22 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4161) .cse24 v_ArrVal_4163)) (.cse14 (store .cse23 .cse24 v_ArrVal_4164))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse16 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse21 (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse17 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse18 (store .cse22 .cse15 (store (select .cse22 .cse15) .cse16 0))) (.cse19 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= v_ArrVal_4169 (store (let ((.cse13 (store .cse14 .cse15 (store v_ArrVal_4164 .cse16 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse17 (select v_ArrVal_4169 .cse17)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse18 .cse19) .cse17 (select v_ArrVal_4170 .cse17)) v_ArrVal_4170)) (< (let ((.cse20 (store .cse18 .cse19 v_ArrVal_4170))) (select (select .cse20 (select (select (store .cse21 .cse19 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4162))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse30 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4161) .cse35 v_ArrVal_4163)) (.cse33 (store .cse34 .cse35 v_ArrVal_4164))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse26 (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse25 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 0))) (.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse28 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse26 .cse27) .cse28 (select v_ArrVal_4169 .cse28)) v_ArrVal_4169)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse29 (store .cse26 .cse27 v_ArrVal_4169))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse25 .cse27 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (not (= (store (select (store .cse30 .cse31 (store v_ArrVal_4163 .cse32 0)) .cse27) .cse28 (select v_ArrVal_4170 .cse28)) v_ArrVal_4170)))))))))))) is different from false [2024-11-08 12:34:09,930 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4162))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4161) .cse12 v_ArrVal_4163)) (.cse2 (store .cse11 .cse12 v_ArrVal_4164))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_42))) (or (not (= v_prenex_40 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4164 .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_40 .cse5)))) (< 0 (+ (let ((.cse6 (store .cse9 .cse8 v_prenex_41))) (select (select .cse6 (select (select (store .cse7 .cse8 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_42 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_41 (store (select .cse9 .cse8) .cse5 (select v_prenex_41 .cse5)))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4162))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4161) .cse25 v_ArrVal_4163)) (.cse20 (store .cse24 .cse25 v_ArrVal_4164))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse17 (store .cse23 .cse21 (store (select .cse23 .cse21) .cse22 0))) (.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< (let ((.cse14 (store .cse17 .cse16 v_ArrVal_4170))) (select (select .cse14 (select (select (store .cse15 .cse16 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse17 .cse16) .cse18 (select v_ArrVal_4170 .cse18)) v_ArrVal_4170)) (not (= (store (let ((.cse19 (store .cse20 .cse21 (store v_ArrVal_4164 .cse22 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_ArrVal_4169 .cse18)) v_ArrVal_4169)))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4162))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4161) .cse36 v_ArrVal_4163)) (.cse34 (store .cse35 .cse36 v_ArrVal_4164))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse34 .cse32 (store (select .cse34 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse29 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 0))) (.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (= (select (let ((.cse26 (store .cse27 .cse28 v_ArrVal_4169))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse29 .cse28 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|) (not (= (store (select .cse27 .cse28) .cse30 (select v_ArrVal_4169 .cse30)) v_ArrVal_4169)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select (store .cse31 .cse32 (store v_ArrVal_4163 .cse33 0)) .cse28) .cse30 (select v_ArrVal_4170 .cse30)) v_ArrVal_4170))))))))))))) is different from false [2024-11-08 12:34:11,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4159))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4162))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4160) .cse13 v_ArrVal_4161) .cse12 v_ArrVal_4163)) (.cse2 (store .cse11 .cse12 v_ArrVal_4164))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4164 .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4169 .cse5)) v_ArrVal_4169)) (< (let ((.cse6 (store .cse9 .cse8 v_ArrVal_4170))) (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4170 (store (select .cse9 .cse8) .cse5 (select v_ArrVal_4170 .cse5)))))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4159))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse27 .cse26 v_ArrVal_4162))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4160) .cse26 v_ArrVal_4161) .cse25 v_ArrVal_4163)) (.cse23 (store .cse24 .cse25 v_ArrVal_4164))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse23 .cse21 (store (select .cse23 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse18 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 0)))) (or (= (select (let ((.cse15 (store .cse16 .cse17 v_ArrVal_4169))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse18 .cse17 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|) (not (= v_ArrVal_4169 (store (select .cse16 .cse17) .cse19 (select v_ArrVal_4169 .cse19)))) (not (= (store (select (store .cse20 .cse21 (store v_ArrVal_4163 .cse22 0)) .cse17) .cse19 (select v_ArrVal_4170 .cse19)) v_ArrVal_4170)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4159))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4162))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse37 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4160) .cse40 v_ArrVal_4161) .cse39 v_ArrVal_4163)) (.cse34 (store .cse38 .cse39 v_ArrVal_4164))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 0))) (.cse30 (+ 40 v_prenex_42))) (or (not (= v_prenex_41 (store (select .cse28 .cse29) .cse30 (select v_prenex_41 .cse30)))) (< 0 (+ (let ((.cse31 (store .cse28 .cse29 v_prenex_41))) (select (select .cse31 (select (select (store .cse32 .cse29 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_42 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_40 (store (let ((.cse33 (store .cse34 .cse35 (store v_ArrVal_4164 .cse36 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse30 (select v_prenex_40 .cse30)))))))))))))))) is different from false [2024-11-08 12:34:12,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4159))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4162))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4160) .cse13 v_ArrVal_4161) .cse11 v_ArrVal_4163)) (.cse9 (store .cse10 .cse11 v_ArrVal_4164))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse5 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse6 (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (or (not (= v_ArrVal_4170 (store (select (store .cse0 .cse1 (store v_ArrVal_4163 .cse2 0)) .cse3) .cse4 (select v_ArrVal_4170 .cse4)))) (not (= v_ArrVal_4169 (store (select .cse5 .cse3) .cse4 (select v_ArrVal_4169 .cse4)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse8 (store .cse5 .cse3 v_ArrVal_4169))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (select (select (store .cse6 .cse3 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4159))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4162))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4160) .cse27 v_ArrVal_4161) .cse26 v_ArrVal_4163)) (.cse21 (store .cse25 .cse26 v_ArrVal_4164))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse19 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse15 (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 0))) (.cse17 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= (store (select .cse15 .cse16) .cse17 (select v_ArrVal_4170 .cse17)) v_ArrVal_4170)) (< (let ((.cse18 (store .cse15 .cse16 v_ArrVal_4170))) (select (select .cse18 (select (select (store .cse19 .cse16 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (not (= v_ArrVal_4169 (store (let ((.cse20 (store .cse21 .cse22 (store v_ArrVal_4164 .cse23 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) .cse17 (select v_ArrVal_4169 .cse17)))))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4159))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4162))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4160) .cse41 v_ArrVal_4161) .cse40 v_ArrVal_4163)) (.cse30 (store .cse39 .cse40 v_ArrVal_4164))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse32 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse35 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse37 (store .cse38 .cse31 (store (select .cse38 .cse31) .cse32 0))) (.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse33 (+ 40 v_prenex_42))) (or (not (= v_prenex_40 (store (let ((.cse29 (store .cse30 .cse31 (store v_ArrVal_4164 .cse32 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) .cse33 (select v_prenex_40 .cse33)))) (< 0 (+ (let ((.cse34 (store .cse37 .cse36 v_prenex_41))) (select (select .cse34 (select (select (store .cse35 .cse36 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) 1)) (< v_prenex_42 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (not (= v_prenex_41 (store (select .cse37 .cse36) .cse33 (select v_prenex_41 .cse33))))))))))))))))) is different from false [2024-11-08 12:34:16,765 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4158))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4159))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4162))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4157) .cse13 v_ArrVal_4160) .cse14 v_ArrVal_4161) .cse12 v_ArrVal_4163)) (.cse2 (store .cse11 .cse12 v_ArrVal_4164))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4164 .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4169 .cse5)) v_ArrVal_4169)) (not (= v_ArrVal_4170 (store (select .cse6 .cse7) .cse5 (select v_ArrVal_4170 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse8 (store .cse6 .cse7 v_ArrVal_4170))) (select (select .cse8 (select (select (store .cse9 .cse7 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))))))))))) (forall ((v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4158))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4159))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4162))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4157) .cse29 v_ArrVal_4160) .cse30 v_ArrVal_4161) .cse28 v_ArrVal_4163)) (.cse23 (store .cse27 .cse28 v_ArrVal_4164))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse17 (store .cse26 .cse24 (store (select .cse26 .cse24) .cse25 0))) (.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (+ 40 v_prenex_42))) (or (< v_prenex_42 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse18 (store .cse17 .cse20 v_prenex_41))) (select (select .cse18 (select (select (store .cse19 .cse20 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (select .cse17 .cse20) .cse21 (select v_prenex_41 .cse21)) v_prenex_41)) (not (= v_prenex_40 (store (let ((.cse22 (store .cse23 .cse24 (store v_ArrVal_4164 .cse25 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse21 (select v_prenex_40 .cse21)))))))))))))))) (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4158))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4159))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4162))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4157) .cse44 v_ArrVal_4160) .cse45 v_ArrVal_4161) .cse43 v_ArrVal_4163)) (.cse41 (store .cse42 .cse43 v_ArrVal_4164))) (let ((.cse39 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse36 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 0))) (.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse37 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse33 (store .cse34 .cse35 v_ArrVal_4169))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse36 .cse35 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4169 (store (select .cse34 .cse35) .cse37 (select v_ArrVal_4169 .cse37)))) (not (= v_ArrVal_4170 (store (select (store .cse38 .cse39 (store v_ArrVal_4163 .cse40 0)) .cse35) .cse37 (select v_ArrVal_4170 .cse37)))))))))))))))))) is different from false [2024-11-08 12:34:20,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4158))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4159))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_4162))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4157) .cse13 v_ArrVal_4160) .cse14 v_ArrVal_4161) .cse11 v_ArrVal_4163)) (.cse9 (store .cse10 .cse11 v_ArrVal_4164))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 0))) (.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select (store .cse2 .cse3 (store v_ArrVal_4163 .cse4 0)) .cse5) .cse6 (select v_ArrVal_4170 .cse6)) v_ArrVal_4170)) (= (select (let ((.cse7 (store .cse8 .cse5 v_ArrVal_4169))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse5 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|) (not (= v_ArrVal_4169 (store (select .cse8 .cse5) .cse6 (select v_ArrVal_4169 .cse6)))))))))))))))) (forall ((v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4158))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4159))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4162))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4157) .cse29 v_ArrVal_4160) .cse30 v_ArrVal_4161) .cse28 v_ArrVal_4163)) (.cse22 (store .cse27 .cse28 v_ArrVal_4164))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (+ 40 v_prenex_42)) (.cse20 (store .cse26 .cse23 (store (select .cse26 .cse23) .cse24 0)))) (or (< 0 (+ (let ((.cse17 (store .cse20 .cse19 v_prenex_41))) (select (select .cse17 (select (select (store .cse18 .cse19 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (let ((.cse21 (store .cse22 .cse23 (store v_ArrVal_4164 .cse24 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse25 (select v_prenex_40 .cse25)) v_prenex_40)) (not (= (store (select .cse20 .cse19) .cse25 (select v_prenex_41 .cse25)) v_prenex_41)) (< v_prenex_42 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse48 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4158))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4159))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4162))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4157) .cse45 v_ArrVal_4160) .cse46 v_ArrVal_4161) .cse44 v_ArrVal_4163)) (.cse39 (store .cse43 .cse44 v_ArrVal_4164))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse37 (store .cse39 .cse40 (store (select .cse39 .cse40) .cse41 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse34 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse35 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse33 (store .cse42 .cse40 (store (select .cse42 .cse40) .cse41 0)))) (or (not (= v_ArrVal_4170 (store (select .cse33 .cse34) .cse35 (select v_ArrVal_4170 .cse35)))) (< (let ((.cse36 (store .cse33 .cse34 v_ArrVal_4170))) (select (select .cse36 (select (select (store .cse37 .cse34 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (let ((.cse38 (store .cse39 .cse40 (store v_ArrVal_4164 .cse41 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse35 (select v_ArrVal_4169 .cse35)) v_ArrVal_4169)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-11-08 12:34:22,551 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4175 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4176 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4176))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4158))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4159))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4162))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4175) .cse13 v_ArrVal_4157) .cse14 v_ArrVal_4160) .cse15 v_ArrVal_4161) .cse12 v_ArrVal_4163)) (.cse2 (store .cse11 .cse12 v_ArrVal_4164))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= v_ArrVal_4169 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4164 .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4169 .cse5)))) (< (let ((.cse6 (store .cse9 .cse8 v_ArrVal_4170))) (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4170 (store (select .cse9 .cse8) .cse5 (select v_ArrVal_4170 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4175 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4176 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4176))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse35 .cse30 v_ArrVal_4158))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse34 .cse31 v_ArrVal_4159))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse33 .cse32 v_ArrVal_4162))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4175) .cse30 v_ArrVal_4157) .cse31 v_ArrVal_4160) .cse32 v_ArrVal_4161) .cse29 v_ArrVal_4163)) (.cse27 (store .cse28 .cse29 v_ArrVal_4164))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse27 .cse20 (store (select .cse27 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse23 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse25 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 0))) (.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select (store .cse19 .cse20 (store v_ArrVal_4163 .cse21 0)) .cse22) .cse23 (select v_ArrVal_4170 .cse23)) v_ArrVal_4170)) (not (= v_ArrVal_4169 (store (select .cse24 .cse22) .cse23 (select v_ArrVal_4169 .cse23)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse26 (store .cse24 .cse22 v_ArrVal_4169))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse25 .cse22 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|))))))))))))))) (forall ((v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4175 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4176 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4176))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4158))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4159))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4162))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse45 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4175) .cse48 v_ArrVal_4157) .cse49 v_ArrVal_4160) .cse50 v_ArrVal_4161) .cse47 v_ArrVal_4163)) (.cse38 (store .cse46 .cse47 v_ArrVal_4164))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse36 (store .cse45 .cse39 (store (select .cse45 .cse39) .cse40 0))) (.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse41 (+ 40 v_prenex_42))) (or (< v_prenex_42 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_40 (store (let ((.cse37 (store .cse38 .cse39 (store v_ArrVal_4164 .cse40 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse41 (select v_prenex_40 .cse41)))) (< 0 (+ (let ((.cse42 (store .cse36 .cse44 v_prenex_41))) (select (select .cse42 (select (select (store .cse43 .cse44 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (select .cse36 .cse44) .cse41 (select v_prenex_41 .cse41)) v_prenex_41)))))))))))))))))) is different from false [2024-11-08 12:34:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949873404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:34:22,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:34:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 34 [2024-11-08 12:34:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288028119] [2024-11-08 12:34:22,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:34:22,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 12:34:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:34:22,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 12:34:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1347, Unknown=13, NotChecked=1118, Total=2652 [2024-11-08 12:34:22,863 INFO L87 Difference]: Start difference. First operand 1658 states and 2106 transitions. Second operand has 35 states, 32 states have (on average 5.59375) internal successors, (179), 34 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:35:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:35:43,547 INFO L93 Difference]: Finished difference Result 1682 states and 2144 transitions. [2024-11-08 12:35:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 12:35:43,548 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 5.59375) internal successors, (179), 34 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 111 [2024-11-08 12:35:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:35:43,551 INFO L225 Difference]: With dead ends: 1682 [2024-11-08 12:35:43,551 INFO L226 Difference]: Without dead ends: 1682 [2024-11-08 12:35:43,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=313, Invalid=2482, Unknown=13, NotChecked=1482, Total=4290 [2024-11-08 12:35:43,554 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 1233 mSDsluCounter, 11583 mSDsCounter, 0 mSdLazyCounter, 10441 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 12350 SdHoareTripleChecker+Invalid, 10476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 10441 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.4s IncrementalHoareTripleChecker+Time [2024-11-08 12:35:43,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 12350 Invalid, 10476 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 10441 Invalid, 2 Unknown, 0 Unchecked, 76.4s Time] [2024-11-08 12:35:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-08 12:35:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1602. [2024-11-08 12:35:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1232 states have (on average 1.6452922077922079) internal successors, (2027), 1590 states have internal predecessors, (2027), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 12:35:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2045 transitions. [2024-11-08 12:35:43,578 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2045 transitions. Word has length 111 [2024-11-08 12:35:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:35:43,613 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2045 transitions. [2024-11-08 12:35:43,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 5.59375) internal successors, (179), 34 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:35:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2045 transitions. [2024-11-08 12:35:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 12:35:43,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:35:43,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:35:43,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 12:35:43,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:35:43,815 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:35:43,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:35:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash 439612628, now seen corresponding path program 1 times [2024-11-08 12:35:43,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:35:43,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987017308] [2024-11-08 12:35:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:35:43,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:35:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:35:44,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:35:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:35:44,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 12:35:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:35:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 12:35:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:35:44,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987017308] [2024-11-08 12:35:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987017308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:35:44,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:35:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:35:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109434688] [2024-11-08 12:35:44,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:35:44,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:35:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:35:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:35:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:35:44,190 INFO L87 Difference]: Start difference. First operand 1602 states and 2045 transitions. Second operand has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:35:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:35:54,969 INFO L93 Difference]: Finished difference Result 2469 states and 3161 transitions. [2024-11-08 12:35:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:35:54,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 120 [2024-11-08 12:35:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:35:54,973 INFO L225 Difference]: With dead ends: 2469 [2024-11-08 12:35:54,973 INFO L226 Difference]: Without dead ends: 2469 [2024-11-08 12:35:54,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:35:54,973 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 2887 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2895 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-08 12:35:54,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2895 Valid, 2363 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-08 12:35:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2024-11-08 12:35:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2166. [2024-11-08 12:35:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 1803 states have (on average 1.625069328896284) internal successors, (2930), 2152 states have internal predecessors, (2930), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 12:35:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2952 transitions. [2024-11-08 12:35:54,997 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2952 transitions. Word has length 120 [2024-11-08 12:35:54,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:35:54,997 INFO L471 AbstractCegarLoop]: Abstraction has 2166 states and 2952 transitions. [2024-11-08 12:35:54,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:35:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2952 transitions. [2024-11-08 12:35:54,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 12:35:54,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:35:54,998 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:35:54,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-08 12:35:54,998 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:35:54,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:35:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash 439612629, now seen corresponding path program 1 times [2024-11-08 12:35:54,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:35:54,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366791089] [2024-11-08 12:35:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:35:54,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:35:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:35:55,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:35:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:35:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 12:35:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:35:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 12:35:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:35:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366791089] [2024-11-08 12:35:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366791089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:35:55,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:35:55,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:35:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61713790] [2024-11-08 12:35:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:35:55,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:35:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:35:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:35:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:35:55,455 INFO L87 Difference]: Start difference. First operand 2166 states and 2952 transitions. Second operand has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:36:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:36:07,467 INFO L93 Difference]: Finished difference Result 2817 states and 3732 transitions. [2024-11-08 12:36:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:36:07,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 120 [2024-11-08 12:36:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:36:07,472 INFO L225 Difference]: With dead ends: 2817 [2024-11-08 12:36:07,473 INFO L226 Difference]: Without dead ends: 2817 [2024-11-08 12:36:07,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:36:07,473 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 4173 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4183 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-08 12:36:07,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4183 Valid, 2524 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2024-11-08 12:36:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2024-11-08 12:36:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2618. [2024-11-08 12:36:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2255 states have (on average 1.6186252771618626) internal successors, (3650), 2602 states have internal predecessors, (3650), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 12:36:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3676 transitions. [2024-11-08 12:36:07,510 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3676 transitions. Word has length 120 [2024-11-08 12:36:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:36:07,510 INFO L471 AbstractCegarLoop]: Abstraction has 2618 states and 3676 transitions. [2024-11-08 12:36:07,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:36:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3676 transitions. [2024-11-08 12:36:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 12:36:07,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:36:07,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:36:07,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-08 12:36:07,512 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:36:07,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:36:07,512 INFO L85 PathProgramCache]: Analyzing trace with hash 743090329, now seen corresponding path program 1 times [2024-11-08 12:36:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:36:07,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903824938] [2024-11-08 12:36:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:36:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:36:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:36:07,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 12:36:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:36:08,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 12:36:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:36:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 12:36:08,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:36:08,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903824938] [2024-11-08 12:36:08,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903824938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:36:08,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562467432] [2024-11-08 12:36:08,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:36:08,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:36:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:36:08,217 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:36:08,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 12:36:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:36:08,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 12:36:08,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:36:08,753 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:36:10,099 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:36:10,100 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:36:10,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 12:36:11,154 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:36:11,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 12:36:11,460 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:36:11,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 12:36:11,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:36:11,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 12:36:12,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:36:12,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 12:36:12,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:36:12,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:36:13,367 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 12:36:13,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 12:36:13,630 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 22 treesize of output 10 [2024-11-08 12:36:14,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 12:36:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:36:14,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:36:14,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562467432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:36:14,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 12:36:14,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5] total 20 [2024-11-08 12:36:14,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878655787] [2024-11-08 12:36:14,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:36:14,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 12:36:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:36:14,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 12:36:14,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-08 12:36:14,734 INFO L87 Difference]: Start difference. First operand 2618 states and 3676 transitions. Second operand has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:36:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:36:57,258 INFO L93 Difference]: Finished difference Result 2693 states and 3768 transitions. [2024-11-08 12:36:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 12:36:57,259 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-08 12:36:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:36:57,262 INFO L225 Difference]: With dead ends: 2693 [2024-11-08 12:36:57,262 INFO L226 Difference]: Without dead ends: 2693 [2024-11-08 12:36:57,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 12:36:57,263 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 1183 mSDsluCounter, 7489 mSDsCounter, 0 mSdLazyCounter, 5547 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 8252 SdHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 5547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:36:57,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 8252 Invalid, 5581 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 5547 Invalid, 0 Unknown, 0 Unchecked, 40.2s Time] [2024-11-08 12:36:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2024-11-08 12:36:57,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2687. [2024-11-08 12:36:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2321 states have (on average 1.6014648858250753) internal successors, (3717), 2667 states have internal predecessors, (3717), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (30), 17 states have call predecessors, (30), 15 states have call successors, (30) [2024-11-08 12:36:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3762 transitions. [2024-11-08 12:36:57,328 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3762 transitions. Word has length 121 [2024-11-08 12:36:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:36:57,329 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 3762 transitions. [2024-11-08 12:36:57,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 12:36:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3762 transitions. [2024-11-08 12:36:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 12:36:57,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:36:57,331 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:36:57,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 12:36:57,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f81ceb-5e1f-49f3-a080-645136208147/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:36:57,532 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 12:36:57,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:36:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash 743090330, now seen corresponding path program 1 times [2024-11-08 12:36:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:36:57,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024412918] [2024-11-08 12:36:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:36:57,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:36:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat