./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:14:44,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:14:44,661 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-24 01:14:44,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:14:44,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:14:44,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:14:44,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:14:44,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:14:44,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:14:44,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:14:44,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:14:44,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:14:44,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:14:44,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:14:44,729 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:14:44,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:14:44,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:14:44,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:14:44,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:14:44,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:14:44,733 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 01:14:44,733 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 01:14:44,734 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 01:14:44,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:14:44,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:14:44,735 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 01:14:44,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:14:44,735 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:14:44,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:14:44,735 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:14:44,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:14:44,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:14:44,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:14:44,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:14:44,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:14:44,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:14:44,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:14:44,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:14:44,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:14:44,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:14:44,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:14:44,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:14:44,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:14:44,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:14:44,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:14:44,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:14:44,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:14:44,738 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_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-24 01:14:45,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:14:45,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:14:45,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:14:45,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:14:45,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:14:45,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-11-24 01:14:48,533 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/data/24cf050d3/bbe70aae904241099872ce763fda76ad/FLAGafcaecbb5 [2024-11-24 01:14:49,025 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:14:49,026 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-11-24 01:14:49,048 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/data/24cf050d3/bbe70aae904241099872ce763fda76ad/FLAGafcaecbb5 [2024-11-24 01:14:49,077 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/data/24cf050d3/bbe70aae904241099872ce763fda76ad [2024-11-24 01:14:49,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:14:49,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:14:49,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:14:49,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:14:49,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:14:49,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:14:49" (1/1) ... [2024-11-24 01:14:49,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eed9dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:49, skipping insertion in model container [2024-11-24 01:14:49,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:14:49" (1/1) ... [2024-11-24 01:14:49,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:14:49,705 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-24 01:14:49,748 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-24 01:14:49,754 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-24 01:14:49,759 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-24 01:14:49,769 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-24 01:14:49,835 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-24 01:14:49,839 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-24 01:14:49,842 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-24 01:14:49,850 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-24 01:14:49,864 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-24 01:14:49,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:14:49,891 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:14:50,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:14:50,165 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:14:50,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50 WrapperNode [2024-11-24 01:14:50,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:14:50,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:14:50,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:14:50,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:14:50,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,342 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1529 [2024-11-24 01:14:50,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:14:50,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:14:50,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:14:50,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:14:50,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,520 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-24 01:14:50,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:14:50,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:14:50,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:14:50,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:14:50,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (1/1) ... [2024-11-24 01:14:50,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:14:50,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:14:50,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:14:50,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:14:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-24 01:14:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-24 01:14:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-24 01:14:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-24 01:14:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-24 01:14:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-24 01:14:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-24 01:14:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-24 01:14:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-24 01:14:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:14:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-24 01:14:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-24 01:14:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-24 01:14:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-24 01:14:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-24 01:14:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:14:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 01:14:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:14:50,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:14:51,071 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:14:51,073 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:14:51,076 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-24 01:14:51,125 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-24 01:14:55,026 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2024-11-24 01:14:55,026 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:14:55,088 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:14:55,088 INFO L312 CfgBuilder]: Removed 34 assume(true) statements. [2024-11-24 01:14:55,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:14:55 BoogieIcfgContainer [2024-11-24 01:14:55,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:14:55,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:14:55,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:14:55,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:14:55,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:14:49" (1/3) ... [2024-11-24 01:14:55,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cff7234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:14:55, skipping insertion in model container [2024-11-24 01:14:55,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:50" (2/3) ... [2024-11-24 01:14:55,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cff7234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:14:55, skipping insertion in model container [2024-11-24 01:14:55,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:14:55" (3/3) ... [2024-11-24 01:14:55,110 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-1.i [2024-11-24 01:14:55,129 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:14:55,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test4-1.i that has 3 procedures, 1438 locations, 1 initial locations, 36 loop locations, and 628 error locations. [2024-11-24 01:14:55,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:14:55,254 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;@b892e27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:14:55,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-24 01:14:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 1433 states, 803 states have (on average 2.075965130759651) internal successors, (1667), 1425 states have internal predecessors, (1667), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-24 01:14:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-24 01:14:55,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:14:55,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-24 01:14:55,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:14:55,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:14:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1482281, now seen corresponding path program 1 times [2024-11-24 01:14:55,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:14:55,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442279824] [2024-11-24 01:14:55,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:14:55,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:14:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:14:55,494 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-24 01:14:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:14:55,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442279824] [2024-11-24 01:14:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442279824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:14:55,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:14:55,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:14:55,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653850077] [2024-11-24 01:14:55,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:14:55,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:14:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:14:55,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:14:55,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:14:55,545 INFO L87 Difference]: Start difference. First operand has 1433 states, 803 states have (on average 2.075965130759651) internal successors, (1667), 1425 states have internal predecessors, (1667), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:14:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:14:56,969 INFO L93 Difference]: Finished difference Result 1439 states and 1619 transitions. [2024-11-24 01:14:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:14:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-24 01:14:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:14:56,990 INFO L225 Difference]: With dead ends: 1439 [2024-11-24 01:14:56,990 INFO L226 Difference]: Without dead ends: 1435 [2024-11-24 01:14:56,992 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-24 01:14:56,996 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 27 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:14:56,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2552 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 01:14:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-11-24 01:14:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1425. [2024-11-24 01:14:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 806 states have (on average 1.9826302729528535) internal successors, (1598), 1417 states have internal predecessors, (1598), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-24 01:14:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1610 transitions. [2024-11-24 01:14:57,127 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1610 transitions. Word has length 4 [2024-11-24 01:14:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:14:57,127 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1610 transitions. [2024-11-24 01:14:57,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:14:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1610 transitions. [2024-11-24 01:14:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-24 01:14:57,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:14:57,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:14:57,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:14:57,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:14:57,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:14:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1137182981, now seen corresponding path program 1 times [2024-11-24 01:14:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:14:57,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827150795] [2024-11-24 01:14:57,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:14:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:14:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:14:57,280 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-24 01:14:57,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:14:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827150795] [2024-11-24 01:14:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827150795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:14:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:14:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:14:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457067854] [2024-11-24 01:14:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:14:57,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:14:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:14:57,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:14:57,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:14:57,283 INFO L87 Difference]: Start difference. First operand 1425 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-24 01:14:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:14:58,066 INFO L93 Difference]: Finished difference Result 2326 states and 2655 transitions. [2024-11-24 01:14:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:14:58,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-24 01:14:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:14:58,079 INFO L225 Difference]: With dead ends: 2326 [2024-11-24 01:14:58,079 INFO L226 Difference]: Without dead ends: 2324 [2024-11-24 01:14:58,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:14:58,082 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 1058 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:14:58,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 4419 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 01:14:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2024-11-24 01:14:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1965. [2024-11-24 01:14:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1346 states have (on average 1.9576523031203565) internal successors, (2635), 1954 states have internal predecessors, (2635), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:14:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2653 transitions. [2024-11-24 01:14:58,173 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2653 transitions. Word has length 7 [2024-11-24 01:14:58,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:14:58,174 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2653 transitions. [2024-11-24 01:14:58,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-24 01:14:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2653 transitions. [2024-11-24 01:14:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-24 01:14:58,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:14:58,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:14:58,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:14:58,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:14:58,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:14:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1134636893, now seen corresponding path program 1 times [2024-11-24 01:14:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:14:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725498825] [2024-11-24 01:14:58,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:14:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:14:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:14:58,335 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-24 01:14:58,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:14:58,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725498825] [2024-11-24 01:14:58,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725498825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:14:58,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:14:58,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:14:58,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851221273] [2024-11-24 01:14:58,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:14:58,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:14:58,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:14:58,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:14:58,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:14:58,338 INFO L87 Difference]: Start difference. First operand 1965 states and 2653 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-24 01:14:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:14:59,737 INFO L93 Difference]: Finished difference Result 1871 states and 2509 transitions. [2024-11-24 01:14:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:14:59,738 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-24 01:14:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:14:59,750 INFO L225 Difference]: With dead ends: 1871 [2024-11-24 01:14:59,750 INFO L226 Difference]: Without dead ends: 1871 [2024-11-24 01:14:59,751 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-24 01:14:59,753 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1354 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:14:59,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 889 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 01:14:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2024-11-24 01:14:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1871. [2024-11-24 01:14:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1346 states have (on average 1.8506686478454681) internal successors, (2491), 1860 states have internal predecessors, (2491), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:14:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2509 transitions. [2024-11-24 01:14:59,827 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2509 transitions. Word has length 7 [2024-11-24 01:14:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:14:59,827 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2509 transitions. [2024-11-24 01:14:59,828 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-24 01:14:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2509 transitions. [2024-11-24 01:14:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-24 01:14:59,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:14:59,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:14:59,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:14:59,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:14:59,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:14:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1134636894, now seen corresponding path program 1 times [2024-11-24 01:14:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:14:59,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546592863] [2024-11-24 01:14:59,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:14:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:14:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:14:59,958 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-24 01:14:59,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:14:59,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546592863] [2024-11-24 01:14:59,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546592863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:14:59,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:14:59,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:14:59,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772221552] [2024-11-24 01:14:59,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:14:59,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:14:59,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:14:59,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:14:59,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:14:59,961 INFO L87 Difference]: Start difference. First operand 1871 states and 2509 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-24 01:15:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:01,461 INFO L93 Difference]: Finished difference Result 2503 states and 3362 transitions. [2024-11-24 01:15:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:15:01,462 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-24 01:15:01,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:01,472 INFO L225 Difference]: With dead ends: 2503 [2024-11-24 01:15:01,472 INFO L226 Difference]: Without dead ends: 2503 [2024-11-24 01:15:01,472 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-24 01:15:01,473 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 821 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:01,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1965 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-24 01:15:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-11-24 01:15:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2347. [2024-11-24 01:15:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1832 states have (on average 1.8116812227074235) internal successors, (3319), 2336 states have internal predecessors, (3319), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3337 transitions. [2024-11-24 01:15:01,537 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3337 transitions. Word has length 7 [2024-11-24 01:15:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:01,538 INFO L471 AbstractCegarLoop]: Abstraction has 2347 states and 3337 transitions. [2024-11-24 01:15:01,538 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-24 01:15:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3337 transitions. [2024-11-24 01:15:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-24 01:15:01,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:01,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:15:01,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:15:01,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:01,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:01,540 INFO L85 PathProgramCache]: Analyzing trace with hash -567156950, now seen corresponding path program 1 times [2024-11-24 01:15:01,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:01,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721566593] [2024-11-24 01:15:01,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:01,708 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-24 01:15:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721566593] [2024-11-24 01:15:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721566593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:15:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646733508] [2024-11-24 01:15:01,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:01,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:15:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:01,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:15:01,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:15:01,711 INFO L87 Difference]: Start difference. First operand 2347 states and 3337 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-24 01:15:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:03,327 INFO L93 Difference]: Finished difference Result 2422 states and 3443 transitions. [2024-11-24 01:15:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:15:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-24 01:15:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:03,339 INFO L225 Difference]: With dead ends: 2422 [2024-11-24 01:15:03,339 INFO L226 Difference]: Without dead ends: 2422 [2024-11-24 01:15:03,339 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-24 01:15:03,340 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 1622 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:03,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 1577 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-24 01:15:03,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2024-11-24 01:15:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2324. [2024-11-24 01:15:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1832 states have (on average 1.7865720524017468) internal successors, (3273), 2313 states have internal predecessors, (3273), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3291 transitions. [2024-11-24 01:15:03,408 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3291 transitions. Word has length 13 [2024-11-24 01:15:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:03,408 INFO L471 AbstractCegarLoop]: Abstraction has 2324 states and 3291 transitions. [2024-11-24 01:15:03,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-24 01:15:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3291 transitions. [2024-11-24 01:15:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-24 01:15:03,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:03,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:15:03,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 01:15:03,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:03,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash -567156949, now seen corresponding path program 1 times [2024-11-24 01:15:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:03,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521935798] [2024-11-24 01:15:03,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:03,513 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-24 01:15:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521935798] [2024-11-24 01:15:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521935798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:15:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119914364] [2024-11-24 01:15:03,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:15:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:03,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:15:03,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:15:03,514 INFO L87 Difference]: Start difference. First operand 2324 states and 3291 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-24 01:15:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:03,595 INFO L93 Difference]: Finished difference Result 2186 states and 3085 transitions. [2024-11-24 01:15:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:15:03,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-24 01:15:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:03,606 INFO L225 Difference]: With dead ends: 2186 [2024-11-24 01:15:03,606 INFO L226 Difference]: Without dead ends: 2186 [2024-11-24 01:15:03,606 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-24 01:15:03,608 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 61 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2639 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-24 01:15:03,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2639 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:15:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2024-11-24 01:15:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2186. [2024-11-24 01:15:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1706 states have (on average 1.7977725674091443) internal successors, (3067), 2175 states have internal predecessors, (3067), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3085 transitions. [2024-11-24 01:15:03,679 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3085 transitions. Word has length 13 [2024-11-24 01:15:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:03,679 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 3085 transitions. [2024-11-24 01:15:03,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-24 01:15:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3085 transitions. [2024-11-24 01:15:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-24 01:15:03,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:03,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:15:03,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:15:03,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:03,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 423295012, now seen corresponding path program 1 times [2024-11-24 01:15:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401430031] [2024-11-24 01:15:03,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:15:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:03,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401430031] [2024-11-24 01:15:03,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401430031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:03,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:03,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:15:03,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207167940] [2024-11-24 01:15:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:03,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:15:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:03,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:15:03,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:15:03,790 INFO L87 Difference]: Start difference. First operand 2186 states and 3085 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:03,895 INFO L93 Difference]: Finished difference Result 2157 states and 3035 transitions. [2024-11-24 01:15:03,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:15:03,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-24 01:15:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:03,908 INFO L225 Difference]: With dead ends: 2157 [2024-11-24 01:15:03,909 INFO L226 Difference]: Without dead ends: 2157 [2024-11-24 01:15:03,909 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-24 01:15:03,910 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 41 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3905 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-24 01:15:03,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3905 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:15:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2024-11-24 01:15:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2151. [2024-11-24 01:15:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 1678 states have (on average 1.794398092967819) internal successors, (3011), 2140 states have internal predecessors, (3011), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3029 transitions. [2024-11-24 01:15:03,973 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3029 transitions. Word has length 15 [2024-11-24 01:15:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:03,974 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3029 transitions. [2024-11-24 01:15:03,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3029 transitions. [2024-11-24 01:15:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-24 01:15:03,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:03,976 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] [2024-11-24 01:15:03,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 01:15:03,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:03,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:03,977 INFO L85 PathProgramCache]: Analyzing trace with hash 912325906, now seen corresponding path program 1 times [2024-11-24 01:15:03,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:03,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279596724] [2024-11-24 01:15:03,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:03,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:04,338 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-24 01:15:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:04,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279596724] [2024-11-24 01:15:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279596724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:04,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:04,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:15:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071063522] [2024-11-24 01:15:04,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:04,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:15:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:04,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:15:04,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:15:04,340 INFO L87 Difference]: Start difference. First operand 2151 states and 3029 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-24 01:15:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:06,200 INFO L93 Difference]: Finished difference Result 2401 states and 3198 transitions. [2024-11-24 01:15:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:15:06,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-11-24 01:15:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:06,210 INFO L225 Difference]: With dead ends: 2401 [2024-11-24 01:15:06,210 INFO L226 Difference]: Without dead ends: 2401 [2024-11-24 01:15:06,211 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-24 01:15:06,212 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 826 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:06,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 2632 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-24 01:15:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2024-11-24 01:15:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2147. [2024-11-24 01:15:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1678 states have (on average 1.7896305125148988) internal successors, (3003), 2136 states have internal predecessors, (3003), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3021 transitions. [2024-11-24 01:15:06,268 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3021 transitions. Word has length 29 [2024-11-24 01:15:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:06,269 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 3021 transitions. [2024-11-24 01:15:06,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-24 01:15:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3021 transitions. [2024-11-24 01:15:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-24 01:15:06,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:06,273 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] [2024-11-24 01:15:06,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:15:06,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:06,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -673514776, now seen corresponding path program 1 times [2024-11-24 01:15:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828618938] [2024-11-24 01:15:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:06,473 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-24 01:15:06,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828618938] [2024-11-24 01:15:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828618938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:06,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:15:06,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733169637] [2024-11-24 01:15:06,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:06,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:15:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:06,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:15:06,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:15:06,477 INFO L87 Difference]: Start difference. First operand 2147 states and 3021 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:06,567 INFO L93 Difference]: Finished difference Result 2147 states and 3013 transitions. [2024-11-24 01:15:06,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:15:06,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-24 01:15:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:06,579 INFO L225 Difference]: With dead ends: 2147 [2024-11-24 01:15:06,579 INFO L226 Difference]: Without dead ends: 2147 [2024-11-24 01:15:06,579 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-24 01:15:06,580 INFO L435 NwaCegarLoop]: 1306 mSDtfsCounter, 21 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3887 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.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:06,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3887 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:15:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2024-11-24 01:15:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2147. [2024-11-24 01:15:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1678 states have (on average 1.7848629320619784) internal successors, (2995), 2136 states have internal predecessors, (2995), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3013 transitions. [2024-11-24 01:15:06,650 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3013 transitions. Word has length 63 [2024-11-24 01:15:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:06,653 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 3013 transitions. [2024-11-24 01:15:06,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3013 transitions. [2024-11-24 01:15:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-24 01:15:06,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:06,655 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] [2024-11-24 01:15:06,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 01:15:06,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash -354565324, now seen corresponding path program 1 times [2024-11-24 01:15:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:06,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229102091] [2024-11-24 01:15:06,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:06,913 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-24 01:15:06,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229102091] [2024-11-24 01:15:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229102091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:06,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:06,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:15:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150975392] [2024-11-24 01:15:06,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:06,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:15:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:06,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:15:06,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:15:06,916 INFO L87 Difference]: Start difference. First operand 2147 states and 3013 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:06,973 INFO L93 Difference]: Finished difference Result 1916 states and 2610 transitions. [2024-11-24 01:15:06,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:15:06,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-24 01:15:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:06,982 INFO L225 Difference]: With dead ends: 1916 [2024-11-24 01:15:06,982 INFO L226 Difference]: Without dead ends: 1916 [2024-11-24 01:15:06,983 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-24 01:15:06,984 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 54 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:06,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2614 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:15:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-24 01:15:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2024-11-24 01:15:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1447 states have (on average 1.7912923289564617) internal successors, (2592), 1905 states have internal predecessors, (2592), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2610 transitions. [2024-11-24 01:15:07,033 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2610 transitions. Word has length 71 [2024-11-24 01:15:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:07,035 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2610 transitions. [2024-11-24 01:15:07,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2610 transitions. [2024-11-24 01:15:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-24 01:15:07,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:07,036 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] [2024-11-24 01:15:07,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:15:07,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:07,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:07,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1640032229, now seen corresponding path program 1 times [2024-11-24 01:15:07,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:07,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503942734] [2024-11-24 01:15:07,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:07,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:07,934 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-24 01:15:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503942734] [2024-11-24 01:15:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503942734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:07,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:15:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151394431] [2024-11-24 01:15:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:07,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:15:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:07,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:15:07,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:15:07,936 INFO L87 Difference]: Start difference. First operand 1916 states and 2610 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:09,580 INFO L93 Difference]: Finished difference Result 1832 states and 2485 transitions. [2024-11-24 01:15:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:15:09,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-24 01:15:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:09,587 INFO L225 Difference]: With dead ends: 1832 [2024-11-24 01:15:09,587 INFO L226 Difference]: Without dead ends: 1832 [2024-11-24 01:15:09,587 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-24 01:15:09,588 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1157 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:09,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1131 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-24 01:15:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-24 01:15:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1559. [2024-11-24 01:15:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1174 states have (on average 1.6890971039182283) internal successors, (1983), 1548 states have internal predecessors, (1983), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2001 transitions. [2024-11-24 01:15:09,626 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2001 transitions. Word has length 74 [2024-11-24 01:15:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:09,626 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2001 transitions. [2024-11-24 01:15:09,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2001 transitions. [2024-11-24 01:15:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-24 01:15:09,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:09,628 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] [2024-11-24 01:15:09,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 01:15:09,628 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:09,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1277110201, now seen corresponding path program 1 times [2024-11-24 01:15:09,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:09,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939074735] [2024-11-24 01:15:09,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:10,077 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-24 01:15:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:10,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939074735] [2024-11-24 01:15:10,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939074735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:10,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:10,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:15:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782191232] [2024-11-24 01:15:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:10,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:15:10,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:10,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:15:10,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:15:10,080 INFO L87 Difference]: Start difference. First operand 1559 states and 2001 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:11,681 INFO L93 Difference]: Finished difference Result 1558 states and 1999 transitions. [2024-11-24 01:15:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:15:11,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-24 01:15:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:11,690 INFO L225 Difference]: With dead ends: 1558 [2024-11-24 01:15:11,692 INFO L226 Difference]: Without dead ends: 1558 [2024-11-24 01:15:11,692 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-24 01:15:11,693 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 2 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:11,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3472 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-24 01:15:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2024-11-24 01:15:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2024-11-24 01:15:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1174 states have (on average 1.6873935264054514) internal successors, (1981), 1547 states have internal predecessors, (1981), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1999 transitions. [2024-11-24 01:15:11,722 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1999 transitions. Word has length 79 [2024-11-24 01:15:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:11,722 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 1999 transitions. [2024-11-24 01:15:11,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1999 transitions. [2024-11-24 01:15:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-24 01:15:11,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:11,724 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] [2024-11-24 01:15:11,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 01:15:11,725 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:11,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1277110200, now seen corresponding path program 1 times [2024-11-24 01:15:11,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:11,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836965288] [2024-11-24 01:15:11,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:11,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:12,481 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-24 01:15:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:12,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836965288] [2024-11-24 01:15:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836965288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:15:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348867429] [2024-11-24 01:15:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:12,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:15:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:12,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:15:12,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:15:12,483 INFO L87 Difference]: Start difference. First operand 1558 states and 1999 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:14,023 INFO L93 Difference]: Finished difference Result 1557 states and 1997 transitions. [2024-11-24 01:15:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:15:14,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-24 01:15:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:14,030 INFO L225 Difference]: With dead ends: 1557 [2024-11-24 01:15:14,031 INFO L226 Difference]: Without dead ends: 1557 [2024-11-24 01:15:14,031 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-24 01:15:14,031 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 1 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3487 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:14,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3487 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-24 01:15:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2024-11-24 01:15:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2024-11-24 01:15:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1172 states have (on average 1.6885665529010239) internal successors, (1979), 1546 states have internal predecessors, (1979), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1997 transitions. [2024-11-24 01:15:14,081 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1997 transitions. Word has length 79 [2024-11-24 01:15:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:14,082 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 1997 transitions. [2024-11-24 01:15:14,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:15:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1997 transitions. [2024-11-24 01:15:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-24 01:15:14,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:14,087 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-24 01:15:14,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 01:15:14,087 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:14,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1471579886, now seen corresponding path program 1 times [2024-11-24 01:15:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372597555] [2024-11-24 01:15:14,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:14,442 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-24 01:15:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:14,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372597555] [2024-11-24 01:15:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372597555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:14,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:14,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:15:14,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469107684] [2024-11-24 01:15:14,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:14,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:15:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:14,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:15:14,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:15:14,446 INFO L87 Difference]: Start difference. First operand 1557 states and 1997 transitions. Second operand has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:16,527 INFO L93 Difference]: Finished difference Result 1575 states and 2027 transitions. [2024-11-24 01:15:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:15:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-11-24 01:15:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:16,535 INFO L225 Difference]: With dead ends: 1575 [2024-11-24 01:15:16,536 INFO L226 Difference]: Without dead ends: 1575 [2024-11-24 01:15:16,536 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-24 01:15:16,537 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 6 mSDsluCounter, 4253 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5475 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:16,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5475 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-24 01:15:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-24 01:15:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1566. [2024-11-24 01:15:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1180 states have (on average 1.6864406779661016) internal successors, (1990), 1553 states have internal predecessors, (1990), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-24 01:15:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2017 transitions. [2024-11-24 01:15:16,597 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2017 transitions. Word has length 87 [2024-11-24 01:15:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:16,598 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2017 transitions. [2024-11-24 01:15:16,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2017 transitions. [2024-11-24 01:15:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-24 01:15:16,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:16,601 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-24 01:15:16,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 01:15:16,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:16,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1471579887, now seen corresponding path program 1 times [2024-11-24 01:15:16,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:16,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726486887] [2024-11-24 01:15:16,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:17,469 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-24 01:15:17,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:17,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726486887] [2024-11-24 01:15:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726486887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:17,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:17,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:15:17,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973070902] [2024-11-24 01:15:17,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:17,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:15:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:17,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:15:17,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:15:17,472 INFO L87 Difference]: Start difference. First operand 1566 states and 2017 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:19,416 INFO L93 Difference]: Finished difference Result 1566 states and 2015 transitions. [2024-11-24 01:15:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:15:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-11-24 01:15:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:19,423 INFO L225 Difference]: With dead ends: 1566 [2024-11-24 01:15:19,423 INFO L226 Difference]: Without dead ends: 1566 [2024-11-24 01:15:19,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:15:19,424 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 1 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4503 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:19,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4503 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-24 01:15:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-24 01:15:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-24 01:15:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1180 states have (on average 1.6847457627118645) internal successors, (1988), 1553 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-24 01:15:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2015 transitions. [2024-11-24 01:15:19,459 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2015 transitions. Word has length 87 [2024-11-24 01:15:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:19,460 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2015 transitions. [2024-11-24 01:15:19,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2015 transitions. [2024-11-24 01:15:19,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-24 01:15:19,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:19,461 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] [2024-11-24 01:15:19,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 01:15:19,461 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:19,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:19,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1463572569, now seen corresponding path program 1 times [2024-11-24 01:15:19,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:19,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566092171] [2024-11-24 01:15:19,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:20,192 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-24 01:15:20,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:20,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566092171] [2024-11-24 01:15:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566092171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:15:20,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407275859] [2024-11-24 01:15:20,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:20,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:15:20,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:15:20,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:15:20,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:15:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:20,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-24 01:15:20,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:15:20,560 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-24 01:15:20,800 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:15:20,801 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-24 01:15:20,826 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-24 01:15:20,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:15:20,937 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-24 01:15:20,987 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-24 01:15:20,993 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-24 01:15:20,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:15:21,067 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-24 01:15:21,067 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-24 01:15:21,078 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-24 01:15:21,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407275859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:15:21,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:15:21,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-24 01:15:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914133759] [2024-11-24 01:15:21,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:15:21,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:15:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:21,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:15:21,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-24 01:15:21,083 INFO L87 Difference]: Start difference. First operand 1566 states and 2015 transitions. Second operand has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 states have internal predecessors, (125), 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-24 01:15:24,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:24,626 INFO L93 Difference]: Finished difference Result 1565 states and 2013 transitions. [2024-11-24 01:15:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:15:24,627 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 states have internal predecessors, (125), 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 88 [2024-11-24 01:15:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:24,631 INFO L225 Difference]: With dead ends: 1565 [2024-11-24 01:15:24,631 INFO L226 Difference]: Without dead ends: 1565 [2024-11-24 01:15:24,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 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-24 01:15:24,632 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1150 mSDsluCounter, 5117 mSDsCounter, 0 mSdLazyCounter, 4011 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 5867 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:24,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 5867 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4011 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-24 01:15:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-11-24 01:15:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2024-11-24 01:15:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1180 states have (on average 1.6830508474576271) internal successors, (1986), 1552 states have internal predecessors, (1986), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-24 01:15:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2013 transitions. [2024-11-24 01:15:24,668 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2013 transitions. Word has length 88 [2024-11-24 01:15:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:24,668 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2013 transitions. [2024-11-24 01:15:24,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 states have internal predecessors, (125), 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-24 01:15:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2013 transitions. [2024-11-24 01:15:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-24 01:15:24,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:24,670 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] [2024-11-24 01:15:24,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-24 01:15:24,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-24 01:15:24,870 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:24,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1463572568, now seen corresponding path program 1 times [2024-11-24 01:15:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484775216] [2024-11-24 01:15:24,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:25,952 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-24 01:15:25,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:25,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484775216] [2024-11-24 01:15:25,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484775216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:15:25,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339113064] [2024-11-24 01:15:25,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:25,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:15:25,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:15:25,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:15:25,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:15:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:26,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-24 01:15:26,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:15:26,279 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-24 01:15:26,461 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:15:26,462 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-24 01:15:26,506 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-24 01:15:26,512 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-24 01:15:26,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:15:26,812 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-24 01:15:26,823 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-24 01:15:26,896 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-24 01:15:26,903 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-24 01:15:26,938 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-24 01:15:26,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:15:27,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:15:27,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-24 01:15:27,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339113064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:15:27,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:15:27,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-24 01:15:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464497777] [2024-11-24 01:15:27,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:15:27,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:15:27,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:27,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:15:27,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=393, Unknown=6, NotChecked=0, Total=462 [2024-11-24 01:15:27,292 INFO L87 Difference]: Start difference. First operand 1565 states and 2013 transitions. Second operand has 19 states, 16 states have (on average 8.5625) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 1 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-24 01:15:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:33,796 INFO L93 Difference]: Finished difference Result 1564 states and 2011 transitions. [2024-11-24 01:15:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 01:15:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.5625) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2024-11-24 01:15:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:33,801 INFO L225 Difference]: With dead ends: 1564 [2024-11-24 01:15:33,802 INFO L226 Difference]: Without dead ends: 1564 [2024-11-24 01:15:33,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=544, Unknown=6, NotChecked=0, Total=650 [2024-11-24 01:15:33,803 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1146 mSDsluCounter, 8943 mSDsCounter, 0 mSdLazyCounter, 8771 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 9692 SdHoareTripleChecker+Invalid, 8796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 8771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:33,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 9692 Invalid, 8796 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 8771 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-24 01:15:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-24 01:15:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1555. [2024-11-24 01:15:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1172 states have (on average 1.6851535836177474) internal successors, (1975), 1544 states have internal predecessors, (1975), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1993 transitions. [2024-11-24 01:15:33,832 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1993 transitions. Word has length 88 [2024-11-24 01:15:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:33,832 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 1993 transitions. [2024-11-24 01:15:33,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.5625) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 1 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-24 01:15:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1993 transitions. [2024-11-24 01:15:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-24 01:15:33,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:33,834 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-24 01:15:33,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-24 01:15:34,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-24 01:15:34,039 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:34,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1105810242, now seen corresponding path program 1 times [2024-11-24 01:15:34,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:34,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574609192] [2024-11-24 01:15:34,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:34,781 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-24 01:15:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574609192] [2024-11-24 01:15:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574609192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:34,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 01:15:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117742414] [2024-11-24 01:15:34,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:34,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:15:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:34,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:15:34,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:15:34,784 INFO L87 Difference]: Start difference. First operand 1555 states and 1993 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:37,827 INFO L93 Difference]: Finished difference Result 1571 states and 2019 transitions. [2024-11-24 01:15:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:15:37,828 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-24 01:15:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:37,832 INFO L225 Difference]: With dead ends: 1571 [2024-11-24 01:15:37,832 INFO L226 Difference]: Without dead ends: 1571 [2024-11-24 01:15:37,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-24 01:15:37,833 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1175 mSDsluCounter, 5812 mSDsCounter, 0 mSdLazyCounter, 4500 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 6561 SdHoareTripleChecker+Invalid, 4520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:37,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 6561 Invalid, 4520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4500 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-24 01:15:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2024-11-24 01:15:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1570. [2024-11-24 01:15:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1186 states have (on average 1.6795952782462058) internal successors, (1992), 1557 states have internal predecessors, (1992), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-24 01:15:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2019 transitions. [2024-11-24 01:15:37,860 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2019 transitions. Word has length 90 [2024-11-24 01:15:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:37,860 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2019 transitions. [2024-11-24 01:15:37,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2019 transitions. [2024-11-24 01:15:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-24 01:15:37,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:37,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, 1, 1, 1] [2024-11-24 01:15:37,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 01:15:37,862 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:37,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:37,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1105810243, now seen corresponding path program 1 times [2024-11-24 01:15:37,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:37,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873295700] [2024-11-24 01:15:37,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:37,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:38,832 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-24 01:15:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873295700] [2024-11-24 01:15:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873295700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:38,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:15:38,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631617911] [2024-11-24 01:15:38,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:38,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 01:15:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:38,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 01:15:38,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-24 01:15:38,835 INFO L87 Difference]: Start difference. First operand 1570 states and 2019 transitions. Second operand has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:41,944 INFO L93 Difference]: Finished difference Result 1570 states and 2017 transitions. [2024-11-24 01:15:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:15:41,945 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-24 01:15:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:41,949 INFO L225 Difference]: With dead ends: 1570 [2024-11-24 01:15:41,949 INFO L226 Difference]: Without dead ends: 1570 [2024-11-24 01:15:41,949 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-24 01:15:41,950 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1154 mSDsluCounter, 3827 mSDsCounter, 0 mSdLazyCounter, 4035 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4583 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:41,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 4583 Invalid, 4054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4035 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-24 01:15:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-11-24 01:15:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-11-24 01:15:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1186 states have (on average 1.6779089376053964) internal successors, (1990), 1557 states have internal predecessors, (1990), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-24 01:15:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2017 transitions. [2024-11-24 01:15:41,977 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2017 transitions. Word has length 90 [2024-11-24 01:15:41,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:41,977 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2017 transitions. [2024-11-24 01:15:41,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2017 transitions. [2024-11-24 01:15:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-24 01:15:41,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:41,979 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] [2024-11-24 01:15:41,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 01:15:41,979 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:41,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1218202601, now seen corresponding path program 1 times [2024-11-24 01:15:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:41,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78591163] [2024-11-24 01:15:41,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:42,751 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-24 01:15:42,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:42,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78591163] [2024-11-24 01:15:42,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78591163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:15:42,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468383488] [2024-11-24 01:15:42,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:15:42,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:15:42,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:15:42,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:15:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:43,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-24 01:15:43,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:15:43,052 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-24 01:15:43,211 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:15:43,211 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-24 01:15:43,222 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-24 01:15:43,318 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:15:43,318 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-24 01:15:43,396 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:15:43,397 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-24 01:15:43,416 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-24 01:15:43,423 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-24 01:15:43,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:15:43,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-24 01:15:43,452 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (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_879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-24 01:15:43,508 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-24 01:15:43,509 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-24 01:15:43,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468383488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:15:43,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:15:43,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-24 01:15:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328192934] [2024-11-24 01:15:43,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:15:43,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 01:15:43,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:43,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 01:15:43,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=8, NotChecked=62, Total=342 [2024-11-24 01:15:43,565 INFO L87 Difference]: Start difference. First operand 1570 states and 2017 transitions. Second operand has 16 states, 14 states have (on average 9.285714285714286) internal successors, (130), 15 states have internal predecessors, (130), 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-24 01:15:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:47,044 INFO L93 Difference]: Finished difference Result 1569 states and 2015 transitions. [2024-11-24 01:15:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:15:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.285714285714286) internal successors, (130), 15 states have internal predecessors, (130), 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 91 [2024-11-24 01:15:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:47,047 INFO L225 Difference]: With dead ends: 1569 [2024-11-24 01:15:47,047 INFO L226 Difference]: Without dead ends: 1569 [2024-11-24 01:15:47,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=8, NotChecked=90, Total=650 [2024-11-24 01:15:47,048 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1144 mSDsluCounter, 6540 mSDsCounter, 0 mSdLazyCounter, 4997 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 7289 SdHoareTripleChecker+Invalid, 5017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:47,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 7289 Invalid, 5017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4997 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-24 01:15:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-24 01:15:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2024-11-24 01:15:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1186 states have (on average 1.6762225969645868) internal successors, (1988), 1556 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-24 01:15:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2015 transitions. [2024-11-24 01:15:47,071 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2015 transitions. Word has length 91 [2024-11-24 01:15:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:47,072 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2015 transitions. [2024-11-24 01:15:47,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.285714285714286) internal successors, (130), 15 states have internal predecessors, (130), 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-24 01:15:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2015 transitions. [2024-11-24 01:15:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-24 01:15:47,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:47,073 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] [2024-11-24 01:15:47,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 01:15:47,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:15:47,278 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:47,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1218202602, now seen corresponding path program 1 times [2024-11-24 01:15:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919415824] [2024-11-24 01:15:47,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:48,320 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-24 01:15:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919415824] [2024-11-24 01:15:48,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919415824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:15:48,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929389734] [2024-11-24 01:15:48,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:48,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:15:48,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:15:48,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:15:48,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 01:15:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:48,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-24 01:15:48,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:15:48,641 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-24 01:15:48,803 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:15:48,804 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-24 01:15:48,810 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-24 01:15:48,845 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-24 01:15:48,849 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-24 01:15:48,990 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-24 01:15:48,996 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-24 01:15:49,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:15:49,162 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-24 01:15:49,168 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-24 01:15:49,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:15:49,291 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-24 01:15:49,297 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-24 01:15:49,326 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-24 01:15:49,332 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-24 01:15:49,364 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-24 01:15:49,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:15:49,552 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_1019 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-24 01:15:49,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (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 ((.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~mem50#1.base| v_ArrVal_1025) .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) (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|) .cse1) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-24 01:15:49,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929389734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:15:49,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:15:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-24 01:15:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853420533] [2024-11-24 01:15:49,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:15:49,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-24 01:15:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:49,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-24 01:15:49,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=426, Unknown=12, NotChecked=86, Total=600 [2024-11-24 01:15:49,652 INFO L87 Difference]: Start difference. First operand 1569 states and 2015 transitions. Second operand has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 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-24 01:15:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:55,324 INFO L93 Difference]: Finished difference Result 1576 states and 2021 transitions. [2024-11-24 01:15:55,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:15:55,326 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 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 91 [2024-11-24 01:15:55,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:55,329 INFO L225 Difference]: With dead ends: 1576 [2024-11-24 01:15:55,329 INFO L226 Difference]: Without dead ends: 1576 [2024-11-24 01:15:55,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=631, Unknown=13, NotChecked=106, Total=870 [2024-11-24 01:15:55,330 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1146 mSDsluCounter, 6087 mSDsCounter, 0 mSdLazyCounter, 6727 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 6749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:55,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 6841 Invalid, 6749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 6727 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-24 01:15:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-24 01:15:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1558. [2024-11-24 01:15:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1176 states have (on average 1.6802721088435375) internal successors, (1976), 1546 states have internal predecessors, (1976), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:15:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1994 transitions. [2024-11-24 01:15:55,348 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1994 transitions. Word has length 91 [2024-11-24 01:15:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:55,348 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 1994 transitions. [2024-11-24 01:15:55,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 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-24 01:15:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1994 transitions. [2024-11-24 01:15:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-24 01:15:55,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:55,349 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-24 01:15:55,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-24 01:15:55,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-24 01:15:55,550 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:55,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash 794382741, now seen corresponding path program 1 times [2024-11-24 01:15:55,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:55,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804602696] [2024-11-24 01:15:55,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:55,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:56,319 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-24 01:15:56,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:56,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804602696] [2024-11-24 01:15:56,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804602696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:56,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:56,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 01:15:56,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863469234] [2024-11-24 01:15:56,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:56,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 01:15:56,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:56,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 01:15:56,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-24 01:15:56,322 INFO L87 Difference]: Start difference. First operand 1558 states and 1994 transitions. Second operand has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:59,286 INFO L93 Difference]: Finished difference Result 1583 states and 2029 transitions. [2024-11-24 01:15:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:15:59,289 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-24 01:15:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:59,292 INFO L225 Difference]: With dead ends: 1583 [2024-11-24 01:15:59,292 INFO L226 Difference]: Without dead ends: 1583 [2024-11-24 01:15:59,293 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-24 01:15:59,294 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 1162 mSDsluCounter, 5083 mSDsCounter, 0 mSdLazyCounter, 4034 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 5831 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:59,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 5831 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4034 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-24 01:15:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-11-24 01:15:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1579. [2024-11-24 01:15:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1196 states have (on average 1.6714046822742474) internal successors, (1999), 1565 states have internal predecessors, (1999), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:15:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2019 transitions. [2024-11-24 01:15:59,319 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2019 transitions. Word has length 93 [2024-11-24 01:15:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:59,319 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2019 transitions. [2024-11-24 01:15:59,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2019 transitions. [2024-11-24 01:15:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-24 01:15:59,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:59,321 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-24 01:15:59,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-24 01:15:59,321 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:15:59,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 794382742, now seen corresponding path program 1 times [2024-11-24 01:15:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:59,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542667111] [2024-11-24 01:15:59,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:00,387 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-24 01:16:00,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542667111] [2024-11-24 01:16:00,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542667111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:16:00,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:16:00,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 01:16:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643025822] [2024-11-24 01:16:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:16:00,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:16:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:00,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:16:00,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:16:00,390 INFO L87 Difference]: Start difference. First operand 1579 states and 2019 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:03,494 INFO L93 Difference]: Finished difference Result 1582 states and 2027 transitions. [2024-11-24 01:16:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:16:03,495 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-24 01:16:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:03,499 INFO L225 Difference]: With dead ends: 1582 [2024-11-24 01:16:03,499 INFO L226 Difference]: Without dead ends: 1582 [2024-11-24 01:16:03,499 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-24 01:16:03,500 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1172 mSDsluCounter, 3678 mSDsCounter, 0 mSdLazyCounter, 4212 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 4231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:03,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 4433 Invalid, 4231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4212 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-24 01:16:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2024-11-24 01:16:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1579. [2024-11-24 01:16:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1196 states have (on average 1.669732441471572) internal successors, (1997), 1565 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:16:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2017 transitions. [2024-11-24 01:16:03,523 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2017 transitions. Word has length 93 [2024-11-24 01:16:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:03,523 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2017 transitions. [2024-11-24 01:16:03,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2017 transitions. [2024-11-24 01:16:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 01:16:03,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:03,525 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] [2024-11-24 01:16:03,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-24 01:16:03,525 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:16:03,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash -999341170, now seen corresponding path program 1 times [2024-11-24 01:16:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951982312] [2024-11-24 01:16:03,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:04,322 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-24 01:16:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:04,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951982312] [2024-11-24 01:16:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951982312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:04,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305075599] [2024-11-24 01:16:04,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:04,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:16:04,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:16:04,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:16:04,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 01:16:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:04,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-24 01:16:04,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:16:04,661 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-24 01:16:04,803 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:16:04,804 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-24 01:16:04,812 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-24 01:16:04,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:04,933 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-24 01:16:04,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:04,998 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-24 01:16:05,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:05,065 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-24 01:16:05,091 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-24 01:16:05,096 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-24 01:16:05,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:16:05,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-24 01:16:05,132 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (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_1300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-24 01:16:05,326 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-24 01:16:05,327 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-24 01:16:05,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305075599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:05,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:16:05,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2024-11-24 01:16:05,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449958212] [2024-11-24 01:16:05,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:16:05,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:16:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:05,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:16:05,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=376, Unknown=24, NotChecked=82, Total=552 [2024-11-24 01:16:05,408 INFO L87 Difference]: Start difference. First operand 1579 states and 2017 transitions. Second operand has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 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-24 01:16:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:09,842 INFO L93 Difference]: Finished difference Result 1581 states and 2025 transitions. [2024-11-24 01:16:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:16:09,843 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 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 94 [2024-11-24 01:16:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:09,847 INFO L225 Difference]: With dead ends: 1581 [2024-11-24 01:16:09,847 INFO L226 Difference]: Without dead ends: 1581 [2024-11-24 01:16:09,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=716, Unknown=24, NotChecked=114, Total=992 [2024-11-24 01:16:09,848 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 1142 mSDsluCounter, 9444 mSDsCounter, 0 mSdLazyCounter, 7004 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 10192 SdHoareTripleChecker+Invalid, 7024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:09,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 10192 Invalid, 7024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 7004 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-24 01:16:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-24 01:16:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1578. [2024-11-24 01:16:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1196 states have (on average 1.6680602006688963) internal successors, (1995), 1564 states have internal predecessors, (1995), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:16:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2015 transitions. [2024-11-24 01:16:09,869 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2015 transitions. Word has length 94 [2024-11-24 01:16:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:09,870 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2015 transitions. [2024-11-24 01:16:09,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 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-24 01:16:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2015 transitions. [2024-11-24 01:16:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 01:16:09,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:09,871 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] [2024-11-24 01:16:09,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 01:16:10,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-24 01:16:10,077 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:16:10,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash -999341169, now seen corresponding path program 1 times [2024-11-24 01:16:10,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:10,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630417708] [2024-11-24 01:16:10,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:10,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:11,183 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-24 01:16:11,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:11,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630417708] [2024-11-24 01:16:11,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630417708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:11,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198050307] [2024-11-24 01:16:11,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:11,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:16:11,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:16:11,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:16:11,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 01:16:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:11,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-24 01:16:11,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:16:11,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:16:11,681 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-24 01:16:11,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:16:11,696 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-24 01:16:11,708 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-24 01:16:11,715 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-24 01:16:11,790 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-24 01:16:11,795 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-24 01:16:11,951 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:11,951 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-24 01:16:11,960 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-24 01:16:12,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:12,059 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-24 01:16:12,070 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-24 01:16:12,159 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:12,159 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-24 01:16:12,168 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-24 01:16:12,196 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-24 01:16:12,202 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-24 01:16:12,204 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-24 01:16:12,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:16:12,372 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_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-24 01:16:12,403 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452))) (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~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-24 01:16:12,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |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|) .cse2))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-24 01:16:12,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse0 v_ArrVal_1453) (select (select (store .cse1 .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1452))) (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~mem50#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1453) .cse4 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-24 01:16:12,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198050307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:12,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:16:12,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-24 01:16:12,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111783397] [2024-11-24 01:16:12,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:16:12,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 01:16:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:12,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 01:16:12,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=348, Unknown=12, NotChecked=164, Total=600 [2024-11-24 01:16:12,521 INFO L87 Difference]: Start difference. First operand 1578 states and 2015 transitions. Second operand has 18 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 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-24 01:16:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:19,616 INFO L93 Difference]: Finished difference Result 1580 states and 2023 transitions. [2024-11-24 01:16:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:16:19,616 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 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 94 [2024-11-24 01:16:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:19,620 INFO L225 Difference]: With dead ends: 1580 [2024-11-24 01:16:19,620 INFO L226 Difference]: Without dead ends: 1580 [2024-11-24 01:16:19,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=584, Unknown=12, NotChecked=212, Total=930 [2024-11-24 01:16:19,621 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1142 mSDsluCounter, 7706 mSDsCounter, 0 mSdLazyCounter, 8733 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 8459 SdHoareTripleChecker+Invalid, 8754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 8733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:19,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 8459 Invalid, 8754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 8733 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-24 01:16:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-24 01:16:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1556. [2024-11-24 01:16:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1176 states have (on average 1.6768707482993197) internal successors, (1972), 1544 states have internal predecessors, (1972), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:16:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1990 transitions. [2024-11-24 01:16:19,662 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1990 transitions. Word has length 94 [2024-11-24 01:16:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:19,662 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1990 transitions. [2024-11-24 01:16:19,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 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-24 01:16:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1990 transitions. [2024-11-24 01:16:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-24 01:16:19,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:19,665 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-24 01:16:19,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-24 01:16:19,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-24 01:16:19,866 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:16:19,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash 187066761, now seen corresponding path program 1 times [2024-11-24 01:16:19,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:19,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705988710] [2024-11-24 01:16:19,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:20,704 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-24 01:16:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705988710] [2024-11-24 01:16:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705988710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:16:20,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:16:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-24 01:16:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906967659] [2024-11-24 01:16:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:16:20,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 01:16:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:20,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 01:16:20,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:16:20,706 INFO L87 Difference]: Start difference. First operand 1556 states and 1990 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:23,558 INFO L93 Difference]: Finished difference Result 1587 states and 2031 transitions. [2024-11-24 01:16:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:16:23,558 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-24 01:16:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:23,563 INFO L225 Difference]: With dead ends: 1587 [2024-11-24 01:16:23,563 INFO L226 Difference]: Without dead ends: 1587 [2024-11-24 01:16:23,563 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-24 01:16:23,564 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1175 mSDsluCounter, 5110 mSDsCounter, 0 mSdLazyCounter, 4043 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 5857 SdHoareTripleChecker+Invalid, 4063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:23,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 5857 Invalid, 4063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4043 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-24 01:16:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-11-24 01:16:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1583. [2024-11-24 01:16:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1202 states have (on average 1.6647254575707155) internal successors, (2001), 1569 states have internal predecessors, (2001), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:16:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2021 transitions. [2024-11-24 01:16:23,605 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2021 transitions. Word has length 96 [2024-11-24 01:16:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:23,605 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2021 transitions. [2024-11-24 01:16:23,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2021 transitions. [2024-11-24 01:16:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-24 01:16:23,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:23,608 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-24 01:16:23,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-24 01:16:23,608 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:16:23,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash 187066762, now seen corresponding path program 1 times [2024-11-24 01:16:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502130464] [2024-11-24 01:16:23,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:24,588 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-24 01:16:24,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:24,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502130464] [2024-11-24 01:16:24,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502130464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:16:24,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:16:24,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 01:16:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036406549] [2024-11-24 01:16:24,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:16:24,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 01:16:24,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:24,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 01:16:24,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:16:24,590 INFO L87 Difference]: Start difference. First operand 1583 states and 2021 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:27,470 INFO L93 Difference]: Finished difference Result 1586 states and 2029 transitions. [2024-11-24 01:16:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 01:16:27,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-24 01:16:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:27,473 INFO L225 Difference]: With dead ends: 1586 [2024-11-24 01:16:27,473 INFO L226 Difference]: Without dead ends: 1586 [2024-11-24 01:16:27,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:16:27,474 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1156 mSDsluCounter, 3833 mSDsCounter, 0 mSdLazyCounter, 4041 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 4587 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:27,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 4587 Invalid, 4060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4041 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-24 01:16:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-24 01:16:27,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1583. [2024-11-24 01:16:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1202 states have (on average 1.6630615640599002) internal successors, (1999), 1569 states have internal predecessors, (1999), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:16:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2019 transitions. [2024-11-24 01:16:27,490 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2019 transitions. Word has length 96 [2024-11-24 01:16:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:27,491 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2019 transitions. [2024-11-24 01:16:27,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2019 transitions. [2024-11-24 01:16:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-24 01:16:27,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:27,492 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] [2024-11-24 01:16:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-24 01:16:27,492 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:16:27,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1341130992, now seen corresponding path program 1 times [2024-11-24 01:16:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229996381] [2024-11-24 01:16:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:28,312 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-24 01:16:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:28,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229996381] [2024-11-24 01:16:28,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229996381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:28,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545642075] [2024-11-24 01:16:28,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:28,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:16:28,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:16:28,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:16:28,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 01:16:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:28,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-24 01:16:28,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:16:28,639 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-24 01:16:28,775 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:16:28,775 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-24 01:16:28,787 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-24 01:16:28,899 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:28,899 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-24 01:16:28,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:28,956 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-24 01:16:29,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:29,008 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-24 01:16:29,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:29,067 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-24 01:16:29,086 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-24 01:16:29,090 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-24 01:16:29,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:16:29,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-24 01:16:29,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (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_1760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-24 01:16:29,129 WARN L851 $PredicateComparison]: unable to prove that (forall ((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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:16:29,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (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_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:16:29,306 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-24 01:16:29,307 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-24 01:16:29,317 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1763))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-24 01:16:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545642075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:29,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:16:29,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2024-11-24 01:16:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539290534] [2024-11-24 01:16:29,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:16:29,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-24 01:16:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:29,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-24 01:16:29,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=461, Unknown=21, NotChecked=240, Total=812 [2024-11-24 01:16:29,323 INFO L87 Difference]: Start difference. First operand 1583 states and 2019 transitions. Second operand has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 1 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-24 01:16:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:32,987 INFO L93 Difference]: Finished difference Result 1585 states and 2027 transitions. [2024-11-24 01:16:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:16:32,988 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-24 01:16:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:32,991 INFO L225 Difference]: With dead ends: 1585 [2024-11-24 01:16:32,991 INFO L226 Difference]: Without dead ends: 1585 [2024-11-24 01:16:32,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=886, Unknown=21, NotChecked=330, Total=1406 [2024-11-24 01:16:32,992 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1140 mSDsluCounter, 6560 mSDsCounter, 0 mSdLazyCounter, 5020 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 7307 SdHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:32,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 7307 Invalid, 5046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5020 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-24 01:16:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-24 01:16:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1582. [2024-11-24 01:16:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1202 states have (on average 1.661397670549085) internal successors, (1997), 1568 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:16:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2017 transitions. [2024-11-24 01:16:33,022 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2017 transitions. Word has length 97 [2024-11-24 01:16:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:33,022 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2017 transitions. [2024-11-24 01:16:33,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 1 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-24 01:16:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2017 transitions. [2024-11-24 01:16:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-24 01:16:33,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:33,024 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] [2024-11-24 01:16:33,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-24 01:16:33,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-24 01:16:33,225 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:16:33,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:33,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1341130993, now seen corresponding path program 1 times [2024-11-24 01:16:33,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:33,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479005541] [2024-11-24 01:16:33,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:34,376 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-24 01:16:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:34,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479005541] [2024-11-24 01:16:34,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479005541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:34,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100889984] [2024-11-24 01:16:34,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:34,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:16:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:16:34,380 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:16:34,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-24 01:16:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:34,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-24 01:16:34,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:16:34,781 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-24 01:16:34,932 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-24 01:16:34,942 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:16:34,942 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-24 01:16:34,955 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-24 01:16:34,962 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-24 01:16:35,044 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-24 01:16:35,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:16:35,192 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:35,192 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-24 01:16:35,200 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-24 01:16:35,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:35,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 62 treesize of output 57 [2024-11-24 01:16:35,309 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-24 01:16:35,377 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:35,378 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-24 01:16:35,382 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-24 01:16:35,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:35,461 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-24 01:16:35,466 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-24 01:16:35,488 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-24 01:16:35,495 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-24 01:16:35,498 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-24 01:16:35,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:16:35,573 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_1929 (Array Int Int)) (v_ArrVal_1928 (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_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-24 01:16:35,586 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_1929 (Array Int Int)) (v_ArrVal_1928 (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_1928) |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-24 01:16:35,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |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))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926))) (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_1927) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926) |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-24 01:16:35,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |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|) .cse2))) (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))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-24 01:16:35,678 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_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (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_1924) .cse0 v_ArrVal_1927) (select (select (store .cse1 .cse0 v_ArrVal_1926) |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_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)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1926))) (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_1924) .cse3 v_ArrVal_1927) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-24 01:16:35,704 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_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (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_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (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)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1926))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse4 v_ArrVal_1927) .cse5 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-24 01:16:35,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (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~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (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)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1926))) (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~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1924) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-24 01:16:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100889984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:35,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:16:35,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-24 01:16:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213849650] [2024-11-24 01:16:35,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:16:35,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-24 01:16:35,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:35,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-24 01:16:35,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=394, Unknown=7, NotChecked=322, Total=812 [2024-11-24 01:16:35,873 INFO L87 Difference]: Start difference. First operand 1582 states and 2017 transitions. Second operand has 20 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 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-24 01:16:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:44,155 INFO L93 Difference]: Finished difference Result 1584 states and 2025 transitions. [2024-11-24 01:16:44,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:16:44,156 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 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 97 [2024-11-24 01:16:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:44,158 INFO L225 Difference]: With dead ends: 1584 [2024-11-24 01:16:44,158 INFO L226 Difference]: Without dead ends: 1584 [2024-11-24 01:16:44,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=690, Unknown=7, NotChecked=420, Total=1260 [2024-11-24 01:16:44,160 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1141 mSDsluCounter, 8407 mSDsCounter, 0 mSdLazyCounter, 9234 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 9159 SdHoareTripleChecker+Invalid, 9256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:44,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 9159 Invalid, 9256 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 9234 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-24 01:16:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-24 01:16:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1554. [2024-11-24 01:16:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1176 states have (on average 1.6734693877551021) internal successors, (1968), 1542 states have internal predecessors, (1968), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:16:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1986 transitions. [2024-11-24 01:16:44,180 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1986 transitions. Word has length 97 [2024-11-24 01:16:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:44,181 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 1986 transitions. [2024-11-24 01:16:44,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 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-24 01:16:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1986 transitions. [2024-11-24 01:16:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-24 01:16:44,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:44,182 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-24 01:16:44,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-24 01:16:44,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-24 01:16:44,386 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:16:44,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash -662564405, now seen corresponding path program 1 times [2024-11-24 01:16:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:44,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694221794] [2024-11-24 01:16:44,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:44,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:45,378 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-24 01:16:45,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:45,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694221794] [2024-11-24 01:16:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694221794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:16:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:16:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 01:16:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392416554] [2024-11-24 01:16:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:16:45,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:16:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:45,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:16:45,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:16:45,380 INFO L87 Difference]: Start difference. First operand 1554 states and 1986 transitions. Second operand has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:48,753 INFO L93 Difference]: Finished difference Result 1593 states and 2035 transitions. [2024-11-24 01:16:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 01:16:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-24 01:16:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:48,759 INFO L225 Difference]: With dead ends: 1593 [2024-11-24 01:16:48,759 INFO L226 Difference]: Without dead ends: 1593 [2024-11-24 01:16:48,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-24 01:16:48,760 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1160 mSDsluCounter, 5067 mSDsCounter, 0 mSdLazyCounter, 4040 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 5819 SdHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:48,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 5819 Invalid, 4062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4040 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-24 01:16:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2024-11-24 01:16:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1589. [2024-11-24 01:16:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1210 states have (on average 1.6570247933884297) internal successors, (2005), 1575 states have internal predecessors, (2005), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:16:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2025 transitions. [2024-11-24 01:16:48,786 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2025 transitions. Word has length 100 [2024-11-24 01:16:48,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:48,786 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2025 transitions. [2024-11-24 01:16:48,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2025 transitions. [2024-11-24 01:16:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-24 01:16:48,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:48,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, 1] [2024-11-24 01:16:48,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-24 01:16:48,788 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:16:48,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash -662564404, now seen corresponding path program 1 times [2024-11-24 01:16:48,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:48,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722953147] [2024-11-24 01:16:48,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:48,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:50,644 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-24 01:16:50,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:50,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722953147] [2024-11-24 01:16:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722953147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:16:50,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:16:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-24 01:16:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935831459] [2024-11-24 01:16:50,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:16:50,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 01:16:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:50,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 01:16:50,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-24 01:16:50,646 INFO L87 Difference]: Start difference. First operand 1589 states and 2025 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:58,462 INFO L93 Difference]: Finished difference Result 1592 states and 2033 transitions. [2024-11-24 01:16:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:16:58,463 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-24 01:16:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:58,464 INFO L225 Difference]: With dead ends: 1592 [2024-11-24 01:16:58,464 INFO L226 Difference]: Without dead ends: 1592 [2024-11-24 01:16:58,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-24 01:16:58,465 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1156 mSDsluCounter, 6382 mSDsCounter, 0 mSdLazyCounter, 7637 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 7129 SdHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:58,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 7129 Invalid, 7660 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 7637 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-24 01:16:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-24 01:16:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1589. [2024-11-24 01:16:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1210 states have (on average 1.6553719008264463) internal successors, (2003), 1575 states have internal predecessors, (2003), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:16:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2023 transitions. [2024-11-24 01:16:58,487 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2023 transitions. Word has length 100 [2024-11-24 01:16:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:58,488 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2023 transitions. [2024-11-24 01:16:58,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:16:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2023 transitions. [2024-11-24 01:16:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-24 01:16:58,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:58,489 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] [2024-11-24 01:16:58,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-24 01:16:58,490 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:16:58,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1460643250, now seen corresponding path program 1 times [2024-11-24 01:16:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:58,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031146791] [2024-11-24 01:16:58,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:58,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:59,642 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-24 01:16:59,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:59,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031146791] [2024-11-24 01:16:59,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031146791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:59,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425178574] [2024-11-24 01:16:59,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:59,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:16:59,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:16:59,645 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:16:59,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-24 01:17:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:00,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-24 01:17:00,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:17:00,074 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-24 01:17:00,213 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:17:00,213 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-24 01:17:00,220 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-24 01:17:00,348 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:00,348 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-24 01:17:00,410 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:00,410 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-24 01:17:00,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:00,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:17:00,541 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:00,542 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-24 01:17:00,613 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:00,613 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-24 01:17:00,629 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-24 01:17:00,663 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 01:17:00,663 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-24 01:17:00,667 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-24 01:17:00,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:17:01,722 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-24 01:17:01,722 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-24 01:17:01,755 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2271))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2264)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2265)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2266)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2267)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-24 01:17:01,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425178574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:17:01,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:17:01,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2024-11-24 01:17:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449280543] [2024-11-24 01:17:01,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:17:01,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-24 01:17:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:17:01,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-24 01:17:01,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=934, Unknown=44, NotChecked=64, Total=1190 [2024-11-24 01:17:01,759 INFO L87 Difference]: Start difference. First operand 1589 states and 2023 transitions. Second operand has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 1 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-24 01:17:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:17:06,010 INFO L93 Difference]: Finished difference Result 1591 states and 2031 transitions. [2024-11-24 01:17:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-24 01:17:06,012 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 1 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 101 [2024-11-24 01:17:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:17:06,013 INFO L225 Difference]: With dead ends: 1591 [2024-11-24 01:17:06,014 INFO L226 Difference]: Without dead ends: 1591 [2024-11-24 01:17:06,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=270, Invalid=1582, Unknown=44, NotChecked=84, Total=1980 [2024-11-24 01:17:06,015 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1143 mSDsluCounter, 8016 mSDsCounter, 0 mSdLazyCounter, 6016 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 8762 SdHoareTripleChecker+Invalid, 6039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:17:06,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 8762 Invalid, 6039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6016 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-24 01:17:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2024-11-24 01:17:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1588. [2024-11-24 01:17:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1210 states have (on average 1.6537190082644628) internal successors, (2001), 1574 states have internal predecessors, (2001), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:17:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2021 transitions. [2024-11-24 01:17:06,037 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2021 transitions. Word has length 101 [2024-11-24 01:17:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:17:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 2021 transitions. [2024-11-24 01:17:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 1 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-24 01:17:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2021 transitions. [2024-11-24 01:17:06,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-24 01:17:06,039 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:17:06,039 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] [2024-11-24 01:17:06,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-24 01:17:06,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-24 01:17:06,244 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:17:06,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:17:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1460643251, now seen corresponding path program 1 times [2024-11-24 01:17:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:17:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661004561] [2024-11-24 01:17:06,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:17:06,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:17:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:07,920 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-24 01:17:07,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:17:07,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661004561] [2024-11-24 01:17:07,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661004561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:17:07,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592355077] [2024-11-24 01:17:07,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:17:07,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:17:07,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:17:07,923 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:17:07,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-24 01:17:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:08,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-24 01:17:08,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:17:08,347 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-24 01:17:08,527 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:17:08,528 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-24 01:17:08,538 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-24 01:17:08,577 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-24 01:17:08,581 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-24 01:17:08,701 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-24 01:17:08,705 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-24 01:17:08,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:08,894 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-24 01:17:08,902 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-24 01:17:09,060 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:09,060 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-24 01:17:09,068 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-24 01:17:09,221 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:09,221 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-24 01:17:09,233 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-24 01:17:09,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:09,378 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-24 01:17:09,386 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-24 01:17:09,512 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:09,512 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-24 01:17:09,519 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-24 01:17:09,557 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-24 01:17:09,568 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-24 01:17:09,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:17:09,661 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-24 01:17:09,661 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-24 01:17:09,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:17:09,678 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-24 01:17:09,720 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-24 01:17:09,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:17:12,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4))) (and (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (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 ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2449))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2450))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2448) .cse1 v_ArrVal_2451) .cse2 v_ArrVal_2453) (select (select (store .cse3 .cse2 v_ArrVal_2452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2455))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 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_2448 (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_2456 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2449))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2450))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2452))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2448) .cse6 v_ArrVal_2451) .cse7 v_ArrVal_2453) .cse8 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2456) (select (select (store .cse9 .cse8 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-24 01:17:12,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:17:12,597 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-24 01:17:12,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_23))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_17))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_26))) (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_prenex_25) .cse0 v_prenex_18) .cse1 v_prenex_24) .cse2 v_prenex_21) (select (select (store .cse3 .cse2 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_19))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (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_2456 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2462))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2449))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2450))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2452))) (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_ArrVal_2461) .cse7 v_ArrVal_2448) .cse8 v_ArrVal_2451) .cse9 v_ArrVal_2453) .cse10 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2456) (select (select (store .cse11 .cse10 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|))))) is different from false [2024-11-24 01:17:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592355077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:17:12,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:17:12,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-24 01:17:12,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084440191] [2024-11-24 01:17:12,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:17:12,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-24 01:17:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:17:12,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-24 01:17:12,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1498, Unknown=44, NotChecked=162, Total=1892 [2024-11-24 01:17:12,996 INFO L87 Difference]: Start difference. First operand 1588 states and 2021 transitions. Second operand has 32 states, 29 states have (on average 5.620689655172414) internal successors, (163), 30 states have internal predecessors, (163), 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-24 01:17:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:17:27,076 INFO L93 Difference]: Finished difference Result 1590 states and 2029 transitions. [2024-11-24 01:17:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-24 01:17:27,076 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.620689655172414) internal successors, (163), 30 states have internal predecessors, (163), 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 101 [2024-11-24 01:17:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:17:27,078 INFO L225 Difference]: With dead ends: 1590 [2024-11-24 01:17:27,078 INFO L226 Difference]: Without dead ends: 1590 [2024-11-24 01:17:27,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=324, Invalid=2292, Unknown=44, NotChecked=202, Total=2862 [2024-11-24 01:17:27,080 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1147 mSDsluCounter, 8746 mSDsCounter, 0 mSdLazyCounter, 10137 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 9491 SdHoareTripleChecker+Invalid, 10166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 10137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:17:27,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 9491 Invalid, 10166 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 10137 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2024-11-24 01:17:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-24 01:17:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1552. [2024-11-24 01:17:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1176 states have (on average 1.6700680272108843) internal successors, (1964), 1540 states have internal predecessors, (1964), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:17:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1982 transitions. [2024-11-24 01:17:27,105 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1982 transitions. Word has length 101 [2024-11-24 01:17:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:17:27,105 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 1982 transitions. [2024-11-24 01:17:27,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.620689655172414) internal successors, (163), 30 states have internal predecessors, (163), 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-24 01:17:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1982 transitions. [2024-11-24 01:17:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 01:17:27,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:17:27,107 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-24 01:17:27,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-24 01:17:27,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-24 01:17:27,308 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:17:27,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:17:27,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1214148546, now seen corresponding path program 1 times [2024-11-24 01:17:27,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:17:27,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649307612] [2024-11-24 01:17:27,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:17:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:17:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:28,108 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-24 01:17:28,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:17:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649307612] [2024-11-24 01:17:28,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649307612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:17:28,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:17:28,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 01:17:28,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216875715] [2024-11-24 01:17:28,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:17:28,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 01:17:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:17:28,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 01:17:28,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-24 01:17:28,110 INFO L87 Difference]: Start difference. First operand 1552 states and 1982 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:17:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:17:32,675 INFO L93 Difference]: Finished difference Result 1597 states and 2037 transitions. [2024-11-24 01:17:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:17:32,675 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-24 01:17:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:17:32,677 INFO L225 Difference]: With dead ends: 1597 [2024-11-24 01:17:32,677 INFO L226 Difference]: Without dead ends: 1597 [2024-11-24 01:17:32,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-24 01:17:32,678 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1178 mSDsluCounter, 5847 mSDsCounter, 0 mSdLazyCounter, 4512 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 6598 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:17:32,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 6598 Invalid, 4532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4512 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-24 01:17:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2024-11-24 01:17:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1593. [2024-11-24 01:17:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1216 states have (on average 1.6504934210526316) internal successors, (2007), 1579 states have internal predecessors, (2007), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:17:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2027 transitions. [2024-11-24 01:17:32,694 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2027 transitions. Word has length 103 [2024-11-24 01:17:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:17:32,695 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2027 transitions. [2024-11-24 01:17:32,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:17:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2027 transitions. [2024-11-24 01:17:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 01:17:32,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:17:32,696 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-24 01:17:32,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-24 01:17:32,696 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:17:32,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:17:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1214148547, now seen corresponding path program 1 times [2024-11-24 01:17:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:17:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771362838] [2024-11-24 01:17:32,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:17:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:17:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:34,396 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-24 01:17:34,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:17:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771362838] [2024-11-24 01:17:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771362838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:17:34,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:17:34,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 01:17:34,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583140523] [2024-11-24 01:17:34,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:17:34,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:17:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:17:34,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:17:34,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:17:34,398 INFO L87 Difference]: Start difference. First operand 1593 states and 2027 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:17:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:17:41,478 INFO L93 Difference]: Finished difference Result 1596 states and 2035 transitions. [2024-11-24 01:17:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-24 01:17:41,478 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-24 01:17:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:17:41,480 INFO L225 Difference]: With dead ends: 1596 [2024-11-24 01:17:41,481 INFO L226 Difference]: Without dead ends: 1596 [2024-11-24 01:17:41,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-24 01:17:41,481 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1157 mSDsluCounter, 5647 mSDsCounter, 0 mSdLazyCounter, 5922 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 6393 SdHoareTripleChecker+Invalid, 5944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:17:41,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 6393 Invalid, 5944 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5922 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-24 01:17:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-24 01:17:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1593. [2024-11-24 01:17:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1216 states have (on average 1.6488486842105263) internal successors, (2005), 1579 states have internal predecessors, (2005), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:17:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2025 transitions. [2024-11-24 01:17:41,497 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2025 transitions. Word has length 103 [2024-11-24 01:17:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:17:41,498 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2025 transitions. [2024-11-24 01:17:41,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:17:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2025 transitions. [2024-11-24 01:17:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-24 01:17:41,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:17:41,499 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] [2024-11-24 01:17:41,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-24 01:17:41,499 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:17:41,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:17:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1710030459, now seen corresponding path program 1 times [2024-11-24 01:17:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:17:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842578267] [2024-11-24 01:17:41,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:17:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:17:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:42,045 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-24 01:17:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:17:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842578267] [2024-11-24 01:17:42,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842578267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:17:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:17:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:17:42,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103070037] [2024-11-24 01:17:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:17:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:17:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:17:42,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:17:42,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:17:42,051 INFO L87 Difference]: Start difference. First operand 1593 states and 2025 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:17:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:17:43,850 INFO L93 Difference]: Finished difference Result 1592 states and 2023 transitions. [2024-11-24 01:17:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:17:43,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2024-11-24 01:17:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:17:43,853 INFO L225 Difference]: With dead ends: 1592 [2024-11-24 01:17:43,853 INFO L226 Difference]: Without dead ends: 1592 [2024-11-24 01:17:43,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:17:43,853 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 2 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3711 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:17:43,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3711 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-24 01:17:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-24 01:17:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2024-11-24 01:17:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1216 states have (on average 1.647203947368421) internal successors, (2003), 1578 states have internal predecessors, (2003), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:17:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2023 transitions. [2024-11-24 01:17:43,880 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2023 transitions. Word has length 104 [2024-11-24 01:17:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:17:43,881 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2023 transitions. [2024-11-24 01:17:43,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:17:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2023 transitions. [2024-11-24 01:17:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-24 01:17:43,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:17:43,882 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] [2024-11-24 01:17:43,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-24 01:17:43,882 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:17:43,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:17:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1710030460, now seen corresponding path program 1 times [2024-11-24 01:17:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:17:43,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045441513] [2024-11-24 01:17:43,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:17:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:17:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:45,697 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-24 01:17:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:17:45,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045441513] [2024-11-24 01:17:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045441513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:17:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436727736] [2024-11-24 01:17:45,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:17:45,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:17:45,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:17:45,700 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:17:45,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-24 01:17:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:46,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-24 01:17:46,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:17:46,163 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-24 01:17:46,345 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:17:46,346 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-24 01:17:46,354 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-24 01:17:46,362 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-24 01:17:46,371 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-24 01:17:46,470 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-24 01:17:46,477 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-24 01:17:46,759 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:46,759 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-24 01:17:46,766 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-24 01:17:46,926 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:46,927 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-24 01:17:46,934 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-24 01:17:47,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:47,065 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-24 01:17:47,074 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-24 01:17:47,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:47,212 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-24 01:17:47,218 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-24 01:17:47,347 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:47,347 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-24 01:17:47,353 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-24 01:17:47,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:17:47,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-24 01:17:47,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:17:47,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:17:47,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:47,507 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-24 01:17:47,513 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-24 01:17:47,550 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-24 01:17:47,556 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-24 01:17:47,564 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-24 01:17:47,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:17:47,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2918) |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_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2918 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-24 01:17:49,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2918 (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 ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2911))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2913))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2912) .cse0 v_ArrVal_2914) .cse1 v_ArrVal_2916) (select (select (store .cse2 .cse1 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2918))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| 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_2917 Int) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2911))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2913))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2915))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2912) .cse5 v_ArrVal_2914) .cse6 v_ArrVal_2916) .cse7 v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2917) (select (select (store .cse8 .cse7 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-24 01:17:49,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4))) (and (or (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2918 (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 ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2911))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2913))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2912) .cse1 v_ArrVal_2914) .cse2 v_ArrVal_2916) (select (select (store .cse3 .cse2 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2918))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| 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_2917 Int) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2911))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2913))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2915))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2912) .cse6 v_ArrVal_2914) .cse7 v_ArrVal_2916) .cse8 v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2917) (select (select (store .cse9 .cse8 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-24 01:18:24,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:18:24,120 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-24 01:18:29,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2924 (Array Int Int)) (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_2909 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2925 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2924))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2910))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2911))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2913))) (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_ArrVal_2925) .cse0 v_ArrVal_2909) .cse1 v_ArrVal_2912) .cse2 v_ArrVal_2914) .cse3 v_ArrVal_2916) (select (select (store .cse4 .cse3 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_2918))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((v_ArrVal_2917 Int) (v_prenex_32 Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2919 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_32) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_27))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_prenex_31))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_prenex_30))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_prenex_28))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_prenex_36))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ 43 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_37) .cse9 v_prenex_33) .cse10 v_prenex_29) .cse11 v_prenex_38) .cse12 v_prenex_35) .cse13 v_prenex_34) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| v_prenex_32 v_ArrVal_2917) (select (select (store .cse14 .cse13 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-24 01:18:29,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436727736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:18:29,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:18:29,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2024-11-24 01:18:29,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905334509] [2024-11-24 01:18:29,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:18:29,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-24 01:18:29,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:18:29,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-24 01:18:29,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1100, Unknown=57, NotChecked=292, Total=1640 [2024-11-24 01:18:29,389 INFO L87 Difference]: Start difference. First operand 1592 states and 2023 transitions. Second operand has 27 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 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-24 01:19:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:19:15,704 INFO L93 Difference]: Finished difference Result 1594 states and 2031 transitions. [2024-11-24 01:19:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-24 01:19:15,705 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 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 104 [2024-11-24 01:19:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:19:15,707 INFO L225 Difference]: With dead ends: 1594 [2024-11-24 01:19:15,707 INFO L226 Difference]: Without dead ends: 1594 [2024-11-24 01:19:15,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 44.1s TimeCoverageRelationStatistics Valid=330, Invalid=1885, Unknown=57, NotChecked=380, Total=2652 [2024-11-24 01:19:15,708 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1141 mSDsluCounter, 6050 mSDsCounter, 0 mSdLazyCounter, 6788 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 6794 SdHoareTripleChecker+Invalid, 6812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:19:15,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 6794 Invalid, 6812 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 6788 Invalid, 0 Unknown, 0 Unchecked, 43.7s Time] [2024-11-24 01:19:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-11-24 01:19:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1550. [2024-11-24 01:19:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1176 states have (on average 1.6666666666666667) internal successors, (1960), 1538 states have internal predecessors, (1960), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:19:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1978 transitions. [2024-11-24 01:19:15,730 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1978 transitions. Word has length 104 [2024-11-24 01:19:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:19:15,730 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 1978 transitions. [2024-11-24 01:19:15,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 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-24 01:19:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1978 transitions. [2024-11-24 01:19:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-24 01:19:15,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:19:15,732 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-24 01:19:15,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-24 01:19:15,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-24 01:19:15,933 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:19:15,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:19:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1514580590, now seen corresponding path program 1 times [2024-11-24 01:19:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:19:15,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806329411] [2024-11-24 01:19:15,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:19:15,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:19:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:19:18,832 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-24 01:19:18,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:19:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806329411] [2024-11-24 01:19:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806329411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:19:18,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:19:18,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-24 01:19:18,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314322634] [2024-11-24 01:19:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:19:18,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-24 01:19:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:19:18,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-24 01:19:18,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-24 01:19:18,836 INFO L87 Difference]: Start difference. First operand 1550 states and 1978 transitions. Second operand has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:19:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:19:57,105 INFO L93 Difference]: Finished difference Result 1635 states and 2087 transitions. [2024-11-24 01:19:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:19:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-24 01:19:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:19:57,109 INFO L225 Difference]: With dead ends: 1635 [2024-11-24 01:19:57,109 INFO L226 Difference]: Without dead ends: 1635 [2024-11-24 01:19:57,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-24 01:19:57,110 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 1188 mSDsluCounter, 8067 mSDsCounter, 0 mSdLazyCounter, 6131 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 8824 SdHoareTripleChecker+Invalid, 6153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:19:57,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 8824 Invalid, 6153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 6131 Invalid, 0 Unknown, 0 Unchecked, 37.0s Time] [2024-11-24 01:19:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-24 01:19:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1597. [2024-11-24 01:19:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1222 states have (on average 1.6440261865793782) internal successors, (2009), 1583 states have internal predecessors, (2009), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:19:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2029 transitions. [2024-11-24 01:19:57,127 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2029 transitions. Word has length 106 [2024-11-24 01:19:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:19:57,127 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2029 transitions. [2024-11-24 01:19:57,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:19:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2029 transitions. [2024-11-24 01:19:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-24 01:19:57,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:19:57,128 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-24 01:19:57,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-24 01:19:57,128 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:19:57,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:19:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1514580589, now seen corresponding path program 1 times [2024-11-24 01:19:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:19:57,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721631912] [2024-11-24 01:19:57,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:19:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:19:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:20:00,563 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-24 01:20:00,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:20:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721631912] [2024-11-24 01:20:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721631912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:20:00,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:20:00,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-24 01:20:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350056107] [2024-11-24 01:20:00,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:20:00,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 01:20:00,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:20:00,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 01:20:00,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:20:00,565 INFO L87 Difference]: Start difference. First operand 1597 states and 2029 transitions. Second operand has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:20:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:20:45,360 INFO L93 Difference]: Finished difference Result 1634 states and 2085 transitions. [2024-11-24 01:20:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:20:45,361 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-24 01:20:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:20:45,364 INFO L225 Difference]: With dead ends: 1634 [2024-11-24 01:20:45,364 INFO L226 Difference]: Without dead ends: 1634 [2024-11-24 01:20:45,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-24 01:20:45,365 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1207 mSDsluCounter, 8405 mSDsCounter, 0 mSdLazyCounter, 6953 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 9158 SdHoareTripleChecker+Invalid, 6976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:20:45,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 9158 Invalid, 6976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6953 Invalid, 0 Unknown, 0 Unchecked, 43.4s Time] [2024-11-24 01:20:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-24 01:20:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1597. [2024-11-24 01:20:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1222 states have (on average 1.6423895253682488) internal successors, (2007), 1583 states have internal predecessors, (2007), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:20:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2027 transitions. [2024-11-24 01:20:45,387 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2027 transitions. Word has length 106 [2024-11-24 01:20:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:20:45,388 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2027 transitions. [2024-11-24 01:20:45,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:20:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2027 transitions. [2024-11-24 01:20:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-24 01:20:45,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:20:45,389 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, 1] [2024-11-24 01:20:45,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-24 01:20:45,389 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:20:45,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:20:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash 910958649, now seen corresponding path program 1 times [2024-11-24 01:20:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:20:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502608126] [2024-11-24 01:20:45,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:20:45,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:20:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:20:48,850 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-24 01:20:48,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:20:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502608126] [2024-11-24 01:20:48,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502608126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:20:48,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:20:48,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 01:20:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051582618] [2024-11-24 01:20:48,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:20:48,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 01:20:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:20:48,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 01:20:48,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:20:48,852 INFO L87 Difference]: Start difference. First operand 1597 states and 2027 transitions. Second operand has 13 states, 12 states have (on average 8.75) internal successors, (105), 13 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:21:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:21:16,538 INFO L93 Difference]: Finished difference Result 1596 states and 2025 transitions. [2024-11-24 01:21:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 01:21:16,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.75) internal successors, (105), 13 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-24 01:21:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:21:16,541 INFO L225 Difference]: With dead ends: 1596 [2024-11-24 01:21:16,541 INFO L226 Difference]: Without dead ends: 1596 [2024-11-24 01:21:16,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-24 01:21:16,542 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 3424 mSDsluCounter, 5803 mSDsCounter, 0 mSdLazyCounter, 4469 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 6557 SdHoareTripleChecker+Invalid, 4503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:21:16,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 6557 Invalid, 4503 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 4469 Invalid, 0 Unknown, 0 Unchecked, 26.5s Time] [2024-11-24 01:21:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-24 01:21:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2024-11-24 01:21:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1222 states have (on average 1.6407528641571194) internal successors, (2005), 1582 states have internal predecessors, (2005), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:21:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2025 transitions. [2024-11-24 01:21:16,562 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2025 transitions. Word has length 107 [2024-11-24 01:21:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:21:16,562 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2025 transitions. [2024-11-24 01:21:16,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.75) internal successors, (105), 13 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:21:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2025 transitions. [2024-11-24 01:21:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-24 01:21:16,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:21:16,564 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, 1] [2024-11-24 01:21:16,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-24 01:21:16,564 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:21:16,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:21:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash 910958650, now seen corresponding path program 1 times [2024-11-24 01:21:16,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:21:16,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122019802] [2024-11-24 01:21:16,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:21:16,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:21:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:21:19,738 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-24 01:21:19,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:21:19,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122019802] [2024-11-24 01:21:19,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122019802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:21:19,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734774587] [2024-11-24 01:21:19,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:21:19,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:21:19,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:21:19,742 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:21:19,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-24 01:21:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:21:20,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-24 01:21:20,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:21:20,215 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-24 01:21:21,105 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:21:21,105 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-24 01:21:21,132 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-24 01:21:21,145 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-24 01:21:21,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:21:21,631 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-24 01:21:21,655 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-24 01:21:22,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:21:22,039 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-24 01:21:22,052 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-24 01:21:22,423 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:21:22,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 01:21:22,437 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-24 01:21:22,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:21:22,816 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-24 01:21:22,834 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-24 01:21:23,275 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:21:23,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 51 treesize of output 48 [2024-11-24 01:21:23,300 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-24 01:21:23,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:21:23,716 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-24 01:21:23,746 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-24 01:21:24,437 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:21:24,438 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-24 01:21:24,452 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-24 01:21:24,541 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-24 01:21:24,554 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-24 01:21:24,779 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-24 01:21:24,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:21:25,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3412 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-24 01:21:25,355 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_3412 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-24 01:21:25,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:21:25,442 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 80 treesize of output 84 [2024-11-24 01:21:25,588 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3410) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem56#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3409))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-24 01:21:25,700 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_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3410) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3409))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-24 01:21:25,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3408))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3407) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3408))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3407) .cse6 v_ArrVal_3410) (select (select (store .cse7 .cse6 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) is different from false [2024-11-24 01:21:25,914 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_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3408))) (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_3407) .cse1 v_prenex_40) (select (select (store .cse2 .cse1 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3407) .cse4 v_ArrVal_3410) (select (select (store .cse5 .cse4 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3412))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3408))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_3409))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8))))))) is different from false [2024-11-24 01:21:26,071 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3406))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3408)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3406))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3408))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3405) .cse5 v_ArrVal_3407) .cse6 v_prenex_40) (select (select (store .cse7 .cse6 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3406))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3408))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3405) .cse9 v_ArrVal_3407) .cse10 v_ArrVal_3410) (select (select (store .cse11 .cse10 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) is different from false [2024-11-24 01:21:30,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3406))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3408)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3409))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3406))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3408))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3405) .cse6 v_ArrVal_3407) .cse7 v_ArrVal_3410) (select (select (store .cse8 .cse7 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3412))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3406))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3408))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3405) .cse10 v_ArrVal_3407) .cse11 v_prenex_40) (select (select (store .cse12 .cse11 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-24 01:21:35,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3404))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3406)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3408)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3404))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3406))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3408))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3403) .cse6 v_ArrVal_3405) .cse7 v_ArrVal_3407) .cse8 v_ArrVal_3410) (select (select (store .cse9 .cse8 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3404))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3406))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3408))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3403) .cse12 v_ArrVal_3405) .cse13 v_ArrVal_3407) .cse14 v_prenex_40) (select (select (store .cse15 .cse14 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-24 01:21:40,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3404))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3406))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3408))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3403) .cse1 v_ArrVal_3405) .cse2 v_ArrVal_3407) .cse3 v_prenex_40) (select (select (store .cse4 .cse3 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3404))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3406)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3408)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= (select (select (let ((.cse8 (store .cse9 .cse10 v_ArrVal_3409))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) .cse10)))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3404))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3406))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3408))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3403) .cse13 v_ArrVal_3405) .cse14 v_ArrVal_3407) .cse15 v_ArrVal_3410) (select (select (store .cse16 .cse15 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3412))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1))))) is different from false [2024-11-24 01:21:44,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3401))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3404))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3406))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3408))) (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~mem52#1.base| v_ArrVal_3402) .cse0 v_ArrVal_3403) .cse1 v_ArrVal_3405) .cse2 v_ArrVal_3407) .cse3 v_ArrVal_3410) (select (select (store .cse4 .cse3 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3412))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3401))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3404)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3406)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3408)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3409))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3401))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_3404))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_3406))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_3408))) (let ((.cse18 (select (select .cse19 |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~mem52#1.base| v_ArrVal_3402) .cse15 v_ArrVal_3403) .cse16 v_ArrVal_3405) .cse17 v_ArrVal_3407) .cse18 v_prenex_40) (select (select (store .cse19 .cse18 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) is different from false [2024-11-24 01:21:48,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |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|) .cse6))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3401))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3404))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3406))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3402) .cse1 v_ArrVal_3403) .cse2 v_ArrVal_3405) .cse3 v_ArrVal_3407) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3401))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3404)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3406)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3408)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3409))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) .cse12)))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3401))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3404))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3406))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3408))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3402) .cse16 v_ArrVal_3403) .cse17 v_ArrVal_3405) .cse18 v_ArrVal_3407) .cse19 v_ArrVal_3410) (select (select (store .cse20 .cse19 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3412))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1))))) is different from false [2024-11-24 01:21:53,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3417 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3418 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3417))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3401))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3404))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3406))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3418) .cse0 v_ArrVal_3402) .cse1 v_ArrVal_3403) .cse2 v_ArrVal_3405) .cse3 v_ArrVal_3407) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3417 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3418 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3417))) (let ((.cse11 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse19 (store .cse20 .cse11 v_ArrVal_3401))) (let ((.cse12 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_3404))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3406))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3408))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3418) .cse11 v_ArrVal_3402) .cse12 v_ArrVal_3403) .cse13 v_ArrVal_3405) .cse14 v_ArrVal_3407) .cse15 v_ArrVal_3410) (select (select (store .cse16 .cse15 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3412))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3417 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3417))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3401)))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3404)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3406)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3408)))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= .cse21 (select (select (let ((.cse22 (store .cse23 .cse21 v_ArrVal_3409))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))) is different from false [2024-11-24 01:21:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734774587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:21:53,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:21:53,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 25 [2024-11-24 01:21:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217993491] [2024-11-24 01:21:53,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:21:53,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-24 01:21:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:21:53,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-24 01:21:53,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=687, Unknown=13, NotChecked=832, Total=1640 [2024-11-24 01:21:53,725 INFO L87 Difference]: Start difference. First operand 1596 states and 2025 transitions. Second operand has 26 states, 24 states have (on average 6.625) internal successors, (159), 26 states have internal predecessors, (159), 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-24 01:23:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:23:21,961 INFO L93 Difference]: Finished difference Result 1620 states and 2061 transitions. [2024-11-24 01:23:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-24 01:23:21,962 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.625) internal successors, (159), 26 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-24 01:23:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:23:21,964 INFO L225 Difference]: With dead ends: 1620 [2024-11-24 01:23:21,964 INFO L226 Difference]: Without dead ends: 1620 [2024-11-24 01:23:21,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=208, Invalid=1391, Unknown=13, NotChecked=1144, Total=2756 [2024-11-24 01:23:21,966 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1195 mSDsluCounter, 8058 mSDsCounter, 0 mSdLazyCounter, 7308 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 8802 SdHoareTripleChecker+Invalid, 7342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 7308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:23:21,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 8802 Invalid, 7342 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 7308 Invalid, 0 Unknown, 0 Unchecked, 84.4s Time] [2024-11-24 01:23:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-11-24 01:23:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1548. [2024-11-24 01:23:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1176 states have (on average 1.663265306122449) internal successors, (1956), 1536 states have internal predecessors, (1956), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:23:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1974 transitions. [2024-11-24 01:23:21,986 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1974 transitions. Word has length 107 [2024-11-24 01:23:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:23:21,986 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 1974 transitions. [2024-11-24 01:23:21,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.625) internal successors, (159), 26 states have internal predecessors, (159), 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-24 01:23:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1974 transitions. [2024-11-24 01:23:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-24 01:23:21,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:23:21,988 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, 1, 1, 1] [2024-11-24 01:23:22,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-24 01:23:22,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:23:22,188 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:23:22,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:23:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2056727382, now seen corresponding path program 1 times [2024-11-24 01:23:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:23:22,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811664377] [2024-11-24 01:23:22,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:23:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:23:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:23:22,607 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-24 01:23:22,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:23:22,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811664377] [2024-11-24 01:23:22,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811664377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:23:22,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:23:22,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:23:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997002703] [2024-11-24 01:23:22,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:23:22,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:23:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:23:22,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:23:22,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:23:22,609 INFO L87 Difference]: Start difference. First operand 1548 states and 1974 transitions. Second operand has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:23:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:23:36,374 INFO L93 Difference]: Finished difference Result 1547 states and 1972 transitions. [2024-11-24 01:23:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:23:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-24 01:23:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:23:36,377 INFO L225 Difference]: With dead ends: 1547 [2024-11-24 01:23:36,377 INFO L226 Difference]: Without dead ends: 1547 [2024-11-24 01:23:36,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:23:36,377 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 5 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:23:36,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3691 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-11-24 01:23:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-11-24 01:23:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2024-11-24 01:23:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1176 states have (on average 1.66156462585034) internal successors, (1954), 1535 states have internal predecessors, (1954), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:23:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1972 transitions. [2024-11-24 01:23:36,398 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1972 transitions. Word has length 109 [2024-11-24 01:23:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:23:36,399 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 1972 transitions. [2024-11-24 01:23:36,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:23:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1972 transitions. [2024-11-24 01:23:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-24 01:23:36,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:23:36,400 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, 1, 1, 1] [2024-11-24 01:23:36,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-24 01:23:36,401 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:23:36,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:23:36,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2056727383, now seen corresponding path program 1 times [2024-11-24 01:23:36,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:23:36,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871312018] [2024-11-24 01:23:36,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:23:36,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:23:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:23:41,755 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-24 01:23:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:23:41,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871312018] [2024-11-24 01:23:41,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871312018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:23:41,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:23:41,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-24 01:23:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083129863] [2024-11-24 01:23:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:23:41,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 01:23:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:23:41,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 01:23:41,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-24 01:23:41,757 INFO L87 Difference]: Start difference. First operand 1547 states and 1972 transitions. Second operand has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:25:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:25:11,289 INFO L93 Difference]: Finished difference Result 1629 states and 2075 transitions. [2024-11-24 01:25:11,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:25:11,290 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-24 01:25:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:25:11,292 INFO L225 Difference]: With dead ends: 1629 [2024-11-24 01:25:11,292 INFO L226 Difference]: Without dead ends: 1629 [2024-11-24 01:25:11,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-24 01:25:11,293 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1211 mSDsluCounter, 8912 mSDsCounter, 0 mSdLazyCounter, 7476 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 9657 SdHoareTripleChecker+Invalid, 7501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 86.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:25:11,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 9657 Invalid, 7501 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7476 Invalid, 0 Unknown, 0 Unchecked, 86.6s Time] [2024-11-24 01:25:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-24 01:25:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1600. [2024-11-24 01:25:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1228 states have (on average 1.6343648208469055) internal successors, (2007), 1586 states have internal predecessors, (2007), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-24 01:25:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2027 transitions. [2024-11-24 01:25:11,310 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2027 transitions. Word has length 109 [2024-11-24 01:25:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:25:11,311 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2027 transitions. [2024-11-24 01:25:11,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:25:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2027 transitions. [2024-11-24 01:25:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-24 01:25:11,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:25:11,312 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, 1, 1, 1, 1] [2024-11-24 01:25:11,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-24 01:25:11,312 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:25:11,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:25:11,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1528558768, now seen corresponding path program 1 times [2024-11-24 01:25:11,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:25:11,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133102127] [2024-11-24 01:25:11,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:25:11,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:25:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:25:12,045 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-24 01:25:12,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:25:12,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133102127] [2024-11-24 01:25:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133102127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:25:12,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:25:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:25:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224418994] [2024-11-24 01:25:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:25:12,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:25:12,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:25:12,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:25:12,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:25:12,048 INFO L87 Difference]: Start difference. First operand 1600 states and 2027 transitions. Second operand has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:25:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:25:26,456 INFO L93 Difference]: Finished difference Result 1599 states and 2025 transitions. [2024-11-24 01:25:26,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:25:26,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-24 01:25:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:25:26,459 INFO L225 Difference]: With dead ends: 1599 [2024-11-24 01:25:26,459 INFO L226 Difference]: Without dead ends: 1599 [2024-11-24 01:25:26,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:25:26,459 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 4 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:25:26,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3701 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2024-11-24 01:25:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-11-24 01:25:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1546. [2024-11-24 01:25:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1176 states have (on average 1.6598639455782314) internal successors, (1952), 1534 states have internal predecessors, (1952), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-24 01:25:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1970 transitions. [2024-11-24 01:25:26,474 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1970 transitions. Word has length 110 [2024-11-24 01:25:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:25:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 1970 transitions. [2024-11-24 01:25:26,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:25:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1970 transitions. [2024-11-24 01:25:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-24 01:25:26,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:25:26,475 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, 1, 1, 1, 1] [2024-11-24 01:25:26,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-24 01:25:26,475 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:25:26,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:25:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash -665959914, now seen corresponding path program 1 times [2024-11-24 01:25:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:25:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4369130] [2024-11-24 01:25:26,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:25:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:25:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:25:33,487 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-24 01:25:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:25:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4369130] [2024-11-24 01:25:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4369130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:25:33,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:25:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-24 01:25:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797288263] [2024-11-24 01:25:33,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:25:33,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-24 01:25:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:25:33,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-24 01:25:33,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-24 01:25:33,489 INFO L87 Difference]: Start difference. First operand 1546 states and 1970 transitions. Second operand has 21 states, 20 states have (on average 5.4) internal successors, (108), 21 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:27:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:05,164 INFO L93 Difference]: Finished difference Result 1629 states and 2073 transitions. [2024-11-24 01:27:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-24 01:27:05,165 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.4) internal successors, (108), 21 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-24 01:27:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:05,167 INFO L225 Difference]: With dead ends: 1629 [2024-11-24 01:27:05,167 INFO L226 Difference]: Without dead ends: 1629 [2024-11-24 01:27:05,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2024-11-24 01:27:05,168 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1212 mSDsluCounter, 10153 mSDsCounter, 0 mSdLazyCounter, 7529 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 10900 SdHoareTripleChecker+Invalid, 7558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:05,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 10900 Invalid, 7558 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 7529 Invalid, 0 Unknown, 0 Unchecked, 87.8s Time] [2024-11-24 01:27:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-24 01:27:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1601. [2024-11-24 01:27:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1230 states have (on average 1.6317073170731706) internal successors, (2007), 1587 states have internal predecessors, (2007), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-24 01:27:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2031 transitions. [2024-11-24 01:27:05,193 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2031 transitions. Word has length 110 [2024-11-24 01:27:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:05,193 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2031 transitions. [2024-11-24 01:27:05,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.4) internal successors, (108), 21 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:27:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2031 transitions. [2024-11-24 01:27:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-24 01:27:05,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:05,195 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, 1, 1, 1, 1] [2024-11-24 01:27:05,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-24 01:27:05,195 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:27:05,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash -665959913, now seen corresponding path program 1 times [2024-11-24 01:27:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:05,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120397301] [2024-11-24 01:27:05,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:10,699 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-24 01:27:10,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:10,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120397301] [2024-11-24 01:27:10,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120397301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:10,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:10,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 01:27:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020789245] [2024-11-24 01:27:10,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:10,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:27:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:10,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:27:10,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:27:10,701 INFO L87 Difference]: Start difference. First operand 1601 states and 2031 transitions. Second operand has 19 states, 18 states have (on average 6.0) internal successors, (108), 19 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:28:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:32,665 INFO L93 Difference]: Finished difference Result 1628 states and 2071 transitions. [2024-11-24 01:28:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-24 01:28:32,665 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.0) internal successors, (108), 19 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-24 01:28:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:32,668 INFO L225 Difference]: With dead ends: 1628 [2024-11-24 01:28:32,668 INFO L226 Difference]: Without dead ends: 1628 [2024-11-24 01:28:32,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-24 01:28:32,669 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1193 mSDsluCounter, 8258 mSDsCounter, 0 mSdLazyCounter, 7034 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 9014 SdHoareTripleChecker+Invalid, 7058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:32,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 9014 Invalid, 7058 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 7034 Invalid, 0 Unknown, 0 Unchecked, 78.6s Time] [2024-11-24 01:28:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-11-24 01:28:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1601. [2024-11-24 01:28:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1228 states have (on average 1.6327361563517915) internal successors, (2005), 1587 states have internal predecessors, (2005), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-24 01:28:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2029 transitions. [2024-11-24 01:28:32,690 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2029 transitions. Word has length 110 [2024-11-24 01:28:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:32,691 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2029 transitions. [2024-11-24 01:28:32,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.0) internal successors, (108), 19 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:28:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2029 transitions. [2024-11-24 01:28:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-24 01:28:32,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:32,692 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, 1, 1, 1, 1, 1] [2024-11-24 01:28:32,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-24 01:28:32,693 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-24 01:28:32,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:32,693 INFO L85 PathProgramCache]: Analyzing trace with hash -140680899, now seen corresponding path program 1 times [2024-11-24 01:28:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:32,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873938302] [2024-11-24 01:28:32,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:39,283 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-24 01:28:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:39,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873938302] [2024-11-24 01:28:39,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873938302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:28:39,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178211620] [2024-11-24 01:28:39,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:39,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:28:39,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:28:39,286 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:28:39,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bdc62a8-59a4-4902-83e4-110296cd3955/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-24 01:28:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:39,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-24 01:28:39,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:39,741 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-24 01:28:41,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:28:41,327 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-24 01:28:41,782 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-24 01:28:41,805 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-24 01:28:42,974 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:28:42,974 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-24 01:28:42,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:28:43,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:28:43,638 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-24 01:28:43,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:28:44,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:28:44,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 51 treesize of output 48 [2024-11-24 01:28:44,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:28:44,987 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:28:44,987 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-24 01:28:45,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:28:45,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:28:45,713 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-24 01:28:45,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:28:46,452 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-24 01:28:47,172 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-24 01:28:47,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 63 [2024-11-24 01:28:47,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-24 01:28:48,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:28:48,605 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-24 01:28:48,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-24 01:28:48,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-24 01:28:48,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-24 01:28:49,454 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-24 01:28:49,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-24 01:28:49,477 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-24 01:28:49,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:28:49,713 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4085 (Array Int Int))) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4086))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (not (= (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base|) .cse2 (select v_ArrVal_4086 .cse2))) v_ArrVal_4086)))) is different from false [2024-11-24 01:28:49,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse2 (+ |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|) .cse2))) (or (not (= (let ((.cse1 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 (select v_ArrVal_4086 .cse1))) v_ArrVal_4086)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4086))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) 1))))) is different from false [2024-11-24 01:28:50,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4084)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select |c_#valid| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4086))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4086 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4086 .cse5))))))))) is different from false [2024-11-24 01:28:50,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 184 [2024-11-24 01:28:50,393 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4084 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_14|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4084)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4086 .cse4))) v_ArrVal_4086)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4086))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-24 01:28:50,595 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4084 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4084))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4086))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4086 .cse5))) v_ArrVal_4086)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-24 01:28:51,067 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4080 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4081 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4081)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4080))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4084))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4086))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4086 .cse5))) v_ArrVal_4086)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-24 01:28:51,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4080 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4081 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4081))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4080))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4084)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4086))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4086 .cse5))) v_ArrVal_4086)))))))))) is different from false [2024-11-24 01:28:52,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4080 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4081 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4078)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4081))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4079) .cse9 v_ArrVal_4080))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4084)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4086))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4086 .cse5))) v_ArrVal_4086)))))))))) is different from false [2024-11-24 01:28:52,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4080 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4081 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4078))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4081))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4079) .cse10 v_ArrVal_4080))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4084))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4086 .cse2))) v_ArrVal_4086)) (= (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4086))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-24 01:28:52,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4077 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4080 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4081 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4077)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4078))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4081))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4076) .cse9 v_ArrVal_4079) .cse10 v_ArrVal_4080))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4084))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4086))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4086 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4086 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-24 01:28:53,006 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4077 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4080 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4081 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4077))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4078))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4081))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4076) .cse10 v_ArrVal_4079) .cse11 v_ArrVal_4080))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4084))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4086))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4086 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4086 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-24 01:28:53,464 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4080 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4081 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4085 (Array Int Int)) (v_ArrVal_4075 (Array Int Int)) (v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4077 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4074)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4077))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4078))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4081))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4075) .cse9 v_ArrVal_4076) .cse10 v_ArrVal_4079) .cse11 v_ArrVal_4080))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4084)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4086 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4086 .cse4))))) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4086))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|))))))))))))) is different from false [2024-11-24 01:28:53,710 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4080 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4081 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4085 (Array Int Int)) (v_ArrVal_4075 (Array Int Int)) (v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4077 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4074))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4077))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4078))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4081))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4075) .cse10 v_ArrVal_4076) .cse11 v_ArrVal_4079) .cse12 v_ArrVal_4080))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4084)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4086 .cse2))) v_ArrVal_4086)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4086))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))))) is different from false [2024-11-24 01:28:54,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4080 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4081 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4085 (Array Int Int)) (v_ArrVal_4075 (Array Int Int)) (v_ArrVal_4086 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4077 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4091)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4074))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4077))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4078))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4081))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4092) .cse9 v_ArrVal_4075) .cse10 v_ArrVal_4076) .cse11 v_ArrVal_4079) .cse12 v_ArrVal_4080))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4084)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4086))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4086 .cse5))) v_ArrVal_4086)))))))))))))))) is different from false [2024-11-24 01:28:54,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178211620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:28:54,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:28:54,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2024-11-24 01:28:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24932519] [2024-11-24 01:28:54,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:28:54,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-24 01:28:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:54,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-24 01:28:54,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=962, Unknown=14, NotChecked=1050, Total=2162 [2024-11-24 01:28:54,564 INFO L87 Difference]: Start difference. First operand 1601 states and 2029 transitions. Second operand has 33 states, 30 states have (on average 5.9) internal successors, (177), 33 states have internal predecessors, (177), 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)