./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB --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 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:37:22,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:37:23,039 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:37:23,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:37:23,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:37:23,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:37:23,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:37:23,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:37:23,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:37:23,079 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:37:23,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:37:23,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:37:23,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:37:23,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:37:23,081 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:37:23,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:37:23,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:37:23,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:37:23,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:37:23,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:37:23,082 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:37:23,082 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:37:23,082 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:37:23,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:37:23,083 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:37:23,083 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:37:23,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:37:23,083 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:37:23,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:37:23,083 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:37:23,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:37:23,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:37:23,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:37:23,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:37:23,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:37:23,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:37:23,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:37:23,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:37:23,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:37:23,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:37:23,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:37:23,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:37:23,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:37:23,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:37:23,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:37:23,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:37:23,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:37:23,086 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 [2024-11-28 02:37:23,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:37:23,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:37:23,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:37:23,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:37:23,513 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:37:23,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2024-11-28 02:37:27,074 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data/021c881e4/d2d22e4fa84c4973b8fa4f5ac3e2a0f1/FLAG826e2f27b [2024-11-28 02:37:27,670 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:37:27,671 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2024-11-28 02:37:27,696 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data/021c881e4/d2d22e4fa84c4973b8fa4f5ac3e2a0f1/FLAG826e2f27b [2024-11-28 02:37:27,721 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data/021c881e4/d2d22e4fa84c4973b8fa4f5ac3e2a0f1 [2024-11-28 02:37:27,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:37:27,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:37:27,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:37:27,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:37:27,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:37:27,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:27" (1/1) ... [2024-11-28 02:37:27,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5acf5352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27, skipping insertion in model container [2024-11-28 02:37:27,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:27" (1/1) ... [2024-11-28 02:37:27,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:37:28,324 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:37:28,382 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:37:28,390 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:37:28,396 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:37:28,411 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:37:28,429 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:37:28,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:37:28,453 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:37:28,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:37:28,631 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:37:28,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28 WrapperNode [2024-11-28 02:37:28,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:37:28,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:37:28,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:37:28,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:37:28,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,771 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 831 [2024-11-28 02:37:28,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:37:28,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:37:28,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:37:28,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:37:28,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,887 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-28 02:37:28,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:28,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:37:28,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:37:28,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:37:28,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:37:28,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (1/1) ... [2024-11-28 02:37:29,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:37:29,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:37:29,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:37:29,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:37:29,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:37:29,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:37:29,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:37:29,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:37:29,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:37:29,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:37:29,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:37:29,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:37:29,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:37:29,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:37:29,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:37:29,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:37:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:37:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:37:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:37:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:37:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:37:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:37:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:37:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:37:29,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:37:29,330 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:37:29,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:37:29,337 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:37:29,402 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:37:31,888 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2024-11-28 02:37:31,888 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:37:31,942 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:37:31,942 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-28 02:37:31,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:31 BoogieIcfgContainer [2024-11-28 02:37:31,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:37:31,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:37:31,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:37:31,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:37:31,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:37:27" (1/3) ... [2024-11-28 02:37:31,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c52ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:31, skipping insertion in model container [2024-11-28 02:37:31,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:28" (2/3) ... [2024-11-28 02:37:31,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c52ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:31, skipping insertion in model container [2024-11-28 02:37:31,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:31" (3/3) ... [2024-11-28 02:37:31,962 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-1.i [2024-11-28 02:37:31,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:37:31,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test1-1.i that has 4 procedures, 764 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-28 02:37:32,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:37:32,075 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;@74eb0ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:37:32,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-28 02:37:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 759 states, 426 states have (on average 2.0586854460093895) internal successors, (877), 753 states have internal predecessors, (877), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:37:32,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:32,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:37:32,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:32,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1460981578, now seen corresponding path program 1 times [2024-11-28 02:37:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:32,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111849304] [2024-11-28 02:37:32,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:32,296 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-28 02:37:32,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:32,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111849304] [2024-11-28 02:37:32,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111849304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:32,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:32,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:37:32,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729308786] [2024-11-28 02:37:32,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:32,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:37:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:32,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:37:32,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:37:32,344 INFO L87 Difference]: Start difference. First operand has 759 states, 426 states have (on average 2.0586854460093895) internal successors, (877), 753 states have internal predecessors, (877), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-28 02:37:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:32,433 INFO L93 Difference]: Finished difference Result 749 states and 856 transitions. [2024-11-28 02:37:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:37:32,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-28 02:37:32,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:32,452 INFO L225 Difference]: With dead ends: 749 [2024-11-28 02:37:32,452 INFO L226 Difference]: Without dead ends: 747 [2024-11-28 02:37:32,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:37:32,458 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:32,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:37:32,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-11-28 02:37:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2024-11-28 02:37:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 420 states have (on average 1.9714285714285715) internal successors, (828), 741 states have internal predecessors, (828), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 854 transitions. [2024-11-28 02:37:32,605 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 854 transitions. Word has length 6 [2024-11-28 02:37:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:32,605 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 854 transitions. [2024-11-28 02:37:32,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-28 02:37:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 854 transitions. [2024-11-28 02:37:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:37:32,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:32,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:37:32,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:37:32,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:32,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-11-28 02:37:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:32,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257104514] [2024-11-28 02:37:32,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:32,745 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-28 02:37:32,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:32,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257104514] [2024-11-28 02:37:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257104514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:37:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750892718] [2024-11-28 02:37:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:37:32,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:32,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:37:32,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:37:32,749 INFO L87 Difference]: Start difference. First operand 747 states and 854 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:37:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:33,747 INFO L93 Difference]: Finished difference Result 701 states and 809 transitions. [2024-11-28 02:37:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:37:33,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 02:37:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:33,751 INFO L225 Difference]: With dead ends: 701 [2024-11-28 02:37:33,752 INFO L226 Difference]: Without dead ends: 701 [2024-11-28 02:37:33,752 INFO L434 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-28 02:37:33,753 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 698 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:33,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 510 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:37:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-28 02:37:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 698. [2024-11-28 02:37:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 420 states have (on average 1.8547619047619048) internal successors, (779), 692 states have internal predecessors, (779), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 805 transitions. [2024-11-28 02:37:33,783 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 805 transitions. Word has length 6 [2024-11-28 02:37:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:33,783 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 805 transitions. [2024-11-28 02:37:33,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:37:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 805 transitions. [2024-11-28 02:37:33,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:37:33,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:33,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:37:33,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:37:33,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:33,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:33,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-11-28 02:37:33,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:33,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842106897] [2024-11-28 02:37:33,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:33,926 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-28 02:37:33,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:33,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842106897] [2024-11-28 02:37:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842106897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:33,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:37:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771537260] [2024-11-28 02:37:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:33,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:37:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:33,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:37:33,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:37:33,929 INFO L87 Difference]: Start difference. First operand 698 states and 805 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:37:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:34,669 INFO L93 Difference]: Finished difference Result 777 states and 890 transitions. [2024-11-28 02:37:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:37:34,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 02:37:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:34,676 INFO L225 Difference]: With dead ends: 777 [2024-11-28 02:37:34,677 INFO L226 Difference]: Without dead ends: 777 [2024-11-28 02:37:34,677 INFO L434 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-28 02:37:34,678 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 413 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:34,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 916 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:37:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-28 02:37:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 728. [2024-11-28 02:37:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 460 states have (on average 1.8434782608695652) internal successors, (848), 722 states have internal predecessors, (848), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 874 transitions. [2024-11-28 02:37:34,725 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 874 transitions. Word has length 6 [2024-11-28 02:37:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:34,726 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 874 transitions. [2024-11-28 02:37:34,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:37:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 874 transitions. [2024-11-28 02:37:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:37:34,727 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:34,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:37:34,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:37:34,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:34,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1423415127, now seen corresponding path program 1 times [2024-11-28 02:37:34,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:34,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227622672] [2024-11-28 02:37:34,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:34,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:34,792 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-28 02:37:34,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:34,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227622672] [2024-11-28 02:37:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227622672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:34,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:37:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452265895] [2024-11-28 02:37:34,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:34,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:37:34,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:34,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:37:34,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:37:34,794 INFO L87 Difference]: Start difference. First operand 728 states and 874 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:37:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:34,864 INFO L93 Difference]: Finished difference Result 1406 states and 1678 transitions. [2024-11-28 02:37:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:37:34,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 02:37:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:34,872 INFO L225 Difference]: With dead ends: 1406 [2024-11-28 02:37:34,872 INFO L226 Difference]: Without dead ends: 1406 [2024-11-28 02:37:34,872 INFO L434 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-28 02:37:34,873 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 718 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:34,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1580 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:37:34,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-11-28 02:37:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 729. [2024-11-28 02:37:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 461 states have (on average 1.841648590021692) internal successors, (849), 723 states have internal predecessors, (849), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 875 transitions. [2024-11-28 02:37:34,922 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 875 transitions. Word has length 6 [2024-11-28 02:37:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:34,923 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 875 transitions. [2024-11-28 02:37:34,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:37:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 875 transitions. [2024-11-28 02:37:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 02:37:34,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:34,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:37:34,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:37:34,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:34,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262039, now seen corresponding path program 1 times [2024-11-28 02:37:34,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:34,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628639273] [2024-11-28 02:37:34,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:34,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:35,078 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-28 02:37:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:35,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628639273] [2024-11-28 02:37:35,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628639273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:35,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:35,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:37:35,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368352127] [2024-11-28 02:37:35,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:35,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:37:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:35,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:37:35,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:37:35,082 INFO L87 Difference]: Start difference. First operand 729 states and 875 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 02:37:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:36,024 INFO L93 Difference]: Finished difference Result 756 states and 929 transitions. [2024-11-28 02:37:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:37:36,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-28 02:37:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:36,030 INFO L225 Difference]: With dead ends: 756 [2024-11-28 02:37:36,030 INFO L226 Difference]: Without dead ends: 756 [2024-11-28 02:37:36,031 INFO L434 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-28 02:37:36,034 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 966 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:36,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 796 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:37:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-28 02:37:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 706. [2024-11-28 02:37:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 461 states have (on average 1.79175704989154) internal successors, (826), 700 states have internal predecessors, (826), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 852 transitions. [2024-11-28 02:37:36,071 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 852 transitions. Word has length 12 [2024-11-28 02:37:36,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:36,072 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 852 transitions. [2024-11-28 02:37:36,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 02:37:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 852 transitions. [2024-11-28 02:37:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 02:37:36,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:36,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:37:36,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:37:36,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:36,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262040, now seen corresponding path program 1 times [2024-11-28 02:37:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:36,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117113605] [2024-11-28 02:37:36,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:36,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:36,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-28 02:37:36,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:36,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117113605] [2024-11-28 02:37:36,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117113605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:36,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:36,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:37:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161508111] [2024-11-28 02:37:36,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:36,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:37:36,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:36,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:37:36,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:37:36,248 INFO L87 Difference]: Start difference. First operand 706 states and 852 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-28 02:37:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:36,292 INFO L93 Difference]: Finished difference Result 631 states and 749 transitions. [2024-11-28 02:37:36,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:37:36,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-11-28 02:37:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:36,298 INFO L225 Difference]: With dead ends: 631 [2024-11-28 02:37:36,299 INFO L226 Difference]: Without dead ends: 631 [2024-11-28 02:37:36,299 INFO L434 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-28 02:37:36,301 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 61 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1261 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-28 02:37:36,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1261 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:37:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-28 02:37:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2024-11-28 02:37:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 398 states have (on average 1.8165829145728642) internal successors, (723), 625 states have internal predecessors, (723), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 749 transitions. [2024-11-28 02:37:36,329 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 749 transitions. Word has length 12 [2024-11-28 02:37:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:36,329 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 749 transitions. [2024-11-28 02:37:36,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-28 02:37:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 749 transitions. [2024-11-28 02:37:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 02:37:36,330 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:36,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:37:36,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:37:36,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:36,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash 23145585, now seen corresponding path program 1 times [2024-11-28 02:37:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:36,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108888730] [2024-11-28 02:37:36,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:36,483 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-28 02:37:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108888730] [2024-11-28 02:37:36,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108888730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:36,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:36,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:37:36,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013908145] [2024-11-28 02:37:36,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:36,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:37:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:36,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:37:36,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:37:36,485 INFO L87 Difference]: Start difference. First operand 631 states and 749 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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-28 02:37:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:36,569 INFO L93 Difference]: Finished difference Result 613 states and 724 transitions. [2024-11-28 02:37:36,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:37:36,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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-28 02:37:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:36,572 INFO L225 Difference]: With dead ends: 613 [2024-11-28 02:37:36,573 INFO L226 Difference]: Without dead ends: 613 [2024-11-28 02:37:36,573 INFO L434 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-28 02:37:36,574 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 41 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:36,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1838 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:37:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-28 02:37:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2024-11-28 02:37:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 384 states have (on average 1.8098958333333333) internal successors, (695), 604 states have internal predecessors, (695), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 721 transitions. [2024-11-28 02:37:36,596 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 721 transitions. Word has length 14 [2024-11-28 02:37:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:36,597 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 721 transitions. [2024-11-28 02:37:36,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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-28 02:37:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 721 transitions. [2024-11-28 02:37:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 02:37:36,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:36,598 INFO L218 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] [2024-11-28 02:37:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:37:36,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:36,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1739855297, now seen corresponding path program 1 times [2024-11-28 02:37:36,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:36,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820557724] [2024-11-28 02:37:36,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:36,897 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-28 02:37:36,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:36,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820557724] [2024-11-28 02:37:36,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820557724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:36,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:36,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:37:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039816588] [2024-11-28 02:37:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:36,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:37:36,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:36,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:37:36,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:37:36,899 INFO L87 Difference]: Start difference. First operand 610 states and 721 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-28 02:37:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:37,655 INFO L93 Difference]: Finished difference Result 704 states and 809 transitions. [2024-11-28 02:37:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:37:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2024-11-28 02:37:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:37,659 INFO L225 Difference]: With dead ends: 704 [2024-11-28 02:37:37,660 INFO L226 Difference]: Without dead ends: 704 [2024-11-28 02:37:37,660 INFO L434 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-28 02:37:37,661 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 418 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:37,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1141 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:37:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-28 02:37:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 606. [2024-11-28 02:37:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 384 states have (on average 1.7994791666666667) internal successors, (691), 600 states have internal predecessors, (691), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 717 transitions. [2024-11-28 02:37:37,680 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 717 transitions. Word has length 28 [2024-11-28 02:37:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:37,683 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 717 transitions. [2024-11-28 02:37:37,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-28 02:37:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 717 transitions. [2024-11-28 02:37:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 02:37:37,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:37,684 INFO L218 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] [2024-11-28 02:37:37,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:37:37,685 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:37,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1055550923, now seen corresponding path program 1 times [2024-11-28 02:37:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:37,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883655976] [2024-11-28 02:37:37,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:37,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:37,877 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-28 02:37:37,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:37,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883655976] [2024-11-28 02:37:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883655976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:37,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:37,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:37:37,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750450986] [2024-11-28 02:37:37,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:37,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:37:37,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:37,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:37:37,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:37:37,880 INFO L87 Difference]: Start difference. First operand 606 states and 717 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-28 02:37:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:37,956 INFO L93 Difference]: Finished difference Result 606 states and 713 transitions. [2024-11-28 02:37:37,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:37:37,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2024-11-28 02:37:37,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:37,960 INFO L225 Difference]: With dead ends: 606 [2024-11-28 02:37:37,960 INFO L226 Difference]: Without dead ends: 606 [2024-11-28 02:37:37,960 INFO L434 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-28 02:37:37,961 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 21 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:37,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1820 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:37:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-28 02:37:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-28 02:37:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 384 states have (on average 1.7890625) internal successors, (687), 600 states have internal predecessors, (687), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 713 transitions. [2024-11-28 02:37:37,979 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 713 transitions. Word has length 62 [2024-11-28 02:37:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:37,981 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 713 transitions. [2024-11-28 02:37:37,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-28 02:37:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 713 transitions. [2024-11-28 02:37:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 02:37:37,983 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:37,983 INFO L218 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] [2024-11-28 02:37:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:37:37,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:37,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash -680482047, now seen corresponding path program 1 times [2024-11-28 02:37:37,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:37,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843734461] [2024-11-28 02:37:37,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:38,218 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-28 02:37:38,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:38,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843734461] [2024-11-28 02:37:38,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843734461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:38,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:38,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:37:38,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785084659] [2024-11-28 02:37:38,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:38,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:37:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:38,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:37:38,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:37:38,220 INFO L87 Difference]: Start difference. First operand 606 states and 713 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:37:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:38,285 INFO L93 Difference]: Finished difference Result 699 states and 833 transitions. [2024-11-28 02:37:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:37:38,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 02:37:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:38,290 INFO L225 Difference]: With dead ends: 699 [2024-11-28 02:37:38,290 INFO L226 Difference]: Without dead ends: 699 [2024-11-28 02:37:38,290 INFO L434 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-28 02:37:38,292 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 54 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:38,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1236 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:37:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-28 02:37:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-28 02:37:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 477 states have (on average 1.6918238993710693) internal successors, (807), 693 states have internal predecessors, (807), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 833 transitions. [2024-11-28 02:37:38,320 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 833 transitions. Word has length 70 [2024-11-28 02:37:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:38,322 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 833 transitions. [2024-11-28 02:37:38,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:37:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 833 transitions. [2024-11-28 02:37:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 02:37:38,326 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:38,326 INFO L218 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] [2024-11-28 02:37:38,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:37:38,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:38,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash -104075831, now seen corresponding path program 1 times [2024-11-28 02:37:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:38,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785579235] [2024-11-28 02:37:38,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:38,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:39,342 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-28 02:37:39,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:39,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785579235] [2024-11-28 02:37:39,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785579235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:39,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:39,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:37:39,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318162676] [2024-11-28 02:37:39,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:39,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:37:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:39,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:37:39,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:37:39,346 INFO L87 Difference]: Start difference. First operand 699 states and 833 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:37:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:40,195 INFO L93 Difference]: Finished difference Result 661 states and 795 transitions. [2024-11-28 02:37:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:37:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-28 02:37:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:40,198 INFO L225 Difference]: With dead ends: 661 [2024-11-28 02:37:40,198 INFO L226 Difference]: Without dead ends: 661 [2024-11-28 02:37:40,199 INFO L434 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-28 02:37:40,199 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 916 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:40,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 542 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:37:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-28 02:37:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 621. [2024-11-28 02:37:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 437 states have (on average 1.5789473684210527) internal successors, (690), 615 states have internal predecessors, (690), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 716 transitions. [2024-11-28 02:37:40,215 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 716 transitions. Word has length 73 [2024-11-28 02:37:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:40,215 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 716 transitions. [2024-11-28 02:37:40,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:37:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 716 transitions. [2024-11-28 02:37:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 02:37:40,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:40,217 INFO L218 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] [2024-11-28 02:37:40,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:37:40,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:40,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1353945236, now seen corresponding path program 1 times [2024-11-28 02:37:40,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:40,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102992382] [2024-11-28 02:37:40,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:40,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:40,656 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-28 02:37:40,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:40,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102992382] [2024-11-28 02:37:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102992382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:40,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:40,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:37:40,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370805733] [2024-11-28 02:37:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:40,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:37:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:40,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:37:40,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:37:40,659 INFO L87 Difference]: Start difference. First operand 621 states and 716 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-28 02:37:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:41,412 INFO L93 Difference]: Finished difference Result 620 states and 715 transitions. [2024-11-28 02:37:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:37:41,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2024-11-28 02:37:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:41,415 INFO L225 Difference]: With dead ends: 620 [2024-11-28 02:37:41,415 INFO L226 Difference]: Without dead ends: 620 [2024-11-28 02:37:41,416 INFO L434 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-28 02:37:41,416 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 2 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:41,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1673 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:37:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-28 02:37:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2024-11-28 02:37:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 437 states have (on average 1.5766590389016018) internal successors, (689), 614 states have internal predecessors, (689), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2024-11-28 02:37:41,432 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 78 [2024-11-28 02:37:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:41,432 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2024-11-28 02:37:41,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-28 02:37:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2024-11-28 02:37:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 02:37:41,434 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:41,434 INFO L218 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] [2024-11-28 02:37:41,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:37:41,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:41,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1353945237, now seen corresponding path program 1 times [2024-11-28 02:37:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:41,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519957394] [2024-11-28 02:37:41,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:42,033 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-28 02:37:42,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519957394] [2024-11-28 02:37:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519957394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:37:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376283871] [2024-11-28 02:37:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:42,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:37:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:42,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:37:42,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:37:42,036 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-28 02:37:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:42,756 INFO L93 Difference]: Finished difference Result 619 states and 714 transitions. [2024-11-28 02:37:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:37:42,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2024-11-28 02:37:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:42,759 INFO L225 Difference]: With dead ends: 619 [2024-11-28 02:37:42,759 INFO L226 Difference]: Without dead ends: 619 [2024-11-28 02:37:42,759 INFO L434 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-28 02:37:42,760 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 1 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:42,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1680 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:37:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-28 02:37:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2024-11-28 02:37:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 436 states have (on average 1.5779816513761469) internal successors, (688), 613 states have internal predecessors, (688), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 714 transitions. [2024-11-28 02:37:42,776 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 714 transitions. Word has length 78 [2024-11-28 02:37:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:42,776 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 714 transitions. [2024-11-28 02:37:42,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-28 02:37:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 714 transitions. [2024-11-28 02:37:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 02:37:42,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:42,780 INFO L218 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] [2024-11-28 02:37:42,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:37:42,781 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:42,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash -474028485, now seen corresponding path program 1 times [2024-11-28 02:37:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:42,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967314469] [2024-11-28 02:37:42,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:42,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:43,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-28 02:37:43,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:43,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967314469] [2024-11-28 02:37:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967314469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:43,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:43,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:37:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130301420] [2024-11-28 02:37:43,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:43,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:37:43,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:43,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:37:43,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:37:43,068 INFO L87 Difference]: Start difference. First operand 619 states and 714 transitions. Second operand has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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-28 02:37:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:44,227 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-28 02:37:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:37:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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 86 [2024-11-28 02:37:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:44,231 INFO L225 Difference]: With dead ends: 631 [2024-11-28 02:37:44,232 INFO L226 Difference]: Without dead ends: 631 [2024-11-28 02:37:44,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:37:44,233 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 12 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:44,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2501 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 02:37:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-28 02:37:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 625. [2024-11-28 02:37:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 441 states have (on average 1.5759637188208617) internal successors, (695), 618 states have internal predecessors, (695), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-28 02:37:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 724 transitions. [2024-11-28 02:37:44,256 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 724 transitions. Word has length 86 [2024-11-28 02:37:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:44,256 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 724 transitions. [2024-11-28 02:37:44,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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-28 02:37:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 724 transitions. [2024-11-28 02:37:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 02:37:44,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:44,258 INFO L218 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] [2024-11-28 02:37:44,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:37:44,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:44,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -474028484, now seen corresponding path program 1 times [2024-11-28 02:37:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:44,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988766299] [2024-11-28 02:37:44,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:44,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:44,970 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-28 02:37:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:44,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988766299] [2024-11-28 02:37:44,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988766299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:44,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:44,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:37:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819496977] [2024-11-28 02:37:44,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:44,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:37:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:44,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:37:44,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:37:44,973 INFO L87 Difference]: Start difference. First operand 625 states and 724 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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-28 02:37:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:46,044 INFO L93 Difference]: Finished difference Result 625 states and 723 transitions. [2024-11-28 02:37:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:37:46,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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 86 [2024-11-28 02:37:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:46,047 INFO L225 Difference]: With dead ends: 625 [2024-11-28 02:37:46,047 INFO L226 Difference]: Without dead ends: 625 [2024-11-28 02:37:46,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:37:46,051 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 7 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:46,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2077 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 02:37:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-28 02:37:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2024-11-28 02:37:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 441 states have (on average 1.5736961451247165) internal successors, (694), 618 states have internal predecessors, (694), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-28 02:37:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 723 transitions. [2024-11-28 02:37:46,074 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 723 transitions. Word has length 86 [2024-11-28 02:37:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:46,074 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 723 transitions. [2024-11-28 02:37:46,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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-28 02:37:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 723 transitions. [2024-11-28 02:37:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 02:37:46,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:46,076 INFO L218 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-28 02:37:46,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:37:46,077 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:46,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash -583308546, now seen corresponding path program 1 times [2024-11-28 02:37:46,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:46,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613308222] [2024-11-28 02:37:46,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:46,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:46,746 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-28 02:37:46,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:46,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613308222] [2024-11-28 02:37:46,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613308222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:37:46,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076553626] [2024-11-28 02:37:46,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:46,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:37:46,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:37:46,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:37:46,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:37:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:47,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:37:47,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:37:47,053 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-28 02:37:47,199 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:37:47,199 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-28 02:37:47,212 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-28 02:37:47,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:37:47,292 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-28 02:37:47,330 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-28 02:37:47,335 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-28 02:37:47,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:37:47,405 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 02:37:47,405 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-28 02:37:47,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-28 02:37:47,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076553626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:37:47,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:37:47,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-28 02:37:47,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420553031] [2024-11-28 02:37:47,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:37:47,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:37:47,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:47,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:37:47,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-28 02:37:47,437 INFO L87 Difference]: Start difference. First operand 625 states and 723 transitions. Second operand has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:37:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:49,839 INFO L93 Difference]: Finished difference Result 624 states and 722 transitions. [2024-11-28 02:37:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:37:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-28 02:37:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:49,841 INFO L225 Difference]: With dead ends: 624 [2024-11-28 02:37:49,841 INFO L226 Difference]: Without dead ends: 624 [2024-11-28 02:37:49,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-28 02:37:49,843 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 500 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 3618 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:49,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 3618 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 02:37:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-28 02:37:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2024-11-28 02:37:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 441 states have (on average 1.5714285714285714) internal successors, (693), 617 states have internal predecessors, (693), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-28 02:37:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 722 transitions. [2024-11-28 02:37:49,861 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 722 transitions. Word has length 87 [2024-11-28 02:37:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:49,861 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 722 transitions. [2024-11-28 02:37:49,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:37:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 722 transitions. [2024-11-28 02:37:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 02:37:49,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:49,862 INFO L218 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-28 02:37:49,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:37:50,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 02:37:50,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:50,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:50,064 INFO L85 PathProgramCache]: Analyzing trace with hash -583308545, now seen corresponding path program 1 times [2024-11-28 02:37:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:50,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488950127] [2024-11-28 02:37:50,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:51,047 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-28 02:37:51,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:51,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488950127] [2024-11-28 02:37:51,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488950127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:37:51,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257319394] [2024-11-28 02:37:51,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:51,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:37:51,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:37:51,051 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:37:51,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:37:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:51,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 02:37:51,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:37:51,332 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-28 02:37:51,499 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:37:51,499 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-28 02:37:51,506 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-28 02:37:51,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:37:51,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-28 02:37:51,689 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-28 02:37:51,695 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-28 02:37:51,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:37:51,851 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-28 02:37:51,858 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-28 02:37:51,922 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-28 02:37:51,931 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-28 02:37:51,962 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-28 02:37:51,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:37:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257319394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:37:52,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:37:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-28 02:37:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22905187] [2024-11-28 02:37:52,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:37:52,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:37:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:52,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:37:52,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=352, Unknown=7, NotChecked=0, Total=420 [2024-11-28 02:37:52,170 INFO L87 Difference]: Start difference. First operand 624 states and 722 transitions. Second operand has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 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-28 02:37:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:54,899 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-28 02:37:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:37:54,899 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 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 87 [2024-11-28 02:37:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:54,902 INFO L225 Difference]: With dead ends: 631 [2024-11-28 02:37:54,902 INFO L226 Difference]: Without dead ends: 631 [2024-11-28 02:37:54,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=498, Unknown=7, NotChecked=0, Total=600 [2024-11-28 02:37:54,903 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 498 mSDsluCounter, 2539 mSDsCounter, 0 mSdLazyCounter, 3000 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2902 SdHoareTripleChecker+Invalid, 3028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:54,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2902 Invalid, 3028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3000 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 02:37:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-28 02:37:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 622. [2024-11-28 02:37:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 440 states have (on average 1.5704545454545455) internal successors, (691), 615 states have internal predecessors, (691), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:37:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 717 transitions. [2024-11-28 02:37:54,920 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 717 transitions. Word has length 87 [2024-11-28 02:37:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:54,920 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 717 transitions. [2024-11-28 02:37:54,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 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-28 02:37:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 717 transitions. [2024-11-28 02:37:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 02:37:54,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:54,921 INFO L218 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] [2024-11-28 02:37:54,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:37:55,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 02:37:55,126 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:55,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 70484336, now seen corresponding path program 1 times [2024-11-28 02:37:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:55,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193995158] [2024-11-28 02:37:55,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:55,742 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-28 02:37:55,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:55,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193995158] [2024-11-28 02:37:55,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193995158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:55,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:55,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:37:55,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737079455] [2024-11-28 02:37:55,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:55,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:37:55,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:55,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:37:55,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:37:55,744 INFO L87 Difference]: Start difference. First operand 622 states and 717 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 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-28 02:37:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:57,270 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-28 02:37:57,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:37:57,272 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 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 89 [2024-11-28 02:37:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:57,273 INFO L225 Difference]: With dead ends: 635 [2024-11-28 02:37:57,274 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 02:37:57,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:37:57,274 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 511 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:57,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2662 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 02:37:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 02:37:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-28 02:37:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 448 states have (on average 1.5647321428571428) internal successors, (701), 623 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:37:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 728 transitions. [2024-11-28 02:37:57,288 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 728 transitions. Word has length 89 [2024-11-28 02:37:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:57,288 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 728 transitions. [2024-11-28 02:37:57,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 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-28 02:37:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 728 transitions. [2024-11-28 02:37:57,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 02:37:57,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:57,289 INFO L218 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] [2024-11-28 02:37:57,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:37:57,290 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:57,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash 70484337, now seen corresponding path program 1 times [2024-11-28 02:37:57,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:57,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702440426] [2024-11-28 02:37:57,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:57,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:58,113 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-28 02:37:58,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:58,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702440426] [2024-11-28 02:37:58,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702440426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:37:58,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:37:58,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:37:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003349436] [2024-11-28 02:37:58,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:37:58,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:37:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:58,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:37:58,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:37:58,116 INFO L87 Difference]: Start difference. First operand 631 states and 728 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 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-28 02:37:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:59,843 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-28 02:37:59,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:37:59,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 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 89 [2024-11-28 02:37:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:59,846 INFO L225 Difference]: With dead ends: 634 [2024-11-28 02:37:59,846 INFO L226 Difference]: Without dead ends: 634 [2024-11-28 02:37:59,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:37:59,847 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 521 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:59,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2315 Invalid, 2429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:37:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-28 02:37:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-28 02:37:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 448 states have (on average 1.5625) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:37:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2024-11-28 02:37:59,864 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 89 [2024-11-28 02:37:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:59,864 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2024-11-28 02:37:59,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 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-28 02:37:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2024-11-28 02:37:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 02:37:59,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:59,866 INFO L218 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-28 02:37:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:37:59,866 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:37:59,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash 93397453, now seen corresponding path program 1 times [2024-11-28 02:37:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004727891] [2024-11-28 02:37:59,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:00,605 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-28 02:38:00,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:00,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004727891] [2024-11-28 02:38:00,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004727891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:00,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204284590] [2024-11-28 02:38:00,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:00,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:00,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:00,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:00,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:38:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:00,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 02:38:00,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:00,831 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-28 02:38:00,959 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:38:00,959 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-28 02:38:00,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-28 02:38:01,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:01,042 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-28 02:38:01,128 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:01,129 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-28 02:38:01,147 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-28 02:38:01,150 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-28 02:38:01,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:01,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:38:01,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (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_880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 02:38:01,226 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 02:38:01,227 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-28 02:38:01,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204284590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:01,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:38:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 02:38:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644053208] [2024-11-28 02:38:01,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:01,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:38:01,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:01,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:38:01,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=9, NotChecked=62, Total=342 [2024-11-28 02:38:01,276 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 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-28 02:38:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:03,262 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-28 02:38:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:38:03,263 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 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-28 02:38:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:03,265 INFO L225 Difference]: With dead ends: 633 [2024-11-28 02:38:03,265 INFO L226 Difference]: Without dead ends: 633 [2024-11-28 02:38:03,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=451, Unknown=9, NotChecked=90, Total=650 [2024-11-28 02:38:03,267 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 498 mSDsluCounter, 3248 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 3608 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:03,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 3608 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:38:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-28 02:38:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-28 02:38:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 448 states have (on average 1.5602678571428572) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-28 02:38:03,282 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 90 [2024-11-28 02:38:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:03,283 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-28 02:38:03,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 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-28 02:38:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-28 02:38:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 02:38:03,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:03,284 INFO L218 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-28 02:38:03,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:38:03,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:03,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:03,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 93397454, now seen corresponding path program 1 times [2024-11-28 02:38:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:03,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524932399] [2024-11-28 02:38:03,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:04,552 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-28 02:38:04,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524932399] [2024-11-28 02:38:04,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524932399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347101859] [2024-11-28 02:38:04,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:04,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:04,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:04,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:04,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:38:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:04,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 02:38:04,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:04,849 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-28 02:38:05,033 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-28 02:38:05,049 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:38:05,049 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-28 02:38:05,091 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-28 02:38:05,096 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-28 02:38:05,212 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-28 02:38:05,218 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-28 02:38:05,408 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:05,408 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-28 02:38:05,415 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-28 02:38:05,545 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:05,546 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-28 02:38:05,557 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-28 02:38:05,580 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-28 02:38:05,585 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-28 02:38:05,618 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-28 02:38:05,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:05,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |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~mem52#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1020 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:38:05,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1027) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026))) (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_1027) .cse1 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 02:38:05,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347101859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:05,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:38:05,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-28 02:38:05,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674265102] [2024-11-28 02:38:05,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:05,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:38:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:05,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:38:05,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=422, Unknown=14, NotChecked=86, Total=600 [2024-11-28 02:38:05,886 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 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-28 02:38:08,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:08,555 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-28 02:38:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:38:08,556 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 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 90 [2024-11-28 02:38:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:08,559 INFO L225 Difference]: With dead ends: 632 [2024-11-28 02:38:08,559 INFO L226 Difference]: Without dead ends: 632 [2024-11-28 02:38:08,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=625, Unknown=14, NotChecked=106, Total=870 [2024-11-28 02:38:08,563 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 504 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 3083 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2840 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:08,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2840 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3083 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 02:38:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-28 02:38:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2024-11-28 02:38:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 440 states have (on average 1.565909090909091) internal successors, (689), 613 states have internal predecessors, (689), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:38:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2024-11-28 02:38:08,579 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 90 [2024-11-28 02:38:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:08,581 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2024-11-28 02:38:08,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 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-28 02:38:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2024-11-28 02:38:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 02:38:08,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:08,583 INFO L218 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] [2024-11-28 02:38:08,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:38:08,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:08,784 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:08,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash -439535294, now seen corresponding path program 1 times [2024-11-28 02:38:08,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:08,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032581107] [2024-11-28 02:38:08,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:08,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:09,591 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-28 02:38:09,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032581107] [2024-11-28 02:38:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032581107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:38:09,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:38:09,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:38:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945114123] [2024-11-28 02:38:09,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:38:09,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:38:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:09,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:38:09,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:38:09,594 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 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-28 02:38:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:11,732 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-28 02:38:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:38:11,736 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 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 92 [2024-11-28 02:38:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:11,739 INFO L225 Difference]: With dead ends: 636 [2024-11-28 02:38:11,739 INFO L226 Difference]: Without dead ends: 636 [2024-11-28 02:38:11,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:38:11,741 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 512 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 2624 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3271 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:11,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 3271 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2624 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:38:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-28 02:38:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 632. [2024-11-28 02:38:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 451 states have (on average 1.5565410199556542) internal successors, (702), 624 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 729 transitions. [2024-11-28 02:38:11,757 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 729 transitions. Word has length 92 [2024-11-28 02:38:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:11,758 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 729 transitions. [2024-11-28 02:38:11,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 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-28 02:38:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 729 transitions. [2024-11-28 02:38:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 02:38:11,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:11,760 INFO L218 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] [2024-11-28 02:38:11,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:38:11,760 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:11,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash -439535293, now seen corresponding path program 1 times [2024-11-28 02:38:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:11,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310923004] [2024-11-28 02:38:11,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:12,843 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-28 02:38:12,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310923004] [2024-11-28 02:38:12,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310923004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:38:12,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:38:12,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:38:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851883429] [2024-11-28 02:38:12,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:38:12,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:38:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:12,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:38:12,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:38:12,846 INFO L87 Difference]: Start difference. First operand 632 states and 729 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 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-28 02:38:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:14,664 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-28 02:38:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:38:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 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 92 [2024-11-28 02:38:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:14,666 INFO L225 Difference]: With dead ends: 635 [2024-11-28 02:38:14,666 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 02:38:14,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:38:14,667 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 505 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:14,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 2102 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:38:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 02:38:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2024-11-28 02:38:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 451 states have (on average 1.5543237250554325) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2024-11-28 02:38:14,680 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 92 [2024-11-28 02:38:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:14,681 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2024-11-28 02:38:14,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 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-28 02:38:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2024-11-28 02:38:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:38:14,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:14,682 INFO L218 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-28 02:38:14,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:38:14,683 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:14,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash -734666811, now seen corresponding path program 1 times [2024-11-28 02:38:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83843911] [2024-11-28 02:38:14,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:15,549 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-28 02:38:15,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83843911] [2024-11-28 02:38:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83843911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128983901] [2024-11-28 02:38:15,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:15,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:15,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:15,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:15,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:38:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:15,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 02:38:15,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:15,867 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-28 02:38:16,024 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:38:16,024 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-28 02:38:16,038 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-28 02:38:16,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:16,123 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-28 02:38:16,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:16,195 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-28 02:38:16,275 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:16,275 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-28 02:38:16,294 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-28 02:38:16,300 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-28 02:38:16,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:16,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:38:16,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (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_1300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:38:16,516 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-28 02:38:16,516 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-28 02:38:16,528 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (Array Int Int))) (= (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_1304))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-28 02:38:16,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128983901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:16,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:38:16,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-28 02:38:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090791899] [2024-11-28 02:38:16,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:16,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:38:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:16,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:38:16,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=12, NotChecked=114, Total=506 [2024-11-28 02:38:16,532 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 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-28 02:38:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:18,816 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-28 02:38:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:38:18,816 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 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-28 02:38:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:18,819 INFO L225 Difference]: With dead ends: 634 [2024-11-28 02:38:18,819 INFO L226 Difference]: Without dead ends: 634 [2024-11-28 02:38:18,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=12, NotChecked=162, Total=930 [2024-11-28 02:38:18,820 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 492 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:18,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 3620 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 02:38:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-28 02:38:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-28 02:38:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 451 states have (on average 1.5521064301552105) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2024-11-28 02:38:18,834 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 93 [2024-11-28 02:38:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:18,835 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2024-11-28 02:38:18,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 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-28 02:38:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2024-11-28 02:38:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:38:18,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:18,836 INFO L218 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-28 02:38:18,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:38:19,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:19,041 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:19,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash -734666810, now seen corresponding path program 1 times [2024-11-28 02:38:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:19,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380263152] [2024-11-28 02:38:19,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:20,241 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-28 02:38:20,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:20,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380263152] [2024-11-28 02:38:20,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380263152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:20,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294363291] [2024-11-28 02:38:20,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:20,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:20,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:20,245 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:20,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:38:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:20,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 02:38:20,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:20,586 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-28 02:38:20,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:38:20,766 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-28 02:38:20,775 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-28 02:38:20,821 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-28 02:38:20,827 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-28 02:38:20,967 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-28 02:38:20,973 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-28 02:38:21,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:21,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 62 treesize of output 57 [2024-11-28 02:38:21,143 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-28 02:38:21,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:21,270 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-28 02:38:21,280 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-28 02:38:21,392 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:21,393 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-28 02:38:21,399 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 41 treesize of output 22 [2024-11-28 02:38:21,484 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-28 02:38:21,493 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 30 treesize of output 12 [2024-11-28 02:38:21,528 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-28 02:38:21,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:21,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1454))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_1454 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1454))) (or (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse2 .cse3 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))) is different from false [2024-11-28 02:38:22,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1462))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1454))) (or (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store .cse2 .cse3 v_ArrVal_1453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1462))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse8 v_ArrVal_1454))) (or (< (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1453))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-28 02:38:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294363291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:22,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:38:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-28 02:38:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17154074] [2024-11-28 02:38:22,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:22,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 02:38:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:22,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 02:38:22,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=8, NotChecked=106, Total=870 [2024-11-28 02:38:22,168 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 23 states, 20 states have (on average 7.4) internal successors, (148), 23 states have internal predecessors, (148), 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-28 02:38:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:26,247 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-28 02:38:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:38:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 23 states have internal predecessors, (148), 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 93 [2024-11-28 02:38:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:26,251 INFO L225 Difference]: With dead ends: 633 [2024-11-28 02:38:26,251 INFO L226 Difference]: Without dead ends: 633 [2024-11-28 02:38:26,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=8, NotChecked=130, Total=1260 [2024-11-28 02:38:26,252 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 495 mSDsluCounter, 3868 mSDsCounter, 0 mSdLazyCounter, 4542 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 4570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:26,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 4229 Invalid, 4570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4542 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 02:38:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-28 02:38:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 618. [2024-11-28 02:38:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 440 states have (on average 1.5613636363636363) internal successors, (687), 611 states have internal predecessors, (687), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:38:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-28 02:38:26,265 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 93 [2024-11-28 02:38:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:26,265 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-28 02:38:26,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 23 states have internal predecessors, (148), 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-28 02:38:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-28 02:38:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 02:38:26,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:26,268 INFO L218 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] [2024-11-28 02:38:26,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 02:38:26,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:26,473 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:26,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:26,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1159967575, now seen corresponding path program 1 times [2024-11-28 02:38:26,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:26,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871769821] [2024-11-28 02:38:26,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:26,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:27,339 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-28 02:38:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:27,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871769821] [2024-11-28 02:38:27,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871769821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:38:27,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:38:27,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:38:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903448003] [2024-11-28 02:38:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:38:27,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:38:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:27,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:38:27,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:38:27,342 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 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-28 02:38:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:29,334 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-28 02:38:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:38:29,335 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 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 95 [2024-11-28 02:38:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:29,337 INFO L225 Difference]: With dead ends: 637 [2024-11-28 02:38:29,337 INFO L226 Difference]: Without dead ends: 637 [2024-11-28 02:38:29,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-28 02:38:29,338 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 513 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:29,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 3296 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:38:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-28 02:38:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2024-11-28 02:38:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 454 states have (on average 1.5484581497797356) internal successors, (703), 625 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 730 transitions. [2024-11-28 02:38:29,350 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 730 transitions. Word has length 95 [2024-11-28 02:38:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:29,350 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 730 transitions. [2024-11-28 02:38:29,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 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-28 02:38:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 730 transitions. [2024-11-28 02:38:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 02:38:29,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:29,352 INFO L218 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] [2024-11-28 02:38:29,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 02:38:29,352 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:29,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:29,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1159967576, now seen corresponding path program 1 times [2024-11-28 02:38:29,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:29,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206417452] [2024-11-28 02:38:29,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:29,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:30,525 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-28 02:38:30,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:30,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206417452] [2024-11-28 02:38:30,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206417452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:38:30,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:38:30,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:38:30,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981070787] [2024-11-28 02:38:30,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:38:30,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:38:30,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:30,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:38:30,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:38:30,528 INFO L87 Difference]: Start difference. First operand 633 states and 730 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 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-28 02:38:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:32,129 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-28 02:38:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:38:32,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 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 95 [2024-11-28 02:38:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:32,132 INFO L225 Difference]: With dead ends: 636 [2024-11-28 02:38:32,133 INFO L226 Difference]: Without dead ends: 636 [2024-11-28 02:38:32,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:38:32,133 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 506 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:32,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1809 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 02:38:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-28 02:38:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-28 02:38:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 454 states have (on average 1.5462555066079295) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-28 02:38:32,145 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 95 [2024-11-28 02:38:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:32,146 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-28 02:38:32,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 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-28 02:38:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-28 02:38:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:38:32,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:32,147 INFO L218 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-28 02:38:32,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 02:38:32,148 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:32,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash 694999540, now seen corresponding path program 1 times [2024-11-28 02:38:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:32,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378595749] [2024-11-28 02:38:32,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:32,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:32,964 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-28 02:38:32,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:32,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378595749] [2024-11-28 02:38:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378595749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:32,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173429148] [2024-11-28 02:38:32,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:32,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:32,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:32,967 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:32,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:38:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:33,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 02:38:33,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:33,312 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-28 02:38:33,466 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:38:33,466 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-28 02:38:33,478 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-28 02:38:33,601 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:33,602 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-28 02:38:33,668 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:33,668 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-28 02:38:33,726 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:33,726 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-28 02:38:33,785 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:33,785 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-28 02:38:33,798 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-28 02:38:33,801 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-28 02:38:33,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:33,877 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (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_1760))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:38:33,886 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (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_1760))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:38:33,899 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (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_1759))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:38:33,910 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:38:33,973 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-28 02:38:33,973 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-28 02:38:33,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1764))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-28 02:38:33,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173429148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:33,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:38:33,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2024-11-28 02:38:33,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438099618] [2024-11-28 02:38:33,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:33,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:38:33,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:33,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:38:33,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=424, Unknown=15, NotChecked=230, Total=756 [2024-11-28 02:38:33,991 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:38:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:36,242 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-28 02:38:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:38:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-28 02:38:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:36,245 INFO L225 Difference]: With dead ends: 635 [2024-11-28 02:38:36,245 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 02:38:36,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=833, Unknown=15, NotChecked=320, Total=1332 [2024-11-28 02:38:36,246 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 498 mSDsluCounter, 3232 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:36,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 3590 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 02:38:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 02:38:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2024-11-28 02:38:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 454 states have (on average 1.5440528634361232) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2024-11-28 02:38:36,255 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 96 [2024-11-28 02:38:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:36,255 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2024-11-28 02:38:36,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:38:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2024-11-28 02:38:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:38:36,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:36,256 INFO L218 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-28 02:38:36,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 02:38:36,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 02:38:36,457 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:36,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash 694999541, now seen corresponding path program 1 times [2024-11-28 02:38:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:36,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194820231] [2024-11-28 02:38:36,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:38,027 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-28 02:38:38,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194820231] [2024-11-28 02:38:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194820231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214878156] [2024-11-28 02:38:38,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:38,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:38,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:38,030 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:38,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:38:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:38,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 02:38:38,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:38,376 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-28 02:38:38,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:38:38,497 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-28 02:38:38,506 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-28 02:38:38,513 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-28 02:38:38,519 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-28 02:38:38,591 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-28 02:38:38,596 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-28 02:38:38,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:38,740 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-28 02:38:38,748 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-28 02:38:38,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:38,838 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-28 02:38:38,849 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-28 02:38:38,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:38,979 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-28 02:38:38,986 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-28 02:38:39,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:39,058 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-28 02:38:39,067 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-28 02:38:39,087 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-28 02:38:39,096 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-28 02:38:39,100 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-28 02:38:39,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:39,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:38:39,202 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_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-28 02:38:39,230 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927))) (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_1928) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-28 02:38:39,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (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_1925) .cse0 v_ArrVal_1928) (select (select (store .cse1 .cse0 v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1927))) (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_1925) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 02:38:39,465 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_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1927))) (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_1925) .cse1 v_ArrVal_1928) .cse2 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (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_1925) .cse6 v_ArrVal_1928) (select (select (store .cse7 .cse6 v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-28 02:38:39,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1927))) (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_1935) .cse0 v_ArrVal_1925) .cse1 v_ArrVal_1928) .cse2 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1926))) (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_1935) .cse7 v_ArrVal_1925) .cse8 v_ArrVal_1928) (select (select (store .cse9 .cse8 v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-28 02:38:39,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214878156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:39,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:38:39,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-28 02:38:39,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379013110] [2024-11-28 02:38:39,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:39,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:38:39,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:39,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:38:39,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=421, Unknown=13, NotChecked=282, Total=812 [2024-11-28 02:38:39,572 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 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-28 02:38:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:42,772 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-28 02:38:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:38:42,772 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 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 96 [2024-11-28 02:38:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:42,774 INFO L225 Difference]: With dead ends: 634 [2024-11-28 02:38:42,774 INFO L226 Difference]: Without dead ends: 634 [2024-11-28 02:38:42,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=725, Unknown=13, NotChecked=366, Total=1260 [2024-11-28 02:38:42,776 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 490 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 3258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:42,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 3199 Invalid, 3258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 02:38:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-28 02:38:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 616. [2024-11-28 02:38:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 440 states have (on average 1.5568181818181819) internal successors, (685), 609 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:38:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 711 transitions. [2024-11-28 02:38:42,786 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 711 transitions. Word has length 96 [2024-11-28 02:38:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:42,787 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 711 transitions. [2024-11-28 02:38:42,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 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-28 02:38:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 711 transitions. [2024-11-28 02:38:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:38:42,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:42,788 INFO L218 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] [2024-11-28 02:38:42,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 02:38:42,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 02:38:42,989 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:42,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash -603493543, now seen corresponding path program 1 times [2024-11-28 02:38:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:42,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264385340] [2024-11-28 02:38:42,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:44,182 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-28 02:38:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264385340] [2024-11-28 02:38:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264385340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:38:44,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:38:44,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:38:44,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639498971] [2024-11-28 02:38:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:38:44,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:38:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:44,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:38:44,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:38:44,185 INFO L87 Difference]: Start difference. First operand 616 states and 711 transitions. Second operand has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 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-28 02:38:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:46,006 INFO L93 Difference]: Finished difference Result 639 states and 737 transitions. [2024-11-28 02:38:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:38:46,007 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 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 99 [2024-11-28 02:38:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:46,009 INFO L225 Difference]: With dead ends: 639 [2024-11-28 02:38:46,009 INFO L226 Difference]: Without dead ends: 639 [2024-11-28 02:38:46,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:38:46,011 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 515 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:46,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2981 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:38:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-28 02:38:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 635. [2024-11-28 02:38:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 458 states have (on average 1.539301310043668) internal successors, (705), 627 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 732 transitions. [2024-11-28 02:38:46,026 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 732 transitions. Word has length 99 [2024-11-28 02:38:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:46,026 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 732 transitions. [2024-11-28 02:38:46,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 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-28 02:38:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 732 transitions. [2024-11-28 02:38:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:38:46,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:46,027 INFO L218 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] [2024-11-28 02:38:46,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 02:38:46,027 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:46,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash -603493542, now seen corresponding path program 1 times [2024-11-28 02:38:46,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:46,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83331121] [2024-11-28 02:38:46,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:46,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:47,774 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-28 02:38:47,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83331121] [2024-11-28 02:38:47,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83331121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:38:47,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:38:47,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:38:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286878184] [2024-11-28 02:38:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:38:47,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:38:47,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:47,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:38:47,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:38:47,777 INFO L87 Difference]: Start difference. First operand 635 states and 732 transitions. Second operand has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 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-28 02:38:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:50,687 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2024-11-28 02:38:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:38:50,687 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 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 99 [2024-11-28 02:38:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:50,689 INFO L225 Difference]: With dead ends: 638 [2024-11-28 02:38:50,689 INFO L226 Difference]: Without dead ends: 638 [2024-11-28 02:38:50,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:38:50,690 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 506 mSDsluCounter, 3386 mSDsCounter, 0 mSdLazyCounter, 3898 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3743 SdHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:50,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3743 Invalid, 3924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3898 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:38:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-28 02:38:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2024-11-28 02:38:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 458 states have (on average 1.537117903930131) internal successors, (704), 627 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 731 transitions. [2024-11-28 02:38:50,698 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 731 transitions. Word has length 99 [2024-11-28 02:38:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:50,699 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 731 transitions. [2024-11-28 02:38:50,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 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-28 02:38:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 731 transitions. [2024-11-28 02:38:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:38:50,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:50,700 INFO L218 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-28 02:38:50,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 02:38:50,700 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:50,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1812857994, now seen corresponding path program 1 times [2024-11-28 02:38:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5955537] [2024-11-28 02:38:50,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:51,840 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-28 02:38:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5955537] [2024-11-28 02:38:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5955537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877506532] [2024-11-28 02:38:51,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:51,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:51,843 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:51,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:38:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:52,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 02:38:52,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:52,186 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-28 02:38:52,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:38:52,308 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-28 02:38:52,324 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-28 02:38:52,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:52,444 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-28 02:38:52,502 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:52,503 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-28 02:38:52,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:52,571 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-28 02:38:52,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:52,622 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-28 02:38:52,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:52,676 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-28 02:38:52,689 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-28 02:38:52,719 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 02:38:52,719 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-28 02:38:52,723 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-28 02:38:52,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:53,528 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-28 02:38:53,529 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-28 02:38:53,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877506532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:53,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:38:53,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 22 [2024-11-28 02:38:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642429818] [2024-11-28 02:38:53,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:53,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 02:38:53,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:53,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 02:38:53,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=920, Unknown=57, NotChecked=0, Total=1122 [2024-11-28 02:38:53,670 INFO L87 Difference]: Start difference. First operand 635 states and 731 transitions. Second operand has 23 states, 21 states have (on average 7.190476190476191) internal successors, (151), 23 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:38:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:55,655 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-28 02:38:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:38:55,656 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 7.190476190476191) internal successors, (151), 23 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-28 02:38:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:55,658 INFO L225 Difference]: With dead ends: 637 [2024-11-28 02:38:55,658 INFO L226 Difference]: Without dead ends: 637 [2024-11-28 02:38:55,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=1568, Unknown=57, NotChecked=0, Total=1892 [2024-11-28 02:38:55,659 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 491 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 3111 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 3917 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:55,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 3917 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3111 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 02:38:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-28 02:38:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 634. [2024-11-28 02:38:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 458 states have (on average 1.534934497816594) internal successors, (703), 626 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:38:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 730 transitions. [2024-11-28 02:38:55,674 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 730 transitions. Word has length 100 [2024-11-28 02:38:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:55,675 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 730 transitions. [2024-11-28 02:38:55,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 7.190476190476191) internal successors, (151), 23 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:38:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 730 transitions. [2024-11-28 02:38:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:38:55,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:55,676 INFO L218 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-28 02:38:55,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:38:55,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-28 02:38:55,880 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:38:55,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1812857993, now seen corresponding path program 1 times [2024-11-28 02:38:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858576027] [2024-11-28 02:38:55,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:55,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:57,049 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-28 02:38:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:57,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858576027] [2024-11-28 02:38:57,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858576027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:57,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817443343] [2024-11-28 02:38:57,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:57,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:57,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:57,052 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:57,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:38:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:57,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 02:38:57,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:57,359 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-28 02:38:57,485 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:38:57,485 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-28 02:38:57,493 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-28 02:38:57,529 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-28 02:38:57,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:38:57,647 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-28 02:38:57,651 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-28 02:38:57,830 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:57,831 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-28 02:38:57,836 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-28 02:38:57,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:57,961 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-28 02:38:57,965 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-28 02:38:58,062 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:58,063 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-28 02:38:58,067 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-28 02:38:58,176 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:58,176 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-28 02:38:58,182 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-28 02:38:58,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:38:58,302 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-28 02:38:58,307 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-28 02:38:58,338 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-28 02:38:58,344 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-28 02:38:58,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:58,401 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 02:38:58,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-28 02:38:58,410 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:38:58,411 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-28 02:38:58,439 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-28 02:38:58,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:58,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (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))) (forall ((v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2454) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2457 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2453))) (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~mem54#1.base| v_ArrVal_2454) .cse1 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2457) (select (select (store .cse2 .cse1 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-28 02:38:59,517 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2450))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2451))) (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~mem52#1.base| v_ArrVal_2449) .cse0 v_ArrVal_2452) .cse1 v_ArrVal_2454) (select (select (store .cse2 .cse1 v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2456))))) |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)))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2457 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2450))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2451))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2453))) (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~mem52#1.base| v_ArrVal_2449) .cse5 v_ArrVal_2452) .cse6 v_ArrVal_2454) .cse7 v_ArrVal_2456) |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_2457) (select (select (store .cse8 .cse7 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-28 02:39:12,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:39:12,914 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-28 02:39:13,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2462))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2450))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2451))) (let ((.cse2 (select (select .cse3 |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_ArrVal_2463) .cse0 v_ArrVal_2449) .cse1 v_ArrVal_2452) .cse2 v_ArrVal_2454) (select (select (store .cse3 .cse2 v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2456))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_prenex_24 Int)) (or (forall ((v_prenex_21 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2457 Int) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_28))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_prenex_30))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_prenex_29))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_prenex_25))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26) .cse7 v_prenex_21) .cse8 v_prenex_27) .cse9 v_prenex_23) .cse10 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_24 v_ArrVal_2457) (select (select (store .cse11 .cse10 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_24))))) is different from false [2024-11-28 02:39:13,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817443343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:39:13,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:39:13,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-28 02:39:13,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463071270] [2024-11-28 02:39:13,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:39:13,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 02:39:13,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:13,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 02:39:13,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1425, Unknown=34, NotChecked=240, Total=1892 [2024-11-28 02:39:13,491 INFO L87 Difference]: Start difference. First operand 634 states and 730 transitions. Second operand has 32 states, 29 states have (on average 5.586206896551724) internal successors, (162), 30 states have internal predecessors, (162), 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-28 02:39:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:40,326 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-28 02:39:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:39:40,327 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.586206896551724) internal successors, (162), 30 states have internal predecessors, (162), 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 100 [2024-11-28 02:39:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:40,328 INFO L225 Difference]: With dead ends: 636 [2024-11-28 02:39:40,329 INFO L226 Difference]: Without dead ends: 636 [2024-11-28 02:39:40,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=334, Invalid=2194, Unknown=34, NotChecked=300, Total=2862 [2024-11-28 02:39:40,330 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 496 mSDsluCounter, 3980 mSDsCounter, 0 mSdLazyCounter, 5039 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 4336 SdHoareTripleChecker+Invalid, 5071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:40,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 4336 Invalid, 5071 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 5039 Invalid, 0 Unknown, 0 Unchecked, 24.9s Time] [2024-11-28 02:39:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-28 02:39:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 614. [2024-11-28 02:39:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 440 states have (on average 1.5522727272727272) internal successors, (683), 607 states have internal predecessors, (683), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:39:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 709 transitions. [2024-11-28 02:39:40,337 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 709 transitions. Word has length 100 [2024-11-28 02:39:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:40,337 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 709 transitions. [2024-11-28 02:39:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.586206896551724) internal successors, (162), 30 states have internal predecessors, (162), 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-28 02:39:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 709 transitions. [2024-11-28 02:39:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:39:40,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:40,338 INFO L218 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] [2024-11-28 02:39:40,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:39:40,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:39:40,539 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:39:40,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:40,539 INFO L85 PathProgramCache]: Analyzing trace with hash 57602063, now seen corresponding path program 1 times [2024-11-28 02:39:40,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:40,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316630933] [2024-11-28 02:39:40,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:42,161 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-28 02:39:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:42,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316630933] [2024-11-28 02:39:42,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316630933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:42,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:42,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:39:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942383473] [2024-11-28 02:39:42,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:42,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:39:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:42,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:39:42,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:39:42,164 INFO L87 Difference]: Start difference. First operand 614 states and 709 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 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-28 02:39:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:55,782 INFO L93 Difference]: Finished difference Result 640 states and 738 transitions. [2024-11-28 02:39:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:39:55,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 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 102 [2024-11-28 02:39:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:55,784 INFO L225 Difference]: With dead ends: 640 [2024-11-28 02:39:55,784 INFO L226 Difference]: Without dead ends: 640 [2024-11-28 02:39:55,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:39:55,785 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 510 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 2832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:55,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3627 Invalid, 2832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2024-11-28 02:39:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-28 02:39:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2024-11-28 02:39:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 461 states have (on average 1.5314533622559654) internal successors, (706), 628 states have internal predecessors, (706), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:39:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 733 transitions. [2024-11-28 02:39:55,793 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 733 transitions. Word has length 102 [2024-11-28 02:39:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:55,794 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 733 transitions. [2024-11-28 02:39:55,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 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-28 02:39:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 733 transitions. [2024-11-28 02:39:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:39:55,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:55,795 INFO L218 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] [2024-11-28 02:39:55,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 02:39:55,795 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:39:55,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash 57602064, now seen corresponding path program 1 times [2024-11-28 02:39:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:55,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004263742] [2024-11-28 02:39:55,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:59,022 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-28 02:39:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:59,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004263742] [2024-11-28 02:39:59,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004263742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:59,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:39:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373507011] [2024-11-28 02:39:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:59,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:39:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:59,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:39:59,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:39:59,024 INFO L87 Difference]: Start difference. First operand 636 states and 733 transitions. Second operand has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 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-28 02:40:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:12,919 INFO L93 Difference]: Finished difference Result 639 states and 737 transitions. [2024-11-28 02:40:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:40:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 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 102 [2024-11-28 02:40:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:12,922 INFO L225 Difference]: With dead ends: 639 [2024-11-28 02:40:12,922 INFO L226 Difference]: Without dead ends: 639 [2024-11-28 02:40:12,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 02:40:12,923 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 506 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 2743 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:12,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 2605 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2743 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2024-11-28 02:40:12,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-28 02:40:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2024-11-28 02:40:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 461 states have (on average 1.529284164859002) internal successors, (705), 628 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:40:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 732 transitions. [2024-11-28 02:40:12,932 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 732 transitions. Word has length 102 [2024-11-28 02:40:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:12,932 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 732 transitions. [2024-11-28 02:40:12,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 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-28 02:40:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 732 transitions. [2024-11-28 02:40:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:40:12,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:12,933 INFO L218 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-28 02:40:12,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 02:40:12,933 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:40:12,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1933078830, now seen corresponding path program 1 times [2024-11-28 02:40:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884130726] [2024-11-28 02:40:12,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:13,564 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-28 02:40:13,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884130726] [2024-11-28 02:40:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884130726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:13,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:40:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774782584] [2024-11-28 02:40:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:40:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:13,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:40:13,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:40:13,566 INFO L87 Difference]: Start difference. First operand 636 states and 732 transitions. Second operand has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 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-28 02:40:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:17,432 INFO L93 Difference]: Finished difference Result 635 states and 731 transitions. [2024-11-28 02:40:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:40:17,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 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-28 02:40:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:17,434 INFO L225 Difference]: With dead ends: 635 [2024-11-28 02:40:17,434 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 02:40:17,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:40:17,434 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 2 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:17,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2103 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 02:40:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 02:40:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2024-11-28 02:40:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 461 states have (on average 1.527114967462039) internal successors, (704), 627 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:40:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 731 transitions. [2024-11-28 02:40:17,443 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 731 transitions. Word has length 103 [2024-11-28 02:40:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:17,444 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 731 transitions. [2024-11-28 02:40:17,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 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-28 02:40:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 731 transitions. [2024-11-28 02:40:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:40:17,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:17,445 INFO L218 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-28 02:40:17,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 02:40:17,445 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:40:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1933078829, now seen corresponding path program 1 times [2024-11-28 02:40:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:17,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263554727] [2024-11-28 02:40:17,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:20,824 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-28 02:40:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263554727] [2024-11-28 02:40:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263554727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470662640] [2024-11-28 02:40:20,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:20,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:20,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:40:20,826 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:40:20,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:40:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:21,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 02:40:21,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:40:21,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:40:21,815 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:40:21,815 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-28 02:40:21,845 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-28 02:40:21,992 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-28 02:40:22,013 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-28 02:40:22,448 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-28 02:40:22,459 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-28 02:40:23,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:40:23,202 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-28 02:40:23,215 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-28 02:40:23,795 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:40:23,796 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-28 02:40:23,807 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-28 02:40:24,233 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:40:24,234 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-28 02:40:24,245 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-28 02:40:24,696 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:40:24,696 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-28 02:40:24,741 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-28 02:40:25,166 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:40:25,167 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-28 02:40:25,181 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-28 02:40:25,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:25,672 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-28 02:40:25,672 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-28 02:40:25,727 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-28 02:40:25,727 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-28 02:40:26,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:40:26,035 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-28 02:40:26,048 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-28 02:40:26,117 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-28 02:40:26,127 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-28 02:40:26,145 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-28 02:40:26,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:40:26,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2919 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2919 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:40:28,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2914))) (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_2915) .cse0 v_ArrVal_2917) (select (select (store .cse1 .cse0 v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2919))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (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_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2918 Int) (v_ArrVal_2919 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2914))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2916))) (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_2915) .cse3 v_ArrVal_2917) .cse4 v_ArrVal_2919) |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_2918) (select (select (store .cse5 .cse4 v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-28 02:41:27,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:41:27,667 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-28 02:41:32,391 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_41))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_prenex_34))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_prenex_32))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_prenex_42))) (let ((.cse3 (select (select .cse4 |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_prenex_39) .cse0 v_prenex_33) .cse1 v_prenex_31) .cse2 v_prenex_40) .cse3 v_prenex_37) (select (select (store .cse4 .cse3 v_prenex_38) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_36))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_9| |c_ULTIMATE.start_main_#t~mem50#1.base|) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2918 Int) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2926 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2925 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2925))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_2910))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_2912))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_2914))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_2916))) (let ((.cse13 (select (select .cse14 |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_ArrVal_2926) .cse9 v_ArrVal_2911) .cse10 v_ArrVal_2913) .cse11 v_ArrVal_2915) .cse12 v_ArrVal_2917) .cse13 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2918) (select (select (store .cse14 .cse13 v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))))) is different from false [2024-11-28 02:41:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470662640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:32,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:41:32,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2024-11-28 02:41:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418090704] [2024-11-28 02:41:32,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:41:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 02:41:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:32,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 02:41:32,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1587, Unknown=60, NotChecked=258, Total=2162 [2024-11-28 02:41:32,444 INFO L87 Difference]: Start difference. First operand 635 states and 731 transitions. Second operand has 33 states, 30 states have (on average 5.566666666666666) internal successors, (167), 31 states have internal predecessors, (167), 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-28 02:42:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:14,714 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-28 02:42:14,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 02:42:14,714 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.566666666666666) internal successors, (167), 31 states have internal predecessors, (167), 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 103 [2024-11-28 02:42:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:14,717 INFO L225 Difference]: With dead ends: 637 [2024-11-28 02:42:14,717 INFO L226 Difference]: Without dead ends: 637 [2024-11-28 02:42:14,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 72.1s TimeCoverageRelationStatistics Valid=427, Invalid=2495, Unknown=60, NotChecked=324, Total=3306 [2024-11-28 02:42:14,721 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 489 mSDsluCounter, 3271 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:14,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3626 Invalid, 4062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4030 Invalid, 0 Unknown, 0 Unchecked, 38.1s Time] [2024-11-28 02:42:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-28 02:42:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 612. [2024-11-28 02:42:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 440 states have (on average 1.5477272727272726) internal successors, (681), 605 states have internal predecessors, (681), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:42:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 707 transitions. [2024-11-28 02:42:14,732 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 707 transitions. Word has length 103 [2024-11-28 02:42:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:14,732 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 707 transitions. [2024-11-28 02:42:14,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.566666666666666) internal successors, (167), 31 states have internal predecessors, (167), 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-28 02:42:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 707 transitions. [2024-11-28 02:42:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 02:42:14,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:14,733 INFO L218 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] [2024-11-28 02:42:14,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 02:42:14,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 02:42:14,934 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:42:14,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:14,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1963212095, now seen corresponding path program 1 times [2024-11-28 02:42:14,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:14,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882291479] [2024-11-28 02:42:14,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:14,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:18,635 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-28 02:42:18,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882291479] [2024-11-28 02:42:18,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882291479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:42:18,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:42:18,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:42:18,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405304709] [2024-11-28 02:42:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:42:18,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:42:18,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:18,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:42:18,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:42:18,638 INFO L87 Difference]: Start difference. First operand 612 states and 707 transitions. Second operand has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 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-28 02:42:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:40,790 INFO L93 Difference]: Finished difference Result 663 states and 763 transitions. [2024-11-28 02:42:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:42:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 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 105 [2024-11-28 02:42:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:40,794 INFO L225 Difference]: With dead ends: 663 [2024-11-28 02:42:40,794 INFO L226 Difference]: Without dead ends: 663 [2024-11-28 02:42:40,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:42:40,795 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 578 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:40,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 2285 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 20.2s Time] [2024-11-28 02:42:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-28 02:42:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 637. [2024-11-28 02:42:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 464 states have (on average 1.5237068965517242) internal successors, (707), 629 states have internal predecessors, (707), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:42:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 734 transitions. [2024-11-28 02:42:40,806 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 734 transitions. Word has length 105 [2024-11-28 02:42:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:40,806 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 734 transitions. [2024-11-28 02:42:40,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 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-28 02:42:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 734 transitions. [2024-11-28 02:42:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 02:42:40,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:40,808 INFO L218 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] [2024-11-28 02:42:40,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 02:42:40,808 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:42:40,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1963212096, now seen corresponding path program 1 times [2024-11-28 02:42:40,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:40,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421989588] [2024-11-28 02:42:40,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:43,997 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-28 02:42:43,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:43,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421989588] [2024-11-28 02:42:43,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421989588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:42:43,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:42:43,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:42:43,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594410762] [2024-11-28 02:42:43,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:42:43,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:42:43,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:43,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:42:43,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:42:43,999 INFO L87 Difference]: Start difference. First operand 637 states and 734 transitions. Second operand has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 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-28 02:43:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:17,395 INFO L93 Difference]: Finished difference Result 662 states and 762 transitions. [2024-11-28 02:43:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:43:17,395 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 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 105 [2024-11-28 02:43:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:17,398 INFO L225 Difference]: With dead ends: 662 [2024-11-28 02:43:17,398 INFO L226 Difference]: Without dead ends: 662 [2024-11-28 02:43:17,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:43:17,399 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 536 mSDsluCounter, 3992 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:17,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4358 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3405 Invalid, 0 Unknown, 0 Unchecked, 31.6s Time] [2024-11-28 02:43:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-28 02:43:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 637. [2024-11-28 02:43:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 464 states have (on average 1.521551724137931) internal successors, (706), 629 states have internal predecessors, (706), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:43:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 733 transitions. [2024-11-28 02:43:17,411 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 733 transitions. Word has length 105 [2024-11-28 02:43:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:17,411 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 733 transitions. [2024-11-28 02:43:17,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 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-28 02:43:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 733 transitions. [2024-11-28 02:43:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:43:17,412 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:17,412 INFO L218 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-28 02:43:17,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 02:43:17,412 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:43:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:17,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1429272290, now seen corresponding path program 1 times [2024-11-28 02:43:17,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:17,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62784002] [2024-11-28 02:43:17,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:17,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:21,889 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-28 02:43:21,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62784002] [2024-11-28 02:43:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62784002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:43:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447932982] [2024-11-28 02:43:21,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:21,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:43:21,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:43:21,891 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:43:21,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:43:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:22,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-28 02:43:22,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:43:22,264 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-28 02:43:23,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:43:23,690 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-28 02:43:23,987 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-28 02:43:24,045 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-28 02:43:25,071 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:25,071 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-28 02:43:25,092 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-28 02:43:25,663 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:25,663 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-28 02:43:25,684 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-28 02:43:26,271 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:26,271 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-28 02:43:26,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-28 02:43:26,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:26,911 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-28 02:43:26,935 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-28 02:43:27,577 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:27,577 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-28 02:43:27,598 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-28 02:43:28,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:28,296 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-28 02:43:28,318 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-28 02:43:29,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:29,046 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-28 02:43:29,069 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-28 02:43:29,645 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-28 02:43:29,667 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-28 02:43:30,050 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-28 02:43:30,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:43:30,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:43:30,981 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 46 treesize of output 50 [2024-11-28 02:43:31,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3316 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem58#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_43 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 |c_ULTIMATE.start_main_#t~mem58#1.offset|))))) is different from false [2024-11-28 02:43:31,936 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3315) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3314))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (= (select (select (store .cse1 .cse2 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) .cse2)))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3315))) (< (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))) is different from false [2024-11-28 02:43:32,094 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3315))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 41)))) (forall ((v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3314))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3315) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:43:32,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3312))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3313) .cse2 v_ArrVal_3315))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3312))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3314)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse4 (select (select (store .cse5 .cse4 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3312))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3313) .cse7 v_ArrVal_3315) (select (select (store .cse8 .cse7 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) is different from false [2024-11-28 02:43:32,538 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_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3312))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3313) .cse1 v_ArrVal_3315) (select (select (store .cse2 .cse1 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3312))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3313) .cse6 v_ArrVal_3315))) (< (select (select (store .cse4 (select (select (store .cse5 .cse6 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3312))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3314)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse7 .cse8 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8))))))) is different from false [2024-11-28 02:43:32,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3311))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3312)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3314)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3311))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3312))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3310) .cse5 v_ArrVal_3313) .cse6 v_ArrVal_3315) (select (select (store .cse7 .cse6 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3317))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3311))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_3312))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3310) .cse12 v_ArrVal_3313) .cse11 v_ArrVal_3315))) (< (select (select (store .cse9 (select (select (store .cse10 .cse11 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))))) is different from false [2024-11-28 02:43:37,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3311))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse6 .cse5 v_ArrVal_3312))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3310) .cse5 v_ArrVal_3313) .cse2 v_ArrVal_3315))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3311))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3312)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3314)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse7 .cse8 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8)))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3311))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3312))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3310) .cse11 v_ArrVal_3313) .cse12 v_ArrVal_3315) (select (select (store .cse13 .cse12 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-28 02:43:41,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3309))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3311))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3312))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3308) .cse0 v_ArrVal_3310) .cse1 v_ArrVal_3313) .cse2 v_ArrVal_3315) (select (select (store .cse3 .cse2 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3317))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3309))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3311)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3312)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3314)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= (select (select (store .cse7 .cse8 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse8)))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3309))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_3311))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_3312))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3308) .cse15 v_ArrVal_3310) .cse16 v_ArrVal_3313) .cse14 v_ArrVal_3315))) (< (select (select (store .cse12 (select (select (store .cse13 .cse14 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 41)))))))))))) is different from false [2024-11-28 02:43:45,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3309))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3311))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse7 .cse6 v_ArrVal_3312))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3308) .cse5 v_ArrVal_3310) .cse6 v_ArrVal_3313) .cse2 v_ArrVal_3315))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3309))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3311))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3312))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3308) .cse9 v_ArrVal_3310) .cse10 v_ArrVal_3313) .cse11 v_ArrVal_3315) (select (select (store .cse12 .cse11 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3309))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3311)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3312)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3314)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse15 .cse16 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse16))))))) is different from false [2024-11-28 02:43:50,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3307))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3309)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3311)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3312)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3314)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3307))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3309))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3311))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_3312))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3306) .cse10 v_ArrVal_3308) .cse11 v_ArrVal_3310) .cse12 v_ArrVal_3313) .cse9 v_ArrVal_3315))) (< (select (select (store .cse7 (select (select (store .cse8 .cse9 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3307))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3309))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3311))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3312))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3306) .cse16 v_ArrVal_3308) .cse17 v_ArrVal_3310) .cse18 v_ArrVal_3313) .cse19 v_ArrVal_3315) (select (select (store .cse20 .cse19 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3317))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 02:43:54,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3307))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3309)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3311)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3312)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3314)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3307))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3309))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3311))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3312))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_3306) .cse8 v_ArrVal_3308) .cse9 v_ArrVal_3310) .cse10 v_ArrVal_3313) .cse11 v_ArrVal_3315) (select (select (store .cse12 .cse11 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3317))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_prenex_43 (Array Int Int)) (v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3307))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse23 (store .cse24 .cse19 v_ArrVal_3309))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_3311))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse17 (store .cse22 .cse21 v_ArrVal_3312))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse16 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_3306) .cse19 v_ArrVal_3308) .cse20 v_ArrVal_3310) .cse21 v_ArrVal_3313) .cse18 v_ArrVal_3315))) (< (select (select (store .cse16 (select (select (store .cse17 .cse18 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))))))) is different from false [2024-11-28 02:43:57,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 02:43:57,050 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 02:43:57,051 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 02:43:57,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 02:43:57,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-28 02:43:57,254 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-28 02:43:57,264 INFO L158 Benchmark]: Toolchain (without parser) took 389534.84ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 104.0MB in the beginning and 343.3MB in the end (delta: -239.3MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2024-11-28 02:43:57,265 INFO L158 Benchmark]: CDTParser took 1.56ms. Allocated memory is still 167.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:43:57,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 900.04ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 76.6MB in the end (delta: 27.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:43:57,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.46ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 70.9MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:43:57,269 INFO L158 Benchmark]: Boogie Preprocessor took 216.84ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 61.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:43:57,269 INFO L158 Benchmark]: RCFGBuilder took 2952.24ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 61.8MB in the end (delta: -670.7kB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-11-28 02:43:57,269 INFO L158 Benchmark]: TraceAbstraction took 385314.01ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 61.8MB in the beginning and 343.3MB in the end (delta: -281.5MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2024-11-28 02:43:57,270 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.56ms. Allocated memory is still 167.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 900.04ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 76.6MB in the end (delta: 27.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 137.46ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 70.9MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 216.84ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 61.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2952.24ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 61.8MB in the end (delta: -670.7kB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * TraceAbstraction took 385314.01ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 61.8MB in the beginning and 343.3MB in the end (delta: -281.5MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB --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 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:43:59,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:43:59,977 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 02:43:59,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:43:59,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:44:00,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:44:00,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:44:00,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:44:00,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:44:00,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:44:00,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:44:00,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:44:00,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:44:00,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:44:00,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:44:00,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:44:00,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:44:00,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:44:00,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:44:00,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:44:00,026 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:44:00,026 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:44:00,026 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:44:00,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:44:00,026 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:44:00,027 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:44:00,027 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:44:00,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:44:00,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:44:00,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:44:00,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:44:00,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:44:00,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:44:00,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:44:00,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:44:00,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:44:00,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:44:00,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:44:00,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:44:00,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:44:00,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:44:00,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:44:00,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:44:00,030 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:44:00,031 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:44:00,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:44:00,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:44:00,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:44:00,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:44:00,032 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 [2024-11-28 02:44:00,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:44:00,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:44:00,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:44:00,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:44:00,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:44:00,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2024-11-28 02:44:03,290 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data/1269bff3d/2d4db82de2ee42ab8689d6d0fa70f4f1/FLAGaff29abd5 [2024-11-28 02:44:03,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:44:03,768 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2024-11-28 02:44:03,792 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data/1269bff3d/2d4db82de2ee42ab8689d6d0fa70f4f1/FLAGaff29abd5 [2024-11-28 02:44:03,886 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/data/1269bff3d/2d4db82de2ee42ab8689d6d0fa70f4f1 [2024-11-28 02:44:03,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:44:03,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:44:03,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:44:03,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:44:03,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:44:03,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:44:03" (1/1) ... [2024-11-28 02:44:03,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14fe2fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:03, skipping insertion in model container [2024-11-28 02:44:03,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:44:03" (1/1) ... [2024-11-28 02:44:03,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:44:04,481 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:44:04,515 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:44:04,519 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:44:04,525 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:44:04,538 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:44:04,574 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:44:04,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:44:04,591 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:44:04,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:44:04,730 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:44:04,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04 WrapperNode [2024-11-28 02:44:04,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:44:04,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:44:04,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:44:04,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:44:04,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,811 INFO L138 Inliner]: procedures = 179, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 622 [2024-11-28 02:44:04,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:44:04,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:44:04,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:44:04,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:44:04,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,887 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-28 02:44:04,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,916 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:44:04,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:44:04,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:44:04,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:44:04,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (1/1) ... [2024-11-28 02:44:04,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:44:04,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:04,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:44:05,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:44:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 02:44:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 02:44:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 02:44:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 02:44:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:44:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:44:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:44:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:44:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:44:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:44:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 02:44:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:44:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:44:05,265 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:44:05,267 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:44:05,269 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:44:05,325 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:44:08,808 INFO L? ?]: Removed 686 outVars from TransFormulas that were not future-live. [2024-11-28 02:44:08,809 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:44:08,834 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:44:08,834 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-28 02:44:08,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:44:08 BoogieIcfgContainer [2024-11-28 02:44:08,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:44:08,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:44:08,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:44:08,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:44:08,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:44:03" (1/3) ... [2024-11-28 02:44:08,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccce8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:44:08, skipping insertion in model container [2024-11-28 02:44:08,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:04" (2/3) ... [2024-11-28 02:44:08,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccce8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:44:08, skipping insertion in model container [2024-11-28 02:44:08,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:44:08" (3/3) ... [2024-11-28 02:44:08,846 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-1.i [2024-11-28 02:44:08,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:44:08,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test1-1.i that has 4 procedures, 663 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-28 02:44:08,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:44:08,954 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;@34e682ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:44:08,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-28 02:44:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 658 states, 325 states have (on average 2.2) internal successors, (715), 652 states have internal predecessors, (715), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:44:08,966 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:08,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:44:08,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:08,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:08,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103276, now seen corresponding path program 1 times [2024-11-28 02:44:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:08,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118510031] [2024-11-28 02:44:08,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:08,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:08,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:08,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:08,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:44:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:09,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 02:44:09,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:09,167 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-28 02:44:09,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:09,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:09,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118510031] [2024-11-28 02:44:09,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118510031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:09,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:09,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:44:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536131231] [2024-11-28 02:44:09,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:09,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:44:09,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:09,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:44:09,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:44:09,210 INFO L87 Difference]: Start difference. First operand has 658 states, 325 states have (on average 2.2) internal successors, (715), 652 states have internal predecessors, (715), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-28 02:44:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:09,287 INFO L93 Difference]: Finished difference Result 648 states and 694 transitions. [2024-11-28 02:44:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:44:09,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-28 02:44:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:09,311 INFO L225 Difference]: With dead ends: 648 [2024-11-28 02:44:09,311 INFO L226 Difference]: Without dead ends: 646 [2024-11-28 02:44:09,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:44:09,320 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:09,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:44:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-28 02:44:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2024-11-28 02:44:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 319 states have (on average 2.0877742946708464) internal successors, (666), 640 states have internal predecessors, (666), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 692 transitions. [2024-11-28 02:44:09,398 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 692 transitions. Word has length 6 [2024-11-28 02:44:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:09,399 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 692 transitions. [2024-11-28 02:44:09,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-28 02:44:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 692 transitions. [2024-11-28 02:44:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:44:09,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:09,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:44:09,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 02:44:09,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:09,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:09,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-11-28 02:44:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:09,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417643370] [2024-11-28 02:44:09,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:09,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:09,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:09,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:09,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:44:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:09,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:44:09,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:09,777 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 7 [2024-11-28 02:44:09,802 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-28 02:44:09,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:09,803 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:09,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417643370] [2024-11-28 02:44:09,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417643370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:09,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:09,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:44:09,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106385657] [2024-11-28 02:44:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:09,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:44:09,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:09,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:44:09,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:44:09,807 INFO L87 Difference]: Start difference. First operand 646 states and 692 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:44:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:11,458 INFO L93 Difference]: Finished difference Result 600 states and 647 transitions. [2024-11-28 02:44:11,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:44:11,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 02:44:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:11,462 INFO L225 Difference]: With dead ends: 600 [2024-11-28 02:44:11,463 INFO L226 Difference]: Without dead ends: 600 [2024-11-28 02:44:11,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:44:11,464 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 536 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:11,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 348 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:44:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-28 02:44:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 597. [2024-11-28 02:44:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 319 states have (on average 1.9341692789968652) internal successors, (617), 591 states have internal predecessors, (617), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 643 transitions. [2024-11-28 02:44:11,489 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 643 transitions. Word has length 6 [2024-11-28 02:44:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:11,490 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 643 transitions. [2024-11-28 02:44:11,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:44:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 643 transitions. [2024-11-28 02:44:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:44:11,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:11,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:44:11,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:44:11,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:11,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:11,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-11-28 02:44:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413223003] [2024-11-28 02:44:11,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:11,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:11,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:11,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:11,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:44:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:11,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:44:11,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:11,820 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-28 02:44:11,852 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-28 02:44:11,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:11,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:11,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413223003] [2024-11-28 02:44:11,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413223003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:11,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:11,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:44:11,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396321823] [2024-11-28 02:44:11,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:11,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:44:11,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:11,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:44:11,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:44:11,854 INFO L87 Difference]: Start difference. First operand 597 states and 643 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:44:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:13,573 INFO L93 Difference]: Finished difference Result 673 states and 723 transitions. [2024-11-28 02:44:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:44:13,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 02:44:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:13,577 INFO L225 Difference]: With dead ends: 673 [2024-11-28 02:44:13,577 INFO L226 Difference]: Without dead ends: 673 [2024-11-28 02:44:13,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 02:44:13,578 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 264 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:13,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 736 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 02:44:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-28 02:44:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 624. [2024-11-28 02:44:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 356 states have (on average 1.9129213483146068) internal successors, (681), 618 states have internal predecessors, (681), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 707 transitions. [2024-11-28 02:44:13,601 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 707 transitions. Word has length 6 [2024-11-28 02:44:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:13,601 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 707 transitions. [2024-11-28 02:44:13,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 02:44:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 707 transitions. [2024-11-28 02:44:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:44:13,602 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:13,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:44:13,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:44:13,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:13,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:13,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1423050696, now seen corresponding path program 1 times [2024-11-28 02:44:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:13,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59686934] [2024-11-28 02:44:13,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:13,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:13,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:44:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:13,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:44:13,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:13,962 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-28 02:44:13,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:13,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:13,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59686934] [2024-11-28 02:44:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59686934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:13,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:13,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:44:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990211897] [2024-11-28 02:44:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:13,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:44:13,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:13,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:44:13,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:44:13,965 INFO L87 Difference]: Start difference. First operand 624 states and 707 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-28 02:44:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:14,632 INFO L93 Difference]: Finished difference Result 753 states and 849 transitions. [2024-11-28 02:44:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:44:14,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-28 02:44:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:14,636 INFO L225 Difference]: With dead ends: 753 [2024-11-28 02:44:14,636 INFO L226 Difference]: Without dead ends: 753 [2024-11-28 02:44:14,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-28 02:44:14,638 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 138 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:14,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1756 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:44:14,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-28 02:44:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 707. [2024-11-28 02:44:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 439 states have (on average 1.8747152619589977) internal successors, (823), 701 states have internal predecessors, (823), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 849 transitions. [2024-11-28 02:44:14,663 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 849 transitions. Word has length 6 [2024-11-28 02:44:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:14,664 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 849 transitions. [2024-11-28 02:44:14,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-28 02:44:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 849 transitions. [2024-11-28 02:44:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 02:44:14,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:14,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:44:14,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 02:44:14,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:14,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr318ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1164903939, now seen corresponding path program 1 times [2024-11-28 02:44:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110851364] [2024-11-28 02:44:14,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:14,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:14,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:14,871 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:14,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:44:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:14,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 02:44:14,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:14,984 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-28 02:44:14,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:14,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:14,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110851364] [2024-11-28 02:44:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110851364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:14,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:44:14,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673608957] [2024-11-28 02:44:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:14,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:44:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:14,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:44:14,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:44:14,990 INFO L87 Difference]: Start difference. First operand 707 states and 849 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-28 02:44:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:15,972 INFO L93 Difference]: Finished difference Result 709 states and 850 transitions. [2024-11-28 02:44:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:44:15,973 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-28 02:44:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:15,976 INFO L225 Difference]: With dead ends: 709 [2024-11-28 02:44:15,976 INFO L226 Difference]: Without dead ends: 705 [2024-11-28 02:44:15,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-28 02:44:15,977 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:15,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 997 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:44:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-28 02:44:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-28 02:44:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 437 states have (on average 1.8764302059496567) internal successors, (820), 699 states have internal predecessors, (820), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 846 transitions. [2024-11-28 02:44:15,997 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 846 transitions. Word has length 7 [2024-11-28 02:44:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:15,997 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 846 transitions. [2024-11-28 02:44:15,998 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-28 02:44:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 846 transitions. [2024-11-28 02:44:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 02:44:15,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:15,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:44:16,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:44:16,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:16,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:16,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262039, now seen corresponding path program 1 times [2024-11-28 02:44:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:16,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2093882342] [2024-11-28 02:44:16,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:16,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:16,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:16,201 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:16,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:44:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:16,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:44:16,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:16,317 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 7 [2024-11-28 02:44:16,368 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-28 02:44:16,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:16,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:16,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093882342] [2024-11-28 02:44:16,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093882342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:16,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:16,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:44:16,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420342890] [2024-11-28 02:44:16,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:16,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:44:16,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:16,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:44:16,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:44:16,370 INFO L87 Difference]: Start difference. First operand 705 states and 846 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 02:44:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:18,219 INFO L93 Difference]: Finished difference Result 690 states and 808 transitions. [2024-11-28 02:44:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:44:18,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-28 02:44:18,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:18,222 INFO L225 Difference]: With dead ends: 690 [2024-11-28 02:44:18,222 INFO L226 Difference]: Without dead ends: 690 [2024-11-28 02:44:18,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-28 02:44:18,223 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 587 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:18,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 544 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:44:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-28 02:44:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 682. [2024-11-28 02:44:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 437 states have (on average 1.77116704805492) internal successors, (774), 676 states have internal predecessors, (774), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 800 transitions. [2024-11-28 02:44:18,241 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 800 transitions. Word has length 12 [2024-11-28 02:44:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:18,241 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 800 transitions. [2024-11-28 02:44:18,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 02:44:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 800 transitions. [2024-11-28 02:44:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 02:44:18,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:18,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:44:18,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:44:18,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:18,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:18,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262040, now seen corresponding path program 1 times [2024-11-28 02:44:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154700052] [2024-11-28 02:44:18,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:18,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:18,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:18,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:18,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:44:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:18,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:44:18,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:18,570 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-28 02:44:18,693 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-28 02:44:18,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:18,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154700052] [2024-11-28 02:44:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154700052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:18,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:44:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593499030] [2024-11-28 02:44:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:18,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:44:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:18,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:44:18,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:44:18,695 INFO L87 Difference]: Start difference. First operand 682 states and 800 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 02:44:21,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:21,207 INFO L93 Difference]: Finished difference Result 863 states and 972 transitions. [2024-11-28 02:44:21,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:44:21,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-28 02:44:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:21,217 INFO L225 Difference]: With dead ends: 863 [2024-11-28 02:44:21,217 INFO L226 Difference]: Without dead ends: 863 [2024-11-28 02:44:21,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-28 02:44:21,218 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 389 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:21,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1148 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 02:44:21,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-28 02:44:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 798. [2024-11-28 02:44:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 553 states have (on average 1.6528028933092225) internal successors, (914), 792 states have internal predecessors, (914), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 940 transitions. [2024-11-28 02:44:21,246 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 940 transitions. Word has length 12 [2024-11-28 02:44:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:21,246 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 940 transitions. [2024-11-28 02:44:21,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 02:44:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 940 transitions. [2024-11-28 02:44:21,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 02:44:21,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:21,247 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:44:21,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 02:44:21,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:21,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:21,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1048779893, now seen corresponding path program 1 times [2024-11-28 02:44:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:21,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231123142] [2024-11-28 02:44:21,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:21,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:21,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:21,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:44:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:21,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 02:44:21,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:21,619 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-28 02:44:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:21,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:44:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:22,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231123142] [2024-11-28 02:44:22,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231123142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:44:22,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:44:22,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-28 02:44:22,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563366352] [2024-11-28 02:44:22,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:44:22,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:44:22,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:22,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:44:22,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:44:22,546 INFO L87 Difference]: Start difference. First operand 798 states and 940 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:29,315 INFO L93 Difference]: Finished difference Result 1225 states and 1468 transitions. [2024-11-28 02:44:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:44:29,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-28 02:44:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:29,320 INFO L225 Difference]: With dead ends: 1225 [2024-11-28 02:44:29,320 INFO L226 Difference]: Without dead ends: 1225 [2024-11-28 02:44:29,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:44:29,321 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 1030 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:29,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1830 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-28 02:44:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-28 02:44:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 964. [2024-11-28 02:44:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 719 states have (on average 1.5966620305980528) internal successors, (1148), 958 states have internal predecessors, (1148), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1174 transitions. [2024-11-28 02:44:29,351 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1174 transitions. Word has length 31 [2024-11-28 02:44:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:29,351 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1174 transitions. [2024-11-28 02:44:29,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1174 transitions. [2024-11-28 02:44:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 02:44:29,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:29,353 INFO L218 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] [2024-11-28 02:44:29,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 02:44:29,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:29,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:29,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash -717313938, now seen corresponding path program 1 times [2024-11-28 02:44:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:29,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2091419197] [2024-11-28 02:44:29,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:29,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:29,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:29,557 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:29,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:44:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:29,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:44:29,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:29,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-28 02:44:29,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:29,810 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:29,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091419197] [2024-11-28 02:44:29,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091419197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:29,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:29,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:44:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774116633] [2024-11-28 02:44:29,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:29,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:44:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:29,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:44:29,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:44:29,813 INFO L87 Difference]: Start difference. First operand 964 states and 1174 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-28 02:44:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:29,943 INFO L93 Difference]: Finished difference Result 649 states and 734 transitions. [2024-11-28 02:44:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:44:29,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-28 02:44:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:29,949 INFO L225 Difference]: With dead ends: 649 [2024-11-28 02:44:29,949 INFO L226 Difference]: Without dead ends: 649 [2024-11-28 02:44:29,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-28 02:44:29,950 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 56 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:29,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1571 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:44:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-28 02:44:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2024-11-28 02:44:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 425 states have (on average 1.6611764705882353) internal successors, (706), 641 states have internal predecessors, (706), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 732 transitions. [2024-11-28 02:44:29,968 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 732 transitions. Word has length 47 [2024-11-28 02:44:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:29,968 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 732 transitions. [2024-11-28 02:44:29,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-28 02:44:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 732 transitions. [2024-11-28 02:44:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 02:44:29,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:29,971 INFO L218 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] [2024-11-28 02:44:29,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 02:44:30,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:30,172 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:30,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash 489889826, now seen corresponding path program 1 times [2024-11-28 02:44:30,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:30,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018222367] [2024-11-28 02:44:30,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:30,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:30,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:30,180 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:30,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:44:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:30,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 02:44:30,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:30,418 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-28 02:44:31,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:44:31,195 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-28 02:44:31,222 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:44:31,223 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 13 treesize of output 13 [2024-11-28 02:44:31,232 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-28 02:44:31,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:31,232 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:31,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018222367] [2024-11-28 02:44:31,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018222367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:31,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:44:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102176193] [2024-11-28 02:44:31,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:31,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:44:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:31,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:44:31,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:44:31,235 INFO L87 Difference]: Start difference. First operand 647 states and 732 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 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-28 02:44:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:33,169 INFO L93 Difference]: Finished difference Result 609 states and 694 transitions. [2024-11-28 02:44:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:44:33,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2024-11-28 02:44:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:33,172 INFO L225 Difference]: With dead ends: 609 [2024-11-28 02:44:33,172 INFO L226 Difference]: Without dead ends: 609 [2024-11-28 02:44:33,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:44:33,174 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 452 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:33,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 431 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:44:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-28 02:44:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 572. [2024-11-28 02:44:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 388 states have (on average 1.5309278350515463) internal successors, (594), 566 states have internal predecessors, (594), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 620 transitions. [2024-11-28 02:44:33,194 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 620 transitions. Word has length 55 [2024-11-28 02:44:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:33,195 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 620 transitions. [2024-11-28 02:44:33,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 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-28 02:44:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 620 transitions. [2024-11-28 02:44:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 02:44:33,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:33,199 INFO L218 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] [2024-11-28 02:44:33,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:44:33,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:33,400 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:33,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:33,400 INFO L85 PathProgramCache]: Analyzing trace with hash 225246615, now seen corresponding path program 1 times [2024-11-28 02:44:33,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:33,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428947742] [2024-11-28 02:44:33,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:33,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:33,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:33,403 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:33,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:44:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:33,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:44:33,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:33,632 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 7 [2024-11-28 02:44:33,651 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-28 02:44:33,690 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 23 treesize of output 11 [2024-11-28 02:44:33,705 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-28 02:44:33,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:33,706 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:33,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428947742] [2024-11-28 02:44:33,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428947742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:33,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:33,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:44:33,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801773316] [2024-11-28 02:44:33,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:33,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:44:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:33,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:44:33,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:44:33,708 INFO L87 Difference]: Start difference. First operand 572 states and 620 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:35,600 INFO L93 Difference]: Finished difference Result 571 states and 619 transitions. [2024-11-28 02:44:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:44:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-28 02:44:35,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:35,602 INFO L225 Difference]: With dead ends: 571 [2024-11-28 02:44:35,602 INFO L226 Difference]: Without dead ends: 571 [2024-11-28 02:44:35,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-28 02:44:35,603 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 2 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:35,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1376 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:44:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-28 02:44:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2024-11-28 02:44:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 388 states have (on average 1.5283505154639174) internal successors, (593), 565 states have internal predecessors, (593), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 619 transitions. [2024-11-28 02:44:35,616 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 619 transitions. Word has length 60 [2024-11-28 02:44:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:35,617 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 619 transitions. [2024-11-28 02:44:35,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 619 transitions. [2024-11-28 02:44:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 02:44:35,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:35,618 INFO L218 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] [2024-11-28 02:44:35,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 02:44:35,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:35,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:35,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 225246616, now seen corresponding path program 1 times [2024-11-28 02:44:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480504465] [2024-11-28 02:44:35,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:35,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:35,824 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:35,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:44:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:36,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:44:36,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:36,060 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-28 02:44:36,098 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-28 02:44:36,116 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-28 02:44:36,180 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 21 treesize of output 9 [2024-11-28 02:44:36,209 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-28 02:44:36,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:36,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:36,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480504465] [2024-11-28 02:44:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480504465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:36,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:36,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:44:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977611557] [2024-11-28 02:44:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:36,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:44:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:36,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:44:36,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:44:36,211 INFO L87 Difference]: Start difference. First operand 571 states and 619 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:38,388 INFO L93 Difference]: Finished difference Result 570 states and 618 transitions. [2024-11-28 02:44:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:44:38,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-28 02:44:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:38,392 INFO L225 Difference]: With dead ends: 570 [2024-11-28 02:44:38,393 INFO L226 Difference]: Without dead ends: 570 [2024-11-28 02:44:38,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:44:38,394 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 1 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:38,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1383 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:44:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-28 02:44:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2024-11-28 02:44:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 387 states have (on average 1.5297157622739017) internal successors, (592), 564 states have internal predecessors, (592), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 02:44:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 618 transitions. [2024-11-28 02:44:38,408 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 618 transitions. Word has length 60 [2024-11-28 02:44:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:38,409 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 618 transitions. [2024-11-28 02:44:38,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:44:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 618 transitions. [2024-11-28 02:44:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 02:44:38,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:38,411 INFO L218 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] [2024-11-28 02:44:38,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 02:44:38,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:38,612 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash -815907298, now seen corresponding path program 1 times [2024-11-28 02:44:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:38,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478270150] [2024-11-28 02:44:38,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:38,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:38,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:38,617 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:38,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:44:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:38,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 02:44:38,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:38,853 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-28 02:44:38,982 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 23 treesize of output 11 [2024-11-28 02:44:39,005 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-28 02:44:39,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:39,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:39,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478270150] [2024-11-28 02:44:39,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478270150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:39,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:44:39,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430220343] [2024-11-28 02:44:39,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:39,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:44:39,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:39,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:44:39,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:44:39,009 INFO L87 Difference]: Start difference. First operand 570 states and 618 transitions. Second operand has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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-28 02:44:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:41,583 INFO L93 Difference]: Finished difference Result 582 states and 633 transitions. [2024-11-28 02:44:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:44:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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 68 [2024-11-28 02:44:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:41,585 INFO L225 Difference]: With dead ends: 582 [2024-11-28 02:44:41,586 INFO L226 Difference]: Without dead ends: 582 [2024-11-28 02:44:41,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:44:41,586 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 12 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:41,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1810 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 02:44:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-28 02:44:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 576. [2024-11-28 02:44:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 392 states have (on average 1.528061224489796) internal successors, (599), 569 states have internal predecessors, (599), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-28 02:44:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 628 transitions. [2024-11-28 02:44:41,601 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 628 transitions. Word has length 68 [2024-11-28 02:44:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:41,601 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 628 transitions. [2024-11-28 02:44:41,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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-28 02:44:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 628 transitions. [2024-11-28 02:44:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 02:44:41,602 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:41,602 INFO L218 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] [2024-11-28 02:44:41,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 02:44:41,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:41,807 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:41,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:41,807 INFO L85 PathProgramCache]: Analyzing trace with hash -815907297, now seen corresponding path program 1 times [2024-11-28 02:44:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:41,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295677328] [2024-11-28 02:44:41,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:41,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:41,810 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:41,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 02:44:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:42,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:44:42,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:42,044 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-28 02:44:42,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:44:42,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:42,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295677328] [2024-11-28 02:44:42,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295677328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:42,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:44:42,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624604953] [2024-11-28 02:44:42,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:42,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:44:42,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:42,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:44:42,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:44:42,047 INFO L87 Difference]: Start difference. First operand 576 states and 628 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-28 02:44:42,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:42,097 INFO L93 Difference]: Finished difference Result 573 states and 622 transitions. [2024-11-28 02:44:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:44:42,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2024-11-28 02:44:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:42,100 INFO L225 Difference]: With dead ends: 573 [2024-11-28 02:44:42,100 INFO L226 Difference]: Without dead ends: 573 [2024-11-28 02:44:42,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-28 02:44:42,101 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 0 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:42,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1558 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:44:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-28 02:44:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2024-11-28 02:44:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 567 states have internal predecessors, (595), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:44:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 622 transitions. [2024-11-28 02:44:42,120 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 622 transitions. Word has length 68 [2024-11-28 02:44:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:42,120 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 622 transitions. [2024-11-28 02:44:42,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-28 02:44:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 622 transitions. [2024-11-28 02:44:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 02:44:42,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:42,122 INFO L218 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] [2024-11-28 02:44:42,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 02:44:42,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:42,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:42,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:42,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2041001009, now seen corresponding path program 1 times [2024-11-28 02:44:42,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:42,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842308649] [2024-11-28 02:44:42,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:42,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:42,325 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:42,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 02:44:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:42,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:44:42,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:42,585 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-28 02:44:42,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:44:42,685 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-28 02:44:42,686 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842308649] [2024-11-28 02:44:42,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842308649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:44:42,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:44:42,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-28 02:44:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691024681] [2024-11-28 02:44:42,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:44:42,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:44:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:42,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:44:42,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:44:42,688 INFO L87 Difference]: Start difference. First operand 573 states and 622 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:44:42,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:42,954 INFO L93 Difference]: Finished difference Result 585 states and 639 transitions. [2024-11-28 02:44:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:44:42,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-11-28 02:44:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:42,958 INFO L225 Difference]: With dead ends: 585 [2024-11-28 02:44:42,958 INFO L226 Difference]: Without dead ends: 585 [2024-11-28 02:44:42,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:44:42,959 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 5 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:42,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3107 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:44:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-28 02:44:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 583. [2024-11-28 02:44:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 398 states have (on average 1.5326633165829147) internal successors, (610), 576 states have internal predecessors, (610), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:44:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 637 transitions. [2024-11-28 02:44:42,973 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 637 transitions. Word has length 69 [2024-11-28 02:44:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:42,973 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 637 transitions. [2024-11-28 02:44:42,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:44:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 637 transitions. [2024-11-28 02:44:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 02:44:42,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:42,975 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:44:42,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 02:44:43,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:43,175 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:44:43,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1795904802, now seen corresponding path program 2 times [2024-11-28 02:44:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:44:43,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809372975] [2024-11-28 02:44:43,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:44:43,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:44:43,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:44:43,179 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:44:43,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 02:44:49,473 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:44:49,473 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:44:49,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 02:44:49,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:49,656 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:44:49,657 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 13 treesize of output 13 [2024-11-28 02:44:49,691 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-28 02:44:50,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:44:50,017 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 44 treesize of output 43 [2024-11-28 02:44:50,087 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 33 treesize of output 15 [2024-11-28 02:44:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 02:44:50,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:44:50,261 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 02:44:50,261 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 25 treesize of output 24 [2024-11-28 02:44:50,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:44:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809372975] [2024-11-28 02:44:50,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809372975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:44:50,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [941850407] [2024-11-28 02:44:50,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:44:50,350 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:44:50,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:44:50,357 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:44:50,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-28 02:44:51,260 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:44:51,260 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:44:51,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 02:44:51,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:44:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:51,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:44:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:44:52,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [941850407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:44:52,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:44:52,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-28 02:44:52,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116410629] [2024-11-28 02:44:52,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:44:52,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:44:52,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:44:52,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:44:52,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=552, Unknown=7, NotChecked=0, Total=650 [2024-11-28 02:44:52,121 INFO L87 Difference]: Start difference. First operand 583 states and 637 transitions. Second operand has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 02:45:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:02,808 INFO L93 Difference]: Finished difference Result 599 states and 659 transitions. [2024-11-28 02:45:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 02:45:02,809 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72 [2024-11-28 02:45:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:02,810 INFO L225 Difference]: With dead ends: 599 [2024-11-28 02:45:02,810 INFO L226 Difference]: Without dead ends: 593 [2024-11-28 02:45:02,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=395, Invalid=2248, Unknown=9, NotChecked=0, Total=2652 [2024-11-28 02:45:02,812 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 499 mSDsluCounter, 3400 mSDsCounter, 0 mSdLazyCounter, 3937 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:02,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 3685 Invalid, 3973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3937 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-28 02:45:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-28 02:45:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2024-11-28 02:45:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 407 states have (on average 1.5233415233415233) internal successors, (620), 584 states have internal predecessors, (620), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:45:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 647 transitions. [2024-11-28 02:45:02,828 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 647 transitions. Word has length 72 [2024-11-28 02:45:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:02,828 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 647 transitions. [2024-11-28 02:45:02,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 02:45:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 647 transitions. [2024-11-28 02:45:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 02:45:02,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:02,831 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:45:02,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 02:45:03,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-28 02:45:03,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 02:45:03,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:45:03,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:03,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1559042559, now seen corresponding path program 1 times [2024-11-28 02:45:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:45:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789817013] [2024-11-28 02:45:03,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:03,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:45:03,235 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:45:03,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 02:45:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:03,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 02:45:03,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:45:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:45:03,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:45:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:45:04,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:45:04,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789817013] [2024-11-28 02:45:04,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789817013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:45:04,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:45:04,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-28 02:45:04,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759573197] [2024-11-28 02:45:04,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:45:04,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 02:45:04,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:45:04,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 02:45:04,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:45:04,526 INFO L87 Difference]: Start difference. First operand 591 states and 647 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:45:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:07,905 INFO L93 Difference]: Finished difference Result 615 states and 686 transitions. [2024-11-28 02:45:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 02:45:07,906 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-28 02:45:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:07,908 INFO L225 Difference]: With dead ends: 615 [2024-11-28 02:45:07,908 INFO L226 Difference]: Without dead ends: 609 [2024-11-28 02:45:07,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 02:45:07,911 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 18 mSDsluCounter, 5700 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6221 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:07,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6221 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:45:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-28 02:45:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-28 02:45:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 425 states have (on average 1.5129411764705882) internal successors, (643), 602 states have internal predecessors, (643), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:45:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 670 transitions. [2024-11-28 02:45:07,927 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 670 transitions. Word has length 78 [2024-11-28 02:45:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:07,928 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 670 transitions. [2024-11-28 02:45:07,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:45:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 670 transitions. [2024-11-28 02:45:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 02:45:07,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:07,930 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:45:07,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 02:45:08,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:08,130 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:45:08,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -276271041, now seen corresponding path program 2 times [2024-11-28 02:45:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:45:08,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834754484] [2024-11-28 02:45:08,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:45:08,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:08,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:45:08,133 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:45:08,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 02:45:12,010 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:45:12,011 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:45:12,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 02:45:12,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:45:12,150 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:45:12,150 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 13 treesize of output 13 [2024-11-28 02:45:12,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:45:12,195 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-28 02:45:12,201 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-28 02:45:12,325 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-28 02:45:12,354 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-28 02:45:12,959 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:45:12,959 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-28 02:45:12,972 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-28 02:45:13,020 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-28 02:45:13,028 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-28 02:45:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-28 02:45:13,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:45:13,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_974) |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~mem32#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-28 02:45:13,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:45:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834754484] [2024-11-28 02:45:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834754484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:45:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1199764640] [2024-11-28 02:45:13,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:45:13,674 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:45:13,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:45:13,675 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:45:13,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-28 02:45:14,727 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:45:14,727 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:45:14,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 02:45:14,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:45:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:45:16,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:45:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:45:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1199764640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:45:19,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:45:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-28 02:45:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829911194] [2024-11-28 02:45:19,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:45:19,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 02:45:19,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:45:19,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 02:45:19,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-28 02:45:19,259 INFO L87 Difference]: Start difference. First operand 609 states and 670 transitions. Second operand has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 02:45:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:58,773 INFO L93 Difference]: Finished difference Result 656 states and 747 transitions. [2024-11-28 02:45:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-11-28 02:45:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 90 [2024-11-28 02:45:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:58,775 INFO L225 Difference]: With dead ends: 656 [2024-11-28 02:45:58,775 INFO L226 Difference]: Without dead ends: 644 [2024-11-28 02:45:58,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=3205, Invalid=15430, Unknown=1, NotChecked=270, Total=18906 [2024-11-28 02:45:58,779 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 513 mSDsluCounter, 7779 mSDsCounter, 0 mSdLazyCounter, 9933 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 8070 SdHoareTripleChecker+Invalid, 9972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 9933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:58,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 8070 Invalid, 9972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 9933 Invalid, 0 Unknown, 0 Unchecked, 28.2s Time] [2024-11-28 02:45:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-28 02:45:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2024-11-28 02:45:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 461 states have (on average 1.4880694143167028) internal successors, (686), 637 states have internal predecessors, (686), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:45:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 713 transitions. [2024-11-28 02:45:58,791 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 713 transitions. Word has length 90 [2024-11-28 02:45:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:58,792 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 713 transitions. [2024-11-28 02:45:58,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 02:45:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 713 transitions. [2024-11-28 02:45:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 02:45:58,793 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:58,793 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:45:58,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-28 02:45:59,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 02:45:59,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:59,194 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:45:59,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash -419521111, now seen corresponding path program 1 times [2024-11-28 02:45:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:45:59,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [447551400] [2024-11-28 02:45:59,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:59,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:59,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:45:59,197 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:45:59,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 02:45:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:59,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 02:45:59,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:45:59,705 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 7 [2024-11-28 02:45:59,861 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:45:59,861 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 13 treesize of output 13 [2024-11-28 02:45:59,879 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-28 02:46:00,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:00,494 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 44 treesize of output 43 [2024-11-28 02:46:00,594 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:00,594 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 44 treesize of output 43 [2024-11-28 02:46:00,610 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 33 treesize of output 15 [2024-11-28 02:46:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:46:00,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:46:00,671 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1528) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 02:46:00,682 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_1528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:46:01,175 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-28 02:46:01,175 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 37 treesize of output 36 [2024-11-28 02:46:01,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1574))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1528)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false [2024-11-28 02:46:01,188 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:46:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447551400] [2024-11-28 02:46:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447551400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:46:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1451870016] [2024-11-28 02:46:01,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:01,189 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:46:01,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:46:01,192 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:46:01,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-28 02:46:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:04,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 02:46:04,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:46:04,127 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 02:46:04,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-28 02:46:04,557 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 02:46:04,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-28 02:46:04,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:46:04,892 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 34 treesize of output 16 [2024-11-28 02:46:06,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:06,544 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 54 treesize of output 51 [2024-11-28 02:46:06,785 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:06,786 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 54 treesize of output 51 [2024-11-28 02:46:06,826 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 43 treesize of output 19 [2024-11-28 02:46:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:46:06,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:46:06,913 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 02:46:06,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_1944) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:46:07,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1990))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1944)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:46:07,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1451870016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:46:07,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:46:07,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 20 [2024-11-28 02:46:07,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373041754] [2024-11-28 02:46:07,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:46:07,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:46:07,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:46:07,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:46:07,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=385, Unknown=6, NotChecked=270, Total=756 [2024-11-28 02:46:07,415 INFO L87 Difference]: Start difference. First operand 644 states and 713 transitions. Second operand has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 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-28 02:46:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:14,110 INFO L93 Difference]: Finished difference Result 1159 states and 1288 transitions. [2024-11-28 02:46:14,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 02:46:14,110 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 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 115 [2024-11-28 02:46:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:14,113 INFO L225 Difference]: With dead ends: 1159 [2024-11-28 02:46:14,113 INFO L226 Difference]: Without dead ends: 1159 [2024-11-28 02:46:14,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=1005, Unknown=6, NotChecked=426, Total=1640 [2024-11-28 02:46:14,114 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1162 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:14,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 2546 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-28 02:46:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-28 02:46:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 643. [2024-11-28 02:46:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 461 states have (on average 1.4859002169197397) internal successors, (685), 636 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:46:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 712 transitions. [2024-11-28 02:46:14,129 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 712 transitions. Word has length 115 [2024-11-28 02:46:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:14,130 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 712 transitions. [2024-11-28 02:46:14,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 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-28 02:46:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 712 transitions. [2024-11-28 02:46:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 02:46:14,131 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:14,131 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:46:14,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-28 02:46:14,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-28 02:46:14,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:46:14,532 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:46:14,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash -419521110, now seen corresponding path program 1 times [2024-11-28 02:46:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:46:14,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784298391] [2024-11-28 02:46:14,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:14,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:46:14,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:46:14,537 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:46:14,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-28 02:46:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:15,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-28 02:46:15,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:46:15,016 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 7 [2024-11-28 02:46:15,131 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:46:15,131 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 13 treesize of output 13 [2024-11-28 02:46:15,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:46:15,163 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-28 02:46:15,172 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-28 02:46:15,280 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-28 02:46:15,285 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-28 02:46:16,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:16,083 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-28 02:46:16,099 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-28 02:46:16,217 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:16,217 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-28 02:46:16,224 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-28 02:46:16,256 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-28 02:46:16,263 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-28 02:46:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:46:16,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:46:16,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:46:16,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-28 02:46:17,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2498))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2499) .cse0 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2499) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2498) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-28 02:46:17,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:46:17,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784298391] [2024-11-28 02:46:17,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784298391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:46:17,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1444862464] [2024-11-28 02:46:17,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:17,880 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:46:17,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:46:17,883 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:46:17,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-28 02:46:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:20,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-28 02:46:20,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:46:20,822 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 7 [2024-11-28 02:46:20,966 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-28 02:46:20,982 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:46:20,983 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 13 treesize of output 13 [2024-11-28 02:46:21,004 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-28 02:46:21,015 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-28 02:46:21,088 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-28 02:46:21,095 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-28 02:46:21,928 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:21,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:46:21,939 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-28 02:46:22,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:22,027 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-28 02:46:22,039 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-28 02:46:22,071 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-28 02:46:22,080 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-28 02:46:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:46:22,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:46:22,143 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:46:22,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-28 02:46:23,544 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3007))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3008) .cse0 v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3008) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3007) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-28 02:46:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1444862464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:46:23,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:46:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-28 02:46:23,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236065274] [2024-11-28 02:46:23,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:46:23,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:46:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:46:23,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:46:23,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2024-11-28 02:46:23,552 INFO L87 Difference]: Start difference. First operand 643 states and 712 transitions. Second operand has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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-28 02:46:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:29,153 INFO L93 Difference]: Finished difference Result 642 states and 711 transitions. [2024-11-28 02:46:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:46:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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 115 [2024-11-28 02:46:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:29,155 INFO L225 Difference]: With dead ends: 642 [2024-11-28 02:46:29,155 INFO L226 Difference]: Without dead ends: 642 [2024-11-28 02:46:29,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2024-11-28 02:46:29,156 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 414 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:29,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1441 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-28 02:46:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-28 02:46:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-11-28 02:46:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 461 states have (on average 1.4837310195227766) internal successors, (684), 635 states have internal predecessors, (684), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:46:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 711 transitions. [2024-11-28 02:46:29,173 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 711 transitions. Word has length 115 [2024-11-28 02:46:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:29,173 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 711 transitions. [2024-11-28 02:46:29,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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-28 02:46:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 711 transitions. [2024-11-28 02:46:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 02:46:29,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:29,175 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:46:29,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-28 02:46:29,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-28 02:46:29,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 02:46:29,576 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:46:29,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash 401710501, now seen corresponding path program 1 times [2024-11-28 02:46:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:46:29,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312728354] [2024-11-28 02:46:29,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:29,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:46:29,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:46:29,579 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:46:29,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-28 02:46:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:30,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 02:46:30,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:46:30,110 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 7 [2024-11-28 02:46:30,227 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:46:30,227 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 13 treesize of output 13 [2024-11-28 02:46:30,249 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-28 02:46:30,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:30,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 02:46:30,941 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:30,941 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 44 treesize of output 43 [2024-11-28 02:46:31,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:31,018 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 44 treesize of output 43 [2024-11-28 02:46:31,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 33 treesize of output 15 [2024-11-28 02:46:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:46:31,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:46:31,154 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_3384) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:46:31,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3383))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:46:31,189 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_3383))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:46:31,642 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-28 02:46:31,643 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 61 treesize of output 60 [2024-11-28 02:46:31,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3430))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3383)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 02:46:31,656 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:46:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312728354] [2024-11-28 02:46:31,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312728354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:46:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1969969799] [2024-11-28 02:46:31,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:31,656 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:46:31,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:46:31,658 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:46:31,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-28 02:46:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:37,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 02:46:37,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:46:37,118 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 02:46:37,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-28 02:46:37,463 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 02:46:37,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-28 02:46:37,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:46:37,746 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 34 treesize of output 16 [2024-11-28 02:46:39,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:39,046 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 54 treesize of output 51 [2024-11-28 02:46:39,257 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:39,257 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 54 treesize of output 51 [2024-11-28 02:46:39,405 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:39,405 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 54 treesize of output 51 [2024-11-28 02:46:39,443 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 43 treesize of output 19 [2024-11-28 02:46:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:46:39,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:46:39,595 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3806))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:46:39,604 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_3806))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:46:40,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3853))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3806)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3384)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 02:46:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1969969799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:46:40,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:46:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 22 [2024-11-28 02:46:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626021056] [2024-11-28 02:46:40,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:46:40,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 02:46:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:46:40,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 02:46:40,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=499, Unknown=13, NotChecked=364, Total=992 [2024-11-28 02:46:40,042 INFO L87 Difference]: Start difference. First operand 642 states and 711 transitions. Second operand has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 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-28 02:46:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:47,345 INFO L93 Difference]: Finished difference Result 1155 states and 1284 transitions. [2024-11-28 02:46:47,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 02:46:47,345 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 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 118 [2024-11-28 02:46:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:47,349 INFO L225 Difference]: With dead ends: 1155 [2024-11-28 02:46:47,349 INFO L226 Difference]: Without dead ends: 1155 [2024-11-28 02:46:47,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 222 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=237, Invalid=1256, Unknown=17, NotChecked=560, Total=2070 [2024-11-28 02:46:47,351 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1496 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:47,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 2781 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-28 02:46:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-28 02:46:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 641. [2024-11-28 02:46:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 461 states have (on average 1.4815618221258136) internal successors, (683), 634 states have internal predecessors, (683), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:46:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 710 transitions. [2024-11-28 02:46:47,367 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 710 transitions. Word has length 118 [2024-11-28 02:46:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:47,367 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 710 transitions. [2024-11-28 02:46:47,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 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-28 02:46:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 710 transitions. [2024-11-28 02:46:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 02:46:47,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:47,370 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:46:47,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2024-11-28 02:46:47,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-28 02:46:47,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:46:47,771 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:46:47,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash 401710502, now seen corresponding path program 1 times [2024-11-28 02:46:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:46:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112750629] [2024-11-28 02:46:47,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:46:47,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:46:47,774 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:46:47,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-28 02:46:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:48,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-28 02:46:48,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:46:48,310 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 7 [2024-11-28 02:46:48,422 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:46:48,422 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 13 treesize of output 13 [2024-11-28 02:46:48,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:46:48,458 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-28 02:46:48,467 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-28 02:46:48,571 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-28 02:46:48,576 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-28 02:46:49,365 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:49,365 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-28 02:46:49,377 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-28 02:46:49,482 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:49,482 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-28 02:46:49,494 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-28 02:46:49,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:46:49,586 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-28 02:46:49,595 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-28 02:46:49,619 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-28 02:46:49,626 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-28 02:46:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:46:49,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:46:49,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2024-11-28 02:46:50,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4275) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4276))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4275) .cse2 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 02:46:50,134 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4275) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4276))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4275) .cse3 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 02:46:52,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4369))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4370) .cse1 v_ArrVal_4275) (select (select (store .cse2 .cse1 v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_4277))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4369))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4276))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4370) .cse4 v_ArrVal_4275) .cse5 v_ArrVal_4277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 02:46:52,142 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:46:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112750629] [2024-11-28 02:46:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112750629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:46:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1208861753] [2024-11-28 02:46:52,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:52,142 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:46:52,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:46:52,144 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:46:52,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-28 02:46:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:58,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-28 02:46:58,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:46:58,566 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 7 [2024-11-28 02:46:59,370 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:46:59,370 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 13 treesize of output 13 [2024-11-28 02:46:59,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:46:59,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:46:59,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:46:59,930 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 18 treesize of output 10 [2024-11-28 02:46:59,939 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 7 treesize of output 3 [2024-11-28 02:47:01,483 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:47:01,484 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 50 treesize of output 45 [2024-11-28 02:47:01,500 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 24 treesize of output 11 [2024-11-28 02:47:01,862 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:47:01,862 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 50 treesize of output 45 [2024-11-28 02:47:01,878 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 24 treesize of output 11 [2024-11-28 02:47:02,133 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:47:02,134 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 50 treesize of output 45 [2024-11-28 02:47:02,143 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 24 treesize of output 11 [2024-11-28 02:47:02,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 02:47:02,219 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 7 treesize of output 3 [2024-11-28 02:47:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:47:02,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:47:02,325 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:47:02,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 02:47:02,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4792) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4793))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4792) .cse2 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 02:47:02,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4793))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4792) .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4792) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2024-11-28 02:47:05,034 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4886))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_4793))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4887) .cse0 v_ArrVal_4792) .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4886))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4887) .cse6 v_ArrVal_4792) (select (select (store .cse7 .cse6 v_ArrVal_4793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4794))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-28 02:47:05,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1208861753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:05,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:47:05,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-28 02:47:05,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091109773] [2024-11-28 02:47:05,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:47:05,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:47:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:47:05,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:47:05,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=316, Unknown=18, NotChecked=396, Total=812 [2024-11-28 02:47:05,050 INFO L87 Difference]: Start difference. First operand 641 states and 710 transitions. Second operand has 17 states, 14 states have (on average 9.857142857142858) internal successors, (138), 17 states have internal predecessors, (138), 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-28 02:47:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:20,815 INFO L93 Difference]: Finished difference Result 651 states and 721 transitions. [2024-11-28 02:47:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:47:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.857142857142858) internal successors, (138), 17 states have internal predecessors, (138), 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 118 [2024-11-28 02:47:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:20,819 INFO L225 Difference]: With dead ends: 651 [2024-11-28 02:47:20,819 INFO L226 Difference]: Without dead ends: 651 [2024-11-28 02:47:20,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=136, Invalid=532, Unknown=18, NotChecked=504, Total=1190 [2024-11-28 02:47:20,821 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 755 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 3594 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 3607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:20,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 2244 Invalid, 3607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3594 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time] [2024-11-28 02:47:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-28 02:47:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2024-11-28 02:47:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 461 states have (on average 1.4793926247288502) internal successors, (682), 633 states have internal predecessors, (682), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:47:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 709 transitions. [2024-11-28 02:47:20,834 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 709 transitions. Word has length 118 [2024-11-28 02:47:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:20,835 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 709 transitions. [2024-11-28 02:47:20,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.857142857142858) internal successors, (138), 17 states have internal predecessors, (138), 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-28 02:47:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 709 transitions. [2024-11-28 02:47:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 02:47:20,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:20,837 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:47:20,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-28 02:47:21,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-28 02:47:21,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:21,237 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:47:21,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:21,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1578952528, now seen corresponding path program 1 times [2024-11-28 02:47:21,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:47:21,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935012598] [2024-11-28 02:47:21,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:21,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:21,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:21,240 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:21,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-28 02:47:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:21,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 02:47:21,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:21,825 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 7 [2024-11-28 02:47:22,172 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:47:22,172 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 13 treesize of output 13 [2024-11-28 02:47:22,216 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-28 02:47:23,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:23,435 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 44 treesize of output 43 [2024-11-28 02:47:23,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:23,667 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 44 treesize of output 43 [2024-11-28 02:47:23,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:23,844 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 44 treesize of output 43 [2024-11-28 02:47:24,026 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:24,026 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 44 treesize of output 43 [2024-11-28 02:47:24,064 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 33 treesize of output 15 [2024-11-28 02:47:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:47:24,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:47:24,221 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5270) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 02:47:24,238 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2024-11-28 02:47:24,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5269))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-28 02:47:24,285 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5269))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:47:24,316 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5268))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5269)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 02:47:24,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5268))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5269)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:47:25,121 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-28 02:47:25,121 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 109 treesize of output 108 [2024-11-28 02:47:25,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5316))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5268)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5269)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5270)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false [2024-11-28 02:47:25,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:47:25,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935012598] [2024-11-28 02:47:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935012598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:25,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [224566263] [2024-11-28 02:47:25,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:25,150 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:47:25,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:47:25,152 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:47:25,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-28 02:47:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:32,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 02:47:32,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:33,066 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 02:47:33,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-28 02:47:33,946 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 02:47:33,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-28 02:47:34,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:47:34,594 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 34 treesize of output 16 [2024-11-28 02:47:37,930 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:37,931 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 54 treesize of output 51 [2024-11-28 02:47:38,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:38,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-28 02:47:38,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:38,782 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 54 treesize of output 51 [2024-11-28 02:47:39,126 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:39,127 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 54 treesize of output 51 [2024-11-28 02:47:39,214 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 43 treesize of output 19 [2024-11-28 02:47:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:47:39,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:47:39,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5700) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 02:47:39,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5700) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:47:39,467 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5699))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:47:39,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5699))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:47:39,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5698))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5699)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:47:39,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5698))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5699)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:47:40,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5746))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5698)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5699)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5700)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:47:40,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [224566263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:40,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:47:40,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 24 [2024-11-28 02:47:40,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272205732] [2024-11-28 02:47:40,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:47:40,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-28 02:47:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:47:40,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 02:47:40,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=551, Unknown=14, NotChecked=854, Total=1560 [2024-11-28 02:47:40,229 INFO L87 Difference]: Start difference. First operand 640 states and 709 transitions. Second operand has 25 states, 22 states have (on average 7.0) internal successors, (154), 24 states have internal predecessors, (154), 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-28 02:47:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:59,767 INFO L93 Difference]: Finished difference Result 1151 states and 1280 transitions. [2024-11-28 02:47:59,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 02:47:59,768 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.0) internal successors, (154), 24 states have internal predecessors, (154), 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-28 02:47:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:59,771 INFO L225 Difference]: With dead ends: 1151 [2024-11-28 02:47:59,772 INFO L226 Difference]: Without dead ends: 1151 [2024-11-28 02:47:59,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=273, Invalid=1409, Unknown=14, NotChecked=1274, Total=2970 [2024-11-28 02:47:59,773 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 1472 mSDsluCounter, 3715 mSDsCounter, 0 mSdLazyCounter, 4234 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:59,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 3982 Invalid, 4314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4234 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2024-11-28 02:47:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-28 02:47:59,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 639. [2024-11-28 02:47:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 461 states have (on average 1.4772234273318872) internal successors, (681), 632 states have internal predecessors, (681), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:47:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 708 transitions. [2024-11-28 02:47:59,788 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 708 transitions. Word has length 121 [2024-11-28 02:47:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:59,789 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 708 transitions. [2024-11-28 02:47:59,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.0) internal successors, (154), 24 states have internal predecessors, (154), 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-28 02:47:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 708 transitions. [2024-11-28 02:47:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 02:47:59,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:59,790 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:47:59,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-28 02:48:00,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-28 02:48:00,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:00,191 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:48:00,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1578952529, now seen corresponding path program 1 times [2024-11-28 02:48:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:48:00,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227161307] [2024-11-28 02:48:00,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:00,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:00,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:00,194 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:00,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-28 02:48:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:00,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-28 02:48:00,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:00,826 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 7 [2024-11-28 02:48:01,157 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-28 02:48:01,200 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:48:01,200 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 13 treesize of output 13 [2024-11-28 02:48:01,257 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-28 02:48:01,274 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-28 02:48:01,509 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-28 02:48:01,518 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-28 02:48:03,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:03,092 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-28 02:48:03,110 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-28 02:48:03,343 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:03,343 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-28 02:48:03,366 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-28 02:48:03,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:03,565 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-28 02:48:03,581 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-28 02:48:03,795 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:03,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 62 treesize of output 57 [2024-11-28 02:48:03,811 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-28 02:48:03,860 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-28 02:48:03,876 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-28 02:48:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:48:03,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:04,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6178) |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~mem36#1.base| v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-28 02:48:04,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-28 02:48:04,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6176) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6177))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6176) .cse3 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 02:48:05,090 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6174))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6177))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6175) .cse0 v_ArrVal_6176) .cse1 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6174))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6175) .cse6 v_ArrVal_6176) (select (select (store .cse7 .cse6 v_ArrVal_6177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6178))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2024-11-28 02:48:05,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6174))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6175) .cse2 v_ArrVal_6176) (select (select (store .cse3 .cse2 v_ArrVal_6177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6178))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6174))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_6177))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6175) .cse5 v_ArrVal_6176) .cse6 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-28 02:48:12,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6270))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_6174))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6177))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6271) .cse0 v_ArrVal_6175) .cse1 v_ArrVal_6176) .cse2 v_ArrVal_6178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6270))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_6174))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6271) .cse8 v_ArrVal_6175) .cse9 v_ArrVal_6176) (select (select (store .cse10 .cse9 v_ArrVal_6177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6178))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-28 02:48:12,285 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:48:12,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227161307] [2024-11-28 02:48:12,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227161307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:12,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [985130112] [2024-11-28 02:48:12,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:12,286 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:48:12,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:48:12,287 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:48:12,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-28 02:48:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:21,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-28 02:48:21,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:21,244 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 7 [2024-11-28 02:48:28,079 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:48:28,079 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 13 treesize of output 13 [2024-11-28 02:48:28,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:48:29,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:48:29,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:48:32,669 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 18 treesize of output 10 [2024-11-28 02:48:32,730 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 7 treesize of output 3 [2024-11-28 02:48:44,634 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:48:44,634 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 50 treesize of output 45 [2024-11-28 02:48:44,695 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 24 treesize of output 11 [2024-11-28 02:48:47,678 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:48:47,678 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 50 treesize of output 45 [2024-11-28 02:48:47,739 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 24 treesize of output 11 [2024-11-28 02:48:50,043 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:48:50,043 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 50 treesize of output 45 [2024-11-28 02:48:50,105 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 24 treesize of output 11 [2024-11-28 02:48:52,304 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:48:52,304 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 50 treesize of output 45 [2024-11-28 02:48:52,483 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 24 treesize of output 11 [2024-11-28 02:48:52,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 02:48:53,020 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 7 treesize of output 3 [2024-11-28 02:48:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:48:53,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:53,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:48:53,878 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-28 02:48:54,255 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6702) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6701))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6702) .cse2 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 02:48:54,537 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6702) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6701))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6702) .cse3 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 02:48:54,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6699))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6700) .cse1 v_ArrVal_6702) (select (select (store .cse2 .cse1 v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6704))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6699))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6701))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6700) .cse4 v_ArrVal_6702) .cse5 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 02:48:55,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6699))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6701))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6700) .cse1 v_ArrVal_6702) .cse2 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6699))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6700) .cse7 v_ArrVal_6702) (select (select (store .cse8 .cse7 v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6704))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-28 02:49:01,864 WARN L286 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 356 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-28 02:49:02,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6795))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_6699))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6796) .cse1 v_ArrVal_6700) .cse2 v_ArrVal_6702) (select (select (store .cse3 .cse2 v_ArrVal_6701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6704))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6795))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_6699))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_6701))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6796) .cse6 v_ArrVal_6700) .cse7 v_ArrVal_6702) .cse8 v_ArrVal_6704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_6703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-28 02:49:03,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [985130112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:49:03,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:49:03,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2024-11-28 02:49:03,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255403086] [2024-11-28 02:49:03,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:49:03,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:49:03,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:49:03,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:49:03,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=392, Unknown=22, NotChecked=676, Total=1190 [2024-11-28 02:49:03,018 INFO L87 Difference]: Start difference. First operand 639 states and 708 transitions. Second operand has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 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-28 02:50:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:39,463 INFO L93 Difference]: Finished difference Result 649 states and 719 transitions. [2024-11-28 02:50:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:50:39,464 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 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 121 [2024-11-28 02:50:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:39,466 INFO L225 Difference]: With dead ends: 649 [2024-11-28 02:50:39,466 INFO L226 Difference]: Without dead ends: 649 [2024-11-28 02:50:39,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=164, Invalid=678, Unknown=22, NotChecked=858, Total=1722 [2024-11-28 02:50:39,467 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 756 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 2948 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:39,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1885 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2948 Invalid, 0 Unknown, 0 Unchecked, 91.7s Time] [2024-11-28 02:50:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-28 02:50:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 638. [2024-11-28 02:50:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 461 states have (on average 1.475054229934924) internal successors, (680), 631 states have internal predecessors, (680), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 02:50:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 707 transitions. [2024-11-28 02:50:39,479 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 707 transitions. Word has length 121 [2024-11-28 02:50:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:39,479 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 707 transitions. [2024-11-28 02:50:39,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 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-28 02:50:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 707 transitions. [2024-11-28 02:50:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 02:50:39,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:39,483 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:39,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-28 02:50:39,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-28 02:50:39,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 02:50:39,884 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:50:39,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:39,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1404319278, now seen corresponding path program 1 times [2024-11-28 02:50:39,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:50:39,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2091660068] [2024-11-28 02:50:39,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:39,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:50:39,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:50:39,887 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:50:39,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-28 02:50:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:40,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 02:50:40,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:50:40,637 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 7 [2024-11-28 02:50:43,999 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 02:50:43,999 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 13 treesize of output 13 [2024-11-28 02:50:44,382 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-28 02:50:53,943 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:50:53,943 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 44 treesize of output 43 [2024-11-28 02:50:55,871 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:50:55,871 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 44 treesize of output 43 [2024-11-28 02:50:57,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:50:57,388 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 44 treesize of output 43 [2024-11-28 02:50:58,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:50:58,913 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 44 treesize of output 43 [2024-11-28 02:51:00,431 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:51:00,431 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 44 treesize of output 43 [2024-11-28 02:51:00,714 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 33 treesize of output 15 [2024-11-28 02:51:02,006 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-28 02:51:02,006 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 21 treesize of output 20 [2024-11-28 02:51:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 02:51:02,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:51:03,838 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7188) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 02:51:03,970 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:51:04,172 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7187))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:51:04,312 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7187))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 02:51:05,695 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7186))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:51:05,910 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7185))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7186)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:51:06,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7185))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7186)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:51:10,130 INFO L349 Elim1Store]: treesize reduction 7, result has 96.5 percent of original size [2024-11-28 02:51:10,130 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 205 treesize of output 204 [2024-11-28 02:51:10,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7235))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7185)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7186)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7187)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7188)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 02:51:10,288 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:51:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091660068] [2024-11-28 02:51:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091660068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [805879141] [2024-11-28 02:51:10,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:51:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:51:10,290 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:51:10,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c565176-c9e9-47f9-a9d9-13f1aeca08aa/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process