./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:21:24,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:21:24,276 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:21:24,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:21:24,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:21:24,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:21:24,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:21:24,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:21:24,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:21:24,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:21:24,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:21:24,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:21:24,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:21:24,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:21:24,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:21:24,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:21:24,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:21:24,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:21:24,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:21:24,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:21:24,317 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:21:24,317 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:21:24,317 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:21:24,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:21:24,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:21:24,318 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:21:24,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:21:24,318 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:21:24,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:21:24,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:21:24,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:21:24,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:21:24,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:21:24,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:21:24,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:21:24,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:21:24,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:21:24,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:21:24,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:21:24,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:21:24,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:21:24,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:21:24,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:21:24,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:21:24,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:21:24,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:21:24,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:21:24,320 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_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 [2024-11-28 04:21:24,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:21:24,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:21:24,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:21:24,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:21:24,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:21:24,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2024-11-28 04:21:28,238 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/data/8755a6827/bee4b39c8abf4fdcbd64b341fa84ce6a/FLAG7da9a1d29 [2024-11-28 04:21:28,851 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:21:28,851 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2024-11-28 04:21:28,887 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/data/8755a6827/bee4b39c8abf4fdcbd64b341fa84ce6a/FLAG7da9a1d29 [2024-11-28 04:21:28,911 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/data/8755a6827/bee4b39c8abf4fdcbd64b341fa84ce6a [2024-11-28 04:21:28,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:21:28,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:21:28,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:21:28,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:21:28,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:21:28,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:21:28" (1/1) ... [2024-11-28 04:21:28,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d52c2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:28, skipping insertion in model container [2024-11-28 04:21:28,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:21:28" (1/1) ... [2024-11-28 04:21:29,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:21:29,633 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,684 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,689 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,694 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,702 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,742 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,745 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,749 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,756 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,796 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,796 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,801 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,801 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,827 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,828 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,830 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,830 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,848 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,848 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,851 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,851 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,887 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,887 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,890 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,890 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:21:29,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:21:29,919 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:21:30,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:21:30,190 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:21:30,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30 WrapperNode [2024-11-28 04:21:30,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:21:30,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:21:30,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:21:30,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:21:30,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,360 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3362 [2024-11-28 04:21:30,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:21:30,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:21:30,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:21:30,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:21:30,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,536 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2024-11-28 04:21:30,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:21:30,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:21:30,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:21:30,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:21:30,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (1/1) ... [2024-11-28 04:21:30,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:21:30,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:21:30,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:21:30,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:21:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-28 04:21:30,819 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-28 04:21:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:21:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:21:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:21:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 04:21:30,820 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 04:21:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:21:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:21:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:21:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 04:21:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 04:21:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 04:21:30,822 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 04:21:30,822 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 04:21:30,823 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 04:21:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:21:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:21:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:21:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:21:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:21:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:21:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:21:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:21:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:21:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:21:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:21:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:21:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:21:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:21:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:21:31,240 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:21:31,243 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:21:31,320 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:21:31,366 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:21:31,402 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:21:38,083 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2024-11-28 04:21:38,083 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:21:38,143 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:21:38,144 INFO L312 CfgBuilder]: Removed 85 assume(true) statements. [2024-11-28 04:21:38,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:21:38 BoogieIcfgContainer [2024-11-28 04:21:38,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:21:38,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:21:38,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:21:38,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:21:38,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:21:28" (1/3) ... [2024-11-28 04:21:38,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f25ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:21:38, skipping insertion in model container [2024-11-28 04:21:38,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:30" (2/3) ... [2024-11-28 04:21:38,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f25ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:21:38, skipping insertion in model container [2024-11-28 04:21:38,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:21:38" (3/3) ... [2024-11-28 04:21:38,157 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-1.i [2024-11-28 04:21:38,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:21:38,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test10-1.i that has 6 procedures, 2661 locations, 1 initial locations, 84 loop locations, and 986 error locations. [2024-11-28 04:21:38,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:21:38,302 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;@bda5c40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:21:38,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-11-28 04:21:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 2651 states, 1653 states have (on average 1.9770114942528736) internal successors, (3268), 2637 states have internal predecessors, (3268), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-28 04:21:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:21:38,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:38,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:21:38,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:38,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-28 04:21:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815338699] [2024-11-28 04:21:38,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:38,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:38,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815338699] [2024-11-28 04:21:38,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815338699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:38,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:38,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:38,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791246921] [2024-11-28 04:21:38,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:38,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:38,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:38,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:38,611 INFO L87 Difference]: Start difference. First operand has 2651 states, 1653 states have (on average 1.9770114942528736) internal successors, (3268), 2637 states have internal predecessors, (3268), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:41,160 INFO L93 Difference]: Finished difference Result 3237 states and 3808 transitions. [2024-11-28 04:21:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:41,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-28 04:21:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:41,199 INFO L225 Difference]: With dead ends: 3237 [2024-11-28 04:21:41,199 INFO L226 Difference]: Without dead ends: 3235 [2024-11-28 04:21:41,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:41,204 INFO L435 NwaCegarLoop]: 2198 mSDtfsCounter, 2870 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:41,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2880 Valid, 2735 Invalid, 1304 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 04:21:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2024-11-28 04:21:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 2888. [2024-11-28 04:21:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 1918 states have (on average 1.8665276329509906) internal successors, (3580), 2872 states have internal predecessors, (3580), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 04:21:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3612 transitions. [2024-11-28 04:21:41,428 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3612 transitions. Word has length 3 [2024-11-28 04:21:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:41,428 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 3612 transitions. [2024-11-28 04:21:41,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3612 transitions. [2024-11-28 04:21:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:21:41,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:41,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:21:41,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:21:41,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:41,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:41,430 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-28 04:21:41,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:41,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837214136] [2024-11-28 04:21:41,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:41,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:41,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837214136] [2024-11-28 04:21:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837214136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:41,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:41,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903182224] [2024-11-28 04:21:41,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:41,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:41,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:41,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:41,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:41,581 INFO L87 Difference]: Start difference. First operand 2888 states and 3612 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:45,063 INFO L93 Difference]: Finished difference Result 4958 states and 6135 transitions. [2024-11-28 04:21:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-28 04:21:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:45,094 INFO L225 Difference]: With dead ends: 4958 [2024-11-28 04:21:45,094 INFO L226 Difference]: Without dead ends: 4958 [2024-11-28 04:21:45,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:45,096 INFO L435 NwaCegarLoop]: 2400 mSDtfsCounter, 2503 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2510 SdHoareTripleChecker+Valid, 4509 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:45,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2510 Valid, 4509 Invalid, 1705 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-28 04:21:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2024-11-28 04:21:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4282. [2024-11-28 04:21:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4282 states, 3310 states have (on average 1.8347432024169184) internal successors, (6073), 4259 states have internal predecessors, (6073), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4282 states to 4282 states and 6119 transitions. [2024-11-28 04:21:45,280 INFO L78 Accepts]: Start accepts. Automaton has 4282 states and 6119 transitions. Word has length 3 [2024-11-28 04:21:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:45,280 INFO L471 AbstractCegarLoop]: Abstraction has 4282 states and 6119 transitions. [2024-11-28 04:21:45,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4282 states and 6119 transitions. [2024-11-28 04:21:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:21:45,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:45,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:21:45,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:45,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1567526949, now seen corresponding path program 1 times [2024-11-28 04:21:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:45,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789301887] [2024-11-28 04:21:45,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:45,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789301887] [2024-11-28 04:21:45,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789301887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:45,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:45,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:45,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348676332] [2024-11-28 04:21:45,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:45,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:45,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:45,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:45,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:45,473 INFO L87 Difference]: Start difference. First operand 4282 states and 6119 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:47,859 INFO L93 Difference]: Finished difference Result 5367 states and 7441 transitions. [2024-11-28 04:21:47,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:47,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 04:21:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:47,881 INFO L225 Difference]: With dead ends: 5367 [2024-11-28 04:21:47,882 INFO L226 Difference]: Without dead ends: 5367 [2024-11-28 04:21:47,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:47,883 INFO L435 NwaCegarLoop]: 3530 mSDtfsCounter, 2841 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 4700 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:47,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2851 Valid, 4700 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 04:21:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2024-11-28 04:21:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 4190. [2024-11-28 04:21:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 3310 states have (on average 1.786404833836858) internal successors, (5913), 4167 states have internal predecessors, (5913), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 5959 transitions. [2024-11-28 04:21:48,090 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 5959 transitions. Word has length 9 [2024-11-28 04:21:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:48,091 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 5959 transitions. [2024-11-28 04:21:48,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 5959 transitions. [2024-11-28 04:21:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:21:48,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:48,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:48,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:21:48,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:48,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1567526950, now seen corresponding path program 1 times [2024-11-28 04:21:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:48,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538526389] [2024-11-28 04:21:48,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:48,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538526389] [2024-11-28 04:21:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538526389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:48,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219993040] [2024-11-28 04:21:48,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:48,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:48,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:48,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:48,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:48,334 INFO L87 Difference]: Start difference. First operand 4190 states and 5959 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:50,909 INFO L93 Difference]: Finished difference Result 6927 states and 9910 transitions. [2024-11-28 04:21:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 04:21:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:50,938 INFO L225 Difference]: With dead ends: 6927 [2024-11-28 04:21:50,939 INFO L226 Difference]: Without dead ends: 6927 [2024-11-28 04:21:50,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:50,940 INFO L435 NwaCegarLoop]: 3886 mSDtfsCounter, 2320 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 5665 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:50,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 5665 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 04:21:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6927 states. [2024-11-28 04:21:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6927 to 4722. [2024-11-28 04:21:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 3852 states have (on average 1.7801142263759087) internal successors, (6857), 4699 states have internal predecessors, (6857), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 6903 transitions. [2024-11-28 04:21:51,073 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 6903 transitions. Word has length 9 [2024-11-28 04:21:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:51,073 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 6903 transitions. [2024-11-28 04:21:51,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 6903 transitions. [2024-11-28 04:21:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:21:51,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:51,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:51,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:21:51,078 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:51,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1797781972, now seen corresponding path program 1 times [2024-11-28 04:21:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691463920] [2024-11-28 04:21:51,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:51,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691463920] [2024-11-28 04:21:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691463920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:51,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:51,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:21:51,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855675810] [2024-11-28 04:21:51,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:51,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:21:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:51,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:21:51,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:21:51,255 INFO L87 Difference]: Start difference. First operand 4722 states and 6903 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:51,643 INFO L93 Difference]: Finished difference Result 6560 states and 9346 transitions. [2024-11-28 04:21:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:21:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 04:21:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:51,683 INFO L225 Difference]: With dead ends: 6560 [2024-11-28 04:21:51,684 INFO L226 Difference]: Without dead ends: 6560 [2024-11-28 04:21:51,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:21:51,687 INFO L435 NwaCegarLoop]: 3443 mSDtfsCounter, 1450 mSDsluCounter, 6292 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 9735 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:51,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 9735 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:21:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2024-11-28 04:21:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 4724. [2024-11-28 04:21:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4724 states, 3854 states have (on average 1.7797093928386092) internal successors, (6859), 4701 states have internal predecessors, (6859), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 6905 transitions. [2024-11-28 04:21:51,808 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 6905 transitions. Word has length 11 [2024-11-28 04:21:51,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:51,809 INFO L471 AbstractCegarLoop]: Abstraction has 4724 states and 6905 transitions. [2024-11-28 04:21:51,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 6905 transitions. [2024-11-28 04:21:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 04:21:51,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:51,810 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] [2024-11-28 04:21:51,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:21:51,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:51,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash 494071061, now seen corresponding path program 1 times [2024-11-28 04:21:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:51,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725512204] [2024-11-28 04:21:51,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725512204] [2024-11-28 04:21:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725512204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:52,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:21:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914696692] [2024-11-28 04:21:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:52,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:21:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:52,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:21:52,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:21:52,085 INFO L87 Difference]: Start difference. First operand 4724 states and 6905 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:52,487 INFO L93 Difference]: Finished difference Result 6560 states and 9345 transitions. [2024-11-28 04:21:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:21:52,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-28 04:21:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:52,522 INFO L225 Difference]: With dead ends: 6560 [2024-11-28 04:21:52,522 INFO L226 Difference]: Without dead ends: 6560 [2024-11-28 04:21:52,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:21:52,525 INFO L435 NwaCegarLoop]: 2984 mSDtfsCounter, 1438 mSDsluCounter, 5833 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 8817 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:52,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 8817 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:21:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2024-11-28 04:21:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 4735. [2024-11-28 04:21:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 3865 states have (on average 1.777490297542044) internal successors, (6870), 4712 states have internal predecessors, (6870), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 6916 transitions. [2024-11-28 04:21:52,646 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 6916 transitions. Word has length 21 [2024-11-28 04:21:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:52,647 INFO L471 AbstractCegarLoop]: Abstraction has 4735 states and 6916 transitions. [2024-11-28 04:21:52,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 6916 transitions. [2024-11-28 04:21:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 04:21:52,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:52,648 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] [2024-11-28 04:21:52,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:21:52,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:52,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2007176747, now seen corresponding path program 1 times [2024-11-28 04:21:52,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:52,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446712288] [2024-11-28 04:21:52,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:52,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:52,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:52,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446712288] [2024-11-28 04:21:52,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446712288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:52,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:52,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:21:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480621129] [2024-11-28 04:21:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:52,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:21:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:52,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:21:52,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:21:52,768 INFO L87 Difference]: Start difference. First operand 4735 states and 6916 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:54,762 INFO L93 Difference]: Finished difference Result 4810 states and 7022 transitions. [2024-11-28 04:21:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:21:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-28 04:21:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:54,775 INFO L225 Difference]: With dead ends: 4810 [2024-11-28 04:21:54,775 INFO L226 Difference]: Without dead ends: 4810 [2024-11-28 04:21:54,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:21:54,776 INFO L435 NwaCegarLoop]: 2027 mSDtfsCounter, 3104 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3114 SdHoareTripleChecker+Valid, 3930 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:54,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3114 Valid, 3930 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 04:21:54,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2024-11-28 04:21:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4712. [2024-11-28 04:21:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 3865 states have (on average 1.765588615782665) internal successors, (6824), 4689 states have internal predecessors, (6824), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6870 transitions. [2024-11-28 04:21:54,852 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6870 transitions. Word has length 21 [2024-11-28 04:21:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:54,852 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 6870 transitions. [2024-11-28 04:21:54,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6870 transitions. [2024-11-28 04:21:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 04:21:54,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:54,853 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] [2024-11-28 04:21:54,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:21:54,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:54,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2007176746, now seen corresponding path program 1 times [2024-11-28 04:21:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001300909] [2024-11-28 04:21:54,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001300909] [2024-11-28 04:21:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001300909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:54,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:21:54,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340299477] [2024-11-28 04:21:54,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:54,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:54,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:54,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:54,943 INFO L87 Difference]: Start difference. First operand 4712 states and 6870 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:54,997 INFO L93 Difference]: Finished difference Result 4574 states and 6664 transitions. [2024-11-28 04:21:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:54,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-28 04:21:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:55,010 INFO L225 Difference]: With dead ends: 4574 [2024-11-28 04:21:55,010 INFO L226 Difference]: Without dead ends: 4574 [2024-11-28 04:21:55,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:55,011 INFO L435 NwaCegarLoop]: 2857 mSDtfsCounter, 61 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5661 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:55,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5661 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:21:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2024-11-28 04:21:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2024-11-28 04:21:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 3739 states have (on average 1.7699919764642953) internal successors, (6618), 4551 states have internal predecessors, (6618), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6664 transitions. [2024-11-28 04:21:55,082 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6664 transitions. Word has length 21 [2024-11-28 04:21:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:55,082 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 6664 transitions. [2024-11-28 04:21:55,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6664 transitions. [2024-11-28 04:21:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 04:21:55,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:55,083 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] [2024-11-28 04:21:55,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:21:55,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:55,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -456258833, now seen corresponding path program 1 times [2024-11-28 04:21:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:55,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594043646] [2024-11-28 04:21:55,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:55,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594043646] [2024-11-28 04:21:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594043646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:55,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:55,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:21:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077593060] [2024-11-28 04:21:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:55,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:21:55,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:55,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:21:55,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:21:55,168 INFO L87 Difference]: Start difference. First operand 4574 states and 6664 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:55,261 INFO L93 Difference]: Finished difference Result 4545 states and 6614 transitions. [2024-11-28 04:21:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:21:55,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-28 04:21:55,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:55,274 INFO L225 Difference]: With dead ends: 4545 [2024-11-28 04:21:55,274 INFO L226 Difference]: Without dead ends: 4545 [2024-11-28 04:21:55,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:21:55,275 INFO L435 NwaCegarLoop]: 2822 mSDtfsCounter, 41 mSDsluCounter, 5616 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8438 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.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:55,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8438 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:21:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2024-11-28 04:21:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4539. [2024-11-28 04:21:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4539 states, 3711 states have (on average 1.7682565346267853) internal successors, (6562), 4516 states have internal predecessors, (6562), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 6608 transitions. [2024-11-28 04:21:55,373 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 6608 transitions. Word has length 23 [2024-11-28 04:21:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:55,373 INFO L471 AbstractCegarLoop]: Abstraction has 4539 states and 6608 transitions. [2024-11-28 04:21:55,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 6608 transitions. [2024-11-28 04:21:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 04:21:55,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:55,374 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] [2024-11-28 04:21:55,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:21:55,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:55,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1116825789, now seen corresponding path program 1 times [2024-11-28 04:21:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:55,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984755779] [2024-11-28 04:21:55,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:55,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:55,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984755779] [2024-11-28 04:21:55,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984755779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:21:55,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621941952] [2024-11-28 04:21:55,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:55,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:21:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:55,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:21:55,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:21:55,642 INFO L87 Difference]: Start difference. First operand 4539 states and 6608 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:57,811 INFO L93 Difference]: Finished difference Result 6838 states and 9759 transitions. [2024-11-28 04:21:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:21:57,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-28 04:21:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:57,831 INFO L225 Difference]: With dead ends: 6838 [2024-11-28 04:21:57,831 INFO L226 Difference]: Without dead ends: 6838 [2024-11-28 04:21:57,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:21:57,833 INFO L435 NwaCegarLoop]: 2293 mSDtfsCounter, 2319 mSDsluCounter, 3652 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 5945 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:57,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 5945 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 04:21:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2024-11-28 04:21:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 4535. [2024-11-28 04:21:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 3711 states have (on average 1.7661007814605227) internal successors, (6554), 4512 states have internal predecessors, (6554), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6600 transitions. [2024-11-28 04:21:57,914 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6600 transitions. Word has length 37 [2024-11-28 04:21:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:57,914 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6600 transitions. [2024-11-28 04:21:57,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6600 transitions. [2024-11-28 04:21:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 04:21:57,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:57,919 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-28 04:21:57,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:21:57,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:57,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1260687181, now seen corresponding path program 1 times [2024-11-28 04:21:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537775862] [2024-11-28 04:21:57,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:58,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:58,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537775862] [2024-11-28 04:21:58,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537775862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:58,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:58,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:21:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053684134] [2024-11-28 04:21:58,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:58,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:21:58,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:58,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:21:58,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:21:58,117 INFO L87 Difference]: Start difference. First operand 4535 states and 6600 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-28 04:21:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:58,198 INFO L93 Difference]: Finished difference Result 4535 states and 6592 transitions. [2024-11-28 04:21:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:21:58,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-28 04:21:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:58,209 INFO L225 Difference]: With dead ends: 4535 [2024-11-28 04:21:58,209 INFO L226 Difference]: Without dead ends: 4535 [2024-11-28 04:21:58,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:21:58,210 INFO L435 NwaCegarLoop]: 2817 mSDtfsCounter, 21 mSDsluCounter, 5603 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8420 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-28 04:21:58,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8420 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:21:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2024-11-28 04:21:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4535. [2024-11-28 04:21:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 3711 states have (on average 1.7639450282942604) internal successors, (6546), 4512 states have internal predecessors, (6546), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-28 04:21:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6592 transitions. [2024-11-28 04:21:58,273 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6592 transitions. Word has length 71 [2024-11-28 04:21:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:58,274 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6592 transitions. [2024-11-28 04:21:58,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-28 04:21:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6592 transitions. [2024-11-28 04:21:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-28 04:21:58,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:58,277 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-28 04:21:58,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:21:58,277 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:58,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1330640513, now seen corresponding path program 1 times [2024-11-28 04:21:58,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:58,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676186483] [2024-11-28 04:21:58,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:58,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:58,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676186483] [2024-11-28 04:21:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676186483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:58,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:58,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:21:58,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98103807] [2024-11-28 04:21:58,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:58,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:58,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:58,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:58,537 INFO L87 Difference]: Start difference. First operand 4535 states and 6592 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-28 04:21:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:58,653 INFO L93 Difference]: Finished difference Result 6039 states and 8771 transitions. [2024-11-28 04:21:58,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:58,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-28 04:21:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:58,671 INFO L225 Difference]: With dead ends: 6039 [2024-11-28 04:21:58,672 INFO L226 Difference]: Without dead ends: 6039 [2024-11-28 04:21:58,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:58,673 INFO L435 NwaCegarLoop]: 2836 mSDtfsCounter, 1083 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 5606 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:58,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 5606 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:21:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2024-11-28 04:21:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 5388. [2024-11-28 04:21:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5388 states, 4560 states have (on average 1.7464912280701754) internal successors, (7964), 5361 states have internal predecessors, (7964), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:21:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5388 states to 5388 states and 8018 transitions. [2024-11-28 04:21:58,753 INFO L78 Accepts]: Start accepts. Automaton has 5388 states and 8018 transitions. Word has length 79 [2024-11-28 04:21:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:58,754 INFO L471 AbstractCegarLoop]: Abstraction has 5388 states and 8018 transitions. [2024-11-28 04:21:58,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-28 04:21:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5388 states and 8018 transitions. [2024-11-28 04:21:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-28 04:21:58,757 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:58,757 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] [2024-11-28 04:21:58,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:21:58,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:21:58,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1327628103, now seen corresponding path program 1 times [2024-11-28 04:21:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408136819] [2024-11-28 04:21:58,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:59,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:59,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408136819] [2024-11-28 04:21:59,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408136819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:59,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:59,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:21:59,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915835776] [2024-11-28 04:21:59,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:59,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:21:59,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:59,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:21:59,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:21:59,404 INFO L87 Difference]: Start difference. First operand 5388 states and 8018 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:01,642 INFO L93 Difference]: Finished difference Result 5304 states and 7876 transitions. [2024-11-28 04:22:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:22:01,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 82 [2024-11-28 04:22:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:01,655 INFO L225 Difference]: With dead ends: 5304 [2024-11-28 04:22:01,655 INFO L226 Difference]: Without dead ends: 5304 [2024-11-28 04:22:01,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:22:01,656 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 2658 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2668 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:01,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2668 Valid, 3109 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 04:22:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5304 states. [2024-11-28 04:22:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 4762. [2024-11-28 04:22:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4762 states, 4018 states have (on average 1.70681931309109) internal successors, (6858), 4735 states have internal predecessors, (6858), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:22:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4762 states to 4762 states and 6912 transitions. [2024-11-28 04:22:01,723 INFO L78 Accepts]: Start accepts. Automaton has 4762 states and 6912 transitions. Word has length 82 [2024-11-28 04:22:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:01,724 INFO L471 AbstractCegarLoop]: Abstraction has 4762 states and 6912 transitions. [2024-11-28 04:22:01,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4762 states and 6912 transitions. [2024-11-28 04:22:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 04:22:01,726 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:01,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:01,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:22:01,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:01,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:01,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1108578542, now seen corresponding path program 1 times [2024-11-28 04:22:01,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:01,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446001660] [2024-11-28 04:22:01,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:01,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:02,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-28 04:22:02,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446001660] [2024-11-28 04:22:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446001660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:22:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:22:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:22:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068727809] [2024-11-28 04:22:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:22:02,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:22:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:02,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:22:02,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:22:02,078 INFO L87 Difference]: Start difference. First operand 4762 states and 6912 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:03,797 INFO L93 Difference]: Finished difference Result 4761 states and 6910 transitions. [2024-11-28 04:22:03,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:22:03,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2024-11-28 04:22:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:03,808 INFO L225 Difference]: With dead ends: 4761 [2024-11-28 04:22:03,808 INFO L226 Difference]: Without dead ends: 4761 [2024-11-28 04:22:03,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:22:03,809 INFO L435 NwaCegarLoop]: 2744 mSDtfsCounter, 2 mSDsluCounter, 5747 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8491 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:03,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8491 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 04:22:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2024-11-28 04:22:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4761. [2024-11-28 04:22:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4018 states have (on average 1.7063215530114484) internal successors, (6856), 4734 states have internal predecessors, (6856), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:22:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6910 transitions. [2024-11-28 04:22:03,876 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6910 transitions. Word has length 87 [2024-11-28 04:22:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:03,877 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 6910 transitions. [2024-11-28 04:22:03,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6910 transitions. [2024-11-28 04:22:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 04:22:03,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:03,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:03,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:22:03,881 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:03,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:03,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1108578541, now seen corresponding path program 1 times [2024-11-28 04:22:03,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:03,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640533589] [2024-11-28 04:22:03,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:04,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:04,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:04,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640533589] [2024-11-28 04:22:04,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640533589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:22:04,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:22:04,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:22:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026703779] [2024-11-28 04:22:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:22:04,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:22:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:04,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:22:04,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:22:04,505 INFO L87 Difference]: Start difference. First operand 4761 states and 6910 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:06,765 INFO L93 Difference]: Finished difference Result 4760 states and 6908 transitions. [2024-11-28 04:22:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:22:06,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2024-11-28 04:22:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:06,774 INFO L225 Difference]: With dead ends: 4760 [2024-11-28 04:22:06,774 INFO L226 Difference]: Without dead ends: 4760 [2024-11-28 04:22:06,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:22:06,777 INFO L435 NwaCegarLoop]: 2744 mSDtfsCounter, 1 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8465 SdHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:06,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8465 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 04:22:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2024-11-28 04:22:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 4760. [2024-11-28 04:22:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4016 states have (on average 1.7066733067729083) internal successors, (6854), 4733 states have internal predecessors, (6854), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:22:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 6908 transitions. [2024-11-28 04:22:06,842 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 6908 transitions. Word has length 87 [2024-11-28 04:22:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:06,843 INFO L471 AbstractCegarLoop]: Abstraction has 4760 states and 6908 transitions. [2024-11-28 04:22:06,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 6908 transitions. [2024-11-28 04:22:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 04:22:06,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:06,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:06,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:22:06,845 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:06,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1806705785, now seen corresponding path program 1 times [2024-11-28 04:22:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:06,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937167245] [2024-11-28 04:22:06,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:07,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:07,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937167245] [2024-11-28 04:22:07,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937167245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:22:07,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:22:07,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:22:07,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094670098] [2024-11-28 04:22:07,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:22:07,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:22:07,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:07,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:22:07,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:22:07,208 INFO L87 Difference]: Start difference. First operand 4760 states and 6908 transitions. Second operand has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:09,270 INFO L93 Difference]: Finished difference Result 4778 states and 6941 transitions. [2024-11-28 04:22:09,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:22:09,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-28 04:22:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:09,284 INFO L225 Difference]: With dead ends: 4778 [2024-11-28 04:22:09,284 INFO L226 Difference]: Without dead ends: 4778 [2024-11-28 04:22:09,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:22:09,285 INFO L435 NwaCegarLoop]: 2708 mSDtfsCounter, 27 mSDsluCounter, 8674 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 11382 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:09,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 11382 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 04:22:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2024-11-28 04:22:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4769. [2024-11-28 04:22:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4769 states, 4024 states have (on average 1.706013916500994) internal successors, (6865), 4740 states have internal predecessors, (6865), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-28 04:22:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 6931 transitions. [2024-11-28 04:22:09,359 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 6931 transitions. Word has length 95 [2024-11-28 04:22:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:09,359 INFO L471 AbstractCegarLoop]: Abstraction has 4769 states and 6931 transitions. [2024-11-28 04:22:09,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 6931 transitions. [2024-11-28 04:22:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 04:22:09,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:09,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:09,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:22:09,361 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1806705786, now seen corresponding path program 1 times [2024-11-28 04:22:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787730552] [2024-11-28 04:22:09,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787730552] [2024-11-28 04:22:10,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787730552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:22:10,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:22:10,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:22:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331469309] [2024-11-28 04:22:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:22:10,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:22:10,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:10,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:22:10,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:22:10,012 INFO L87 Difference]: Start difference. First operand 4769 states and 6931 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:12,406 INFO L93 Difference]: Finished difference Result 4769 states and 6929 transitions. [2024-11-28 04:22:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:22:12,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-28 04:22:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:12,417 INFO L225 Difference]: With dead ends: 4769 [2024-11-28 04:22:12,417 INFO L226 Difference]: Without dead ends: 4769 [2024-11-28 04:22:12,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:22:12,418 INFO L435 NwaCegarLoop]: 2715 mSDtfsCounter, 22 mSDsluCounter, 8085 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10800 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:12,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10800 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 04:22:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2024-11-28 04:22:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4769. [2024-11-28 04:22:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4769 states, 4024 states have (on average 1.70551689860835) internal successors, (6863), 4740 states have internal predecessors, (6863), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-28 04:22:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 6929 transitions. [2024-11-28 04:22:12,487 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 6929 transitions. Word has length 95 [2024-11-28 04:22:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:12,487 INFO L471 AbstractCegarLoop]: Abstraction has 4769 states and 6929 transitions. [2024-11-28 04:22:12,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 6929 transitions. [2024-11-28 04:22:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 04:22:12,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:12,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:12,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:22:12,489 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:12,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1922986770, now seen corresponding path program 1 times [2024-11-28 04:22:12,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:12,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097584714] [2024-11-28 04:22:12,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:12,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:13,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:13,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097584714] [2024-11-28 04:22:13,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097584714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:22:13,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422979379] [2024-11-28 04:22:13,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:13,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:22:13,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:22:13,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:22:13,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:22:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:13,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 04:22:13,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:22:13,632 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:22:13,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:22:13,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:22:13,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:22:13,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:22:13,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:22:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:13,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:22:13,840 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 04:22:13,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 04:22:13,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-28 04:22:13,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422979379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:22:13,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:22:13,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-11-28 04:22:13,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848049691] [2024-11-28 04:22:13,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:22:13,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:22:13,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:13,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:22:13,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-28 04:22:13,853 INFO L87 Difference]: Start difference. First operand 4769 states and 6929 transitions. Second operand has 14 states, 12 states have (on average 9.083333333333334) internal successors, (109), 13 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:22:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:17,866 INFO L93 Difference]: Finished difference Result 4768 states and 6927 transitions. [2024-11-28 04:22:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:22:17,867 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.083333333333334) internal successors, (109), 13 states have internal predecessors, (109), 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 96 [2024-11-28 04:22:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:17,876 INFO L225 Difference]: With dead ends: 4768 [2024-11-28 04:22:17,876 INFO L226 Difference]: Without dead ends: 4768 [2024-11-28 04:22:17,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-28 04:22:17,877 INFO L435 NwaCegarLoop]: 1894 mSDtfsCounter, 2684 mSDsluCounter, 13104 mSDsCounter, 0 mSdLazyCounter, 6965 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 14998 SdHoareTripleChecker+Invalid, 6990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:17,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2702 Valid, 14998 Invalid, 6990 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 6965 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-28 04:22:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2024-11-28 04:22:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4768. [2024-11-28 04:22:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4768 states, 4024 states have (on average 1.7050198807157058) internal successors, (6861), 4739 states have internal predecessors, (6861), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-28 04:22:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 6927 transitions. [2024-11-28 04:22:17,951 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 6927 transitions. Word has length 96 [2024-11-28 04:22:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:17,951 INFO L471 AbstractCegarLoop]: Abstraction has 4768 states and 6927 transitions. [2024-11-28 04:22:17,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.083333333333334) internal successors, (109), 13 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:22:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 6927 transitions. [2024-11-28 04:22:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 04:22:17,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:17,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:17,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:22:18,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 04:22:18,155 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:18,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1922986771, now seen corresponding path program 1 times [2024-11-28 04:22:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:18,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827045503] [2024-11-28 04:22:18,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:19,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827045503] [2024-11-28 04:22:19,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827045503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:22:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317424283] [2024-11-28 04:22:19,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:19,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:22:19,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:22:19,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:22:19,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:22:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:19,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 04:22:19,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:22:19,553 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:22:19,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:22:19,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:22:19,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:22:19,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:22:19,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:22:19,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:22:19,914 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:22:19,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:22:19,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:22:19,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:22:19,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:22:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:20,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:22:20,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_805 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:22:20,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317424283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:22:20,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:22:20,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-11-28 04:22:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622277169] [2024-11-28 04:22:20,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:22:20,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:22:20,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:20,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:22:20,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-28 04:22:20,148 INFO L87 Difference]: Start difference. First operand 4768 states and 6927 transitions. Second operand has 18 states, 15 states have (on average 8.066666666666666) internal successors, (121), 18 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:22:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:27,022 INFO L93 Difference]: Finished difference Result 4775 states and 6933 transitions. [2024-11-28 04:22:27,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:22:27,022 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.066666666666666) internal successors, (121), 18 states have internal predecessors, (121), 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 96 [2024-11-28 04:22:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:27,029 INFO L225 Difference]: With dead ends: 4775 [2024-11-28 04:22:27,029 INFO L226 Difference]: Without dead ends: 4775 [2024-11-28 04:22:27,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-28 04:22:27,030 INFO L435 NwaCegarLoop]: 1899 mSDtfsCounter, 2677 mSDsluCounter, 14628 mSDsCounter, 0 mSdLazyCounter, 10927 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2695 SdHoareTripleChecker+Valid, 16527 SdHoareTripleChecker+Invalid, 10974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 10927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:27,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2695 Valid, 16527 Invalid, 10974 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 10927 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-28 04:22:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-28 04:22:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4763. [2024-11-28 04:22:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4763 states, 4020 states have (on average 1.705223880597015) internal successors, (6855), 4735 states have internal predecessors, (6855), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:22:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 6909 transitions. [2024-11-28 04:22:27,088 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 6909 transitions. Word has length 96 [2024-11-28 04:22:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:27,088 INFO L471 AbstractCegarLoop]: Abstraction has 4763 states and 6909 transitions. [2024-11-28 04:22:27,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.066666666666666) internal successors, (121), 18 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:22:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 6909 transitions. [2024-11-28 04:22:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 04:22:27,090 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:27,090 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] [2024-11-28 04:22:27,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:22:27,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:22:27,294 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:27,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:27,295 INFO L85 PathProgramCache]: Analyzing trace with hash -957441234, now seen corresponding path program 1 times [2024-11-28 04:22:27,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:27,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962514038] [2024-11-28 04:22:27,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:27,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:27,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962514038] [2024-11-28 04:22:27,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962514038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:22:27,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:22:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 04:22:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211731101] [2024-11-28 04:22:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:22:27,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:22:27,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:27,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:22:27,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:22:27,960 INFO L87 Difference]: Start difference. First operand 4763 states and 6909 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:32,417 INFO L93 Difference]: Finished difference Result 4782 states and 6941 transitions. [2024-11-28 04:22:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:22:32,417 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 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 98 [2024-11-28 04:22:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:32,425 INFO L225 Difference]: With dead ends: 4782 [2024-11-28 04:22:32,425 INFO L226 Difference]: Without dead ends: 4782 [2024-11-28 04:22:32,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:22:32,425 INFO L435 NwaCegarLoop]: 1893 mSDtfsCounter, 2664 mSDsluCounter, 14948 mSDsCounter, 0 mSdLazyCounter, 7890 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 16841 SdHoareTripleChecker+Invalid, 7913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:32,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 16841 Invalid, 7913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 7890 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 04:22:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2024-11-28 04:22:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4778. [2024-11-28 04:22:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4778 states, 4034 states have (on average 1.7035200793257312) internal successors, (6872), 4748 states have internal predecessors, (6872), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:22:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6928 transitions. [2024-11-28 04:22:32,492 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6928 transitions. Word has length 98 [2024-11-28 04:22:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:32,493 INFO L471 AbstractCegarLoop]: Abstraction has 4778 states and 6928 transitions. [2024-11-28 04:22:32,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6928 transitions. [2024-11-28 04:22:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 04:22:32,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:32,494 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] [2024-11-28 04:22:32,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:22:32,495 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:32,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash -957441233, now seen corresponding path program 1 times [2024-11-28 04:22:32,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499597569] [2024-11-28 04:22:32,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499597569] [2024-11-28 04:22:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499597569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:22:33,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:22:33,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:22:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833378997] [2024-11-28 04:22:33,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:22:33,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:22:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:33,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:22:33,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:22:33,524 INFO L87 Difference]: Start difference. First operand 4778 states and 6928 transitions. Second operand has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:37,904 INFO L93 Difference]: Finished difference Result 4781 states and 6939 transitions. [2024-11-28 04:22:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:22:37,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 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 98 [2024-11-28 04:22:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:37,913 INFO L225 Difference]: With dead ends: 4781 [2024-11-28 04:22:37,913 INFO L226 Difference]: Without dead ends: 4781 [2024-11-28 04:22:37,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:22:37,914 INFO L435 NwaCegarLoop]: 1900 mSDtfsCounter, 2663 mSDsluCounter, 10112 mSDsCounter, 0 mSdLazyCounter, 7182 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 12012 SdHoareTripleChecker+Invalid, 7204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:37,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 12012 Invalid, 7204 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 7182 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 04:22:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2024-11-28 04:22:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2024-11-28 04:22:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4778 states, 4034 states have (on average 1.7030242935052058) internal successors, (6870), 4748 states have internal predecessors, (6870), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:22:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6926 transitions. [2024-11-28 04:22:37,975 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6926 transitions. Word has length 98 [2024-11-28 04:22:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:37,976 INFO L471 AbstractCegarLoop]: Abstraction has 4778 states and 6926 transitions. [2024-11-28 04:22:37,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6926 transitions. [2024-11-28 04:22:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 04:22:37,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:37,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:37,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 04:22:37,977 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:37,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1425742325, now seen corresponding path program 1 times [2024-11-28 04:22:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:37,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076255745] [2024-11-28 04:22:37,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:37,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076255745] [2024-11-28 04:22:38,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076255745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:22:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435065555] [2024-11-28 04:22:38,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:38,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:22:38,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:22:38,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:22:38,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:22:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:39,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 04:22:39,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:22:39,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:22:39,314 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:22:39,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:22:39,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:22:39,387 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:22:39,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:22:39,443 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:22:39,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:22:39,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:22:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:39,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:22:39,480 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1086) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 04:22:39,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 04:22:39,539 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 04:22:39,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-28 04:22:39,549 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1086 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1089))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-28 04:22:39,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435065555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:22:39,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:22:39,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 04:22:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952503243] [2024-11-28 04:22:39,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:22:39,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:22:39,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:39,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:22:39,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2024-11-28 04:22:39,552 INFO L87 Difference]: Start difference. First operand 4778 states and 6926 transitions. Second operand has 16 states, 14 states have (on average 10.357142857142858) internal successors, (145), 15 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:44,071 INFO L93 Difference]: Finished difference Result 4780 states and 6937 transitions. [2024-11-28 04:22:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:22:44,071 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 10.357142857142858) internal successors, (145), 15 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 04:22:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:44,077 INFO L225 Difference]: With dead ends: 4780 [2024-11-28 04:22:44,078 INFO L226 Difference]: Without dead ends: 4780 [2024-11-28 04:22:44,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2024-11-28 04:22:44,079 INFO L435 NwaCegarLoop]: 1893 mSDtfsCounter, 2644 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 8717 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 18724 SdHoareTripleChecker+Invalid, 8740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:44,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 18724 Invalid, 8740 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8717 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-28 04:22:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4780 states. [2024-11-28 04:22:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4780 to 4777. [2024-11-28 04:22:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4777 states, 4034 states have (on average 1.7025285076846801) internal successors, (6868), 4747 states have internal predecessors, (6868), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:22:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 6924 transitions. [2024-11-28 04:22:44,138 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 6924 transitions. Word has length 99 [2024-11-28 04:22:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:44,138 INFO L471 AbstractCegarLoop]: Abstraction has 4777 states and 6924 transitions. [2024-11-28 04:22:44,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 10.357142857142858) internal successors, (145), 15 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:22:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 6924 transitions. [2024-11-28 04:22:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 04:22:44,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:44,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:44,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:22:44,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:22:44,344 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:44,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1425742326, now seen corresponding path program 1 times [2024-11-28 04:22:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495084346] [2024-11-28 04:22:44,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:45,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:45,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495084346] [2024-11-28 04:22:45,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495084346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:22:45,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420470965] [2024-11-28 04:22:45,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:45,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:22:45,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:22:45,540 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:22:45,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:22:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:45,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 04:22:45,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:22:45,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:22:46,011 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:22:46,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:22:46,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:22:46,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:22:46,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:22:46,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:22:46,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:22:46,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:22:46,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:22:46,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-28 04:22:46,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:22:46,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:22:46,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:22:46,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:22:46,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:22:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:46,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:22:46,544 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:22:46,557 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:22:46,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1249))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1248) .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1248) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-28 04:22:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420470965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:22:46,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:22:46,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-28 04:22:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948010418] [2024-11-28 04:22:46,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:22:46,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 04:22:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:46,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 04:22:46,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2024-11-28 04:22:46,627 INFO L87 Difference]: Start difference. First operand 4777 states and 6924 transitions. Second operand has 20 states, 17 states have (on average 9.294117647058824) internal successors, (158), 20 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:22:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:22:55,084 INFO L93 Difference]: Finished difference Result 4779 states and 6935 transitions. [2024-11-28 04:22:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:22:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.294117647058824) internal successors, (158), 20 states have internal predecessors, (158), 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 99 [2024-11-28 04:22:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:22:55,088 INFO L225 Difference]: With dead ends: 4779 [2024-11-28 04:22:55,088 INFO L226 Difference]: Without dead ends: 4779 [2024-11-28 04:22:55,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2024-11-28 04:22:55,089 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2667 mSDsluCounter, 15801 mSDsCounter, 0 mSdLazyCounter, 12491 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 17699 SdHoareTripleChecker+Invalid, 12535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 12491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:22:55,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2685 Valid, 17699 Invalid, 12535 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 12491 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-28 04:22:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2024-11-28 04:22:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4761. [2024-11-28 04:22:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4020 states have (on average 1.704228855721393) internal successors, (6851), 4733 states have internal predecessors, (6851), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:22:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6905 transitions. [2024-11-28 04:22:55,151 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6905 transitions. Word has length 99 [2024-11-28 04:22:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:22:55,151 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 6905 transitions. [2024-11-28 04:22:55,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.294117647058824) internal successors, (158), 20 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:22:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6905 transitions. [2024-11-28 04:22:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 04:22:55,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:22:55,152 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-28 04:22:55,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:22:55,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:22:55,353 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:22:55,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash -253311104, now seen corresponding path program 1 times [2024-11-28 04:22:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:55,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926064817] [2024-11-28 04:22:55,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:22:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:22:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:22:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:56,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926064817] [2024-11-28 04:22:56,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926064817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:22:56,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:22:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 04:22:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383537584] [2024-11-28 04:22:56,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:22:56,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:22:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:56,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:22:56,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:22:56,099 INFO L87 Difference]: Start difference. First operand 4761 states and 6905 transitions. Second operand has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:23:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:23:01,025 INFO L93 Difference]: Finished difference Result 4786 states and 6943 transitions. [2024-11-28 04:23:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:23:01,026 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 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 101 [2024-11-28 04:23:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:23:01,056 INFO L225 Difference]: With dead ends: 4786 [2024-11-28 04:23:01,056 INFO L226 Difference]: Without dead ends: 4786 [2024-11-28 04:23:01,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 04:23:01,057 INFO L435 NwaCegarLoop]: 1892 mSDtfsCounter, 2687 mSDsluCounter, 16846 mSDsCounter, 0 mSdLazyCounter, 8716 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 18738 SdHoareTripleChecker+Invalid, 8740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:23:01,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2705 Valid, 18738 Invalid, 8740 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 8716 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-28 04:23:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-28 04:23:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4782. [2024-11-28 04:23:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4782 states, 4040 states have (on average 1.7014851485148514) internal successors, (6874), 4752 states have internal predecessors, (6874), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:23:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 6930 transitions. [2024-11-28 04:23:01,109 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 6930 transitions. Word has length 101 [2024-11-28 04:23:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:23:01,110 INFO L471 AbstractCegarLoop]: Abstraction has 4782 states and 6930 transitions. [2024-11-28 04:23:01,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:23:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 6930 transitions. [2024-11-28 04:23:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 04:23:01,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:23:01,111 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-28 04:23:01,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 04:23:01,111 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:23:01,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -253311103, now seen corresponding path program 1 times [2024-11-28 04:23:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616265635] [2024-11-28 04:23:01,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:01,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:23:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616265635] [2024-11-28 04:23:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616265635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:23:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:23:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:23:02,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467467284] [2024-11-28 04:23:02,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:23:02,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:23:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:23:02,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:23:02,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:23:02,266 INFO L87 Difference]: Start difference. First operand 4782 states and 6930 transitions. Second operand has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:23:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:23:07,765 INFO L93 Difference]: Finished difference Result 4785 states and 6941 transitions. [2024-11-28 04:23:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:23:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 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 101 [2024-11-28 04:23:07,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:23:07,772 INFO L225 Difference]: With dead ends: 4785 [2024-11-28 04:23:07,772 INFO L226 Difference]: Without dead ends: 4785 [2024-11-28 04:23:07,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:23:07,773 INFO L435 NwaCegarLoop]: 1899 mSDtfsCounter, 2682 mSDsluCounter, 11613 mSDsCounter, 0 mSdLazyCounter, 8366 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2700 SdHoareTripleChecker+Valid, 13512 SdHoareTripleChecker+Invalid, 8388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 8366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:23:07,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2700 Valid, 13512 Invalid, 8388 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 8366 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-28 04:23:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2024-11-28 04:23:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4782. [2024-11-28 04:23:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4782 states, 4040 states have (on average 1.700990099009901) internal successors, (6872), 4752 states have internal predecessors, (6872), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:23:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 6928 transitions. [2024-11-28 04:23:07,835 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 6928 transitions. Word has length 101 [2024-11-28 04:23:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:23:07,836 INFO L471 AbstractCegarLoop]: Abstraction has 4782 states and 6928 transitions. [2024-11-28 04:23:07,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:23:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 6928 transitions. [2024-11-28 04:23:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 04:23:07,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:23:07,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:23:07,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 04:23:07,859 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:23:07,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:07,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1358692185, now seen corresponding path program 1 times [2024-11-28 04:23:07,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:07,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470972543] [2024-11-28 04:23:07,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:07,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:08,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:23:08,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470972543] [2024-11-28 04:23:08,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470972543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:23:08,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125506841] [2024-11-28 04:23:08,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:08,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:23:08,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:23:08,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:23:08,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:23:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:09,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 04:23:09,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:23:09,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:23:09,224 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:23:09,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:23:09,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:23:09,298 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:09,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:23:09,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:09,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:23:09,429 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:09,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:23:09,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:23:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:09,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:23:09,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-28 04:23:09,702 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-28 04:23:09,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-28 04:23:09,712 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem55#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1558))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1554)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1555)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 04:23:09,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125506841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:23:09,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:23:09,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-28 04:23:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223957982] [2024-11-28 04:23:09,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:23:09,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:23:09,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:23:09,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:23:09,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=329, Unknown=29, NotChecked=78, Total=506 [2024-11-28 04:23:09,716 INFO L87 Difference]: Start difference. First operand 4782 states and 6928 transitions. Second operand has 18 states, 16 states have (on average 9.375) internal successors, (150), 17 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:23:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:23:15,052 INFO L93 Difference]: Finished difference Result 4784 states and 6939 transitions. [2024-11-28 04:23:15,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:23:15,053 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 9.375) internal successors, (150), 17 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 04:23:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:23:15,057 INFO L225 Difference]: With dead ends: 4784 [2024-11-28 04:23:15,057 INFO L226 Difference]: Without dead ends: 4784 [2024-11-28 04:23:15,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=647, Unknown=36, NotChecked=110, Total=930 [2024-11-28 04:23:15,058 INFO L435 NwaCegarLoop]: 1892 mSDtfsCounter, 2646 mSDsluCounter, 16824 mSDsCounter, 0 mSdLazyCounter, 8710 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 18716 SdHoareTripleChecker+Invalid, 8733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:23:15,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 18716 Invalid, 8733 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8710 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-28 04:23:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2024-11-28 04:23:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 4781. [2024-11-28 04:23:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4781 states, 4040 states have (on average 1.7004950495049505) internal successors, (6870), 4751 states have internal predecessors, (6870), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:23:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 6926 transitions. [2024-11-28 04:23:15,114 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 6926 transitions. Word has length 102 [2024-11-28 04:23:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:23:15,114 INFO L471 AbstractCegarLoop]: Abstraction has 4781 states and 6926 transitions. [2024-11-28 04:23:15,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 9.375) internal successors, (150), 17 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:23:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 6926 transitions. [2024-11-28 04:23:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 04:23:15,116 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:23:15,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:23:15,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:23:15,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 04:23:15,317 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:23:15,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1358692186, now seen corresponding path program 1 times [2024-11-28 04:23:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:15,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912463302] [2024-11-28 04:23:15,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:16,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:23:16,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912463302] [2024-11-28 04:23:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912463302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:23:16,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881158160] [2024-11-28 04:23:16,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:16,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:23:16,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:23:16,679 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:23:16,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:23:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:17,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 04:23:17,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:23:17,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:23:17,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:23:17,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:23:17,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:23:17,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:23:17,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:23:17,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:23:17,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:23:17,545 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:17,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:23:17,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:23:17,647 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:17,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:23:17,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:23:17,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:17,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:23:17,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:23:17,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:23:17,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:23:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:17,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:23:17,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1725 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:23:17,866 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1725 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:23:17,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1724) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1723))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1724) .cse1 v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 04:23:18,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1732))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1723))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1731) .cse0 v_ArrVal_1724) .cse1 v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1732))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1731) .cse5 v_ArrVal_1724) (select (select (store .cse6 .cse5 v_ArrVal_1723) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1725))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:23:18,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881158160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:23:18,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:23:18,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-11-28 04:23:18,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47614959] [2024-11-28 04:23:18,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:23:18,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 04:23:18,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:23:18,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 04:23:18,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=515, Unknown=7, NotChecked=196, Total=812 [2024-11-28 04:23:18,062 INFO L87 Difference]: Start difference. First operand 4781 states and 6926 transitions. Second operand has 22 states, 19 states have (on average 8.631578947368421) internal successors, (164), 22 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:23:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:23:28,363 INFO L93 Difference]: Finished difference Result 4783 states and 6937 transitions. [2024-11-28 04:23:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:23:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.631578947368421) internal successors, (164), 22 states have internal predecessors, (164), 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 102 [2024-11-28 04:23:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:23:28,367 INFO L225 Difference]: With dead ends: 4783 [2024-11-28 04:23:28,367 INFO L226 Difference]: Without dead ends: 4783 [2024-11-28 04:23:28,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=787, Unknown=7, NotChecked=244, Total=1190 [2024-11-28 04:23:28,368 INFO L435 NwaCegarLoop]: 1897 mSDtfsCounter, 2646 mSDsluCounter, 20683 mSDsCounter, 0 mSdLazyCounter, 15768 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 22580 SdHoareTripleChecker+Invalid, 15795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 15768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:23:28,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 22580 Invalid, 15795 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 15768 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2024-11-28 04:23:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2024-11-28 04:23:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4759. [2024-11-28 04:23:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4020 states have (on average 1.703233830845771) internal successors, (6847), 4731 states have internal predecessors, (6847), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:23:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6901 transitions. [2024-11-28 04:23:28,418 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6901 transitions. Word has length 102 [2024-11-28 04:23:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:23:28,419 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 6901 transitions. [2024-11-28 04:23:28,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.631578947368421) internal successors, (164), 22 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:23:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6901 transitions. [2024-11-28 04:23:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 04:23:28,420 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:23:28,420 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-28 04:23:28,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:23:28,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 04:23:28,621 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:23:28,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash -132874987, now seen corresponding path program 1 times [2024-11-28 04:23:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:28,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584256129] [2024-11-28 04:23:28,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:28,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:29,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:23:29,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584256129] [2024-11-28 04:23:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584256129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:23:29,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:23:29,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 04:23:29,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680609652] [2024-11-28 04:23:29,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:23:29,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:23:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:23:29,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:23:29,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:23:29,279 INFO L87 Difference]: Start difference. First operand 4759 states and 6901 transitions. Second operand has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 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-28 04:23:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:23:33,521 INFO L93 Difference]: Finished difference Result 4790 states and 6945 transitions. [2024-11-28 04:23:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:23:33,522 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 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-28 04:23:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:23:33,528 INFO L225 Difference]: With dead ends: 4790 [2024-11-28 04:23:33,528 INFO L226 Difference]: Without dead ends: 4790 [2024-11-28 04:23:33,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-28 04:23:33,529 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2684 mSDsluCounter, 14939 mSDsCounter, 0 mSdLazyCounter, 7850 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 16830 SdHoareTripleChecker+Invalid, 7873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:23:33,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2702 Valid, 16830 Invalid, 7873 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 7850 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-28 04:23:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2024-11-28 04:23:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 4786. [2024-11-28 04:23:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4786 states, 4046 states have (on average 1.699456253089471) internal successors, (6876), 4756 states have internal predecessors, (6876), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:23:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 6932 transitions. [2024-11-28 04:23:33,590 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 6932 transitions. Word has length 104 [2024-11-28 04:23:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:23:33,591 INFO L471 AbstractCegarLoop]: Abstraction has 4786 states and 6932 transitions. [2024-11-28 04:23:33,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 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-28 04:23:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 6932 transitions. [2024-11-28 04:23:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 04:23:33,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:23:33,592 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-28 04:23:33,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 04:23:33,592 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:23:33,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash -132874986, now seen corresponding path program 1 times [2024-11-28 04:23:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087776601] [2024-11-28 04:23:33,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:34,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:23:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087776601] [2024-11-28 04:23:34,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087776601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:23:34,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:23:34,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 04:23:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424991913] [2024-11-28 04:23:34,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:23:34,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:23:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:23:34,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:23:34,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:23:34,510 INFO L87 Difference]: Start difference. First operand 4786 states and 6932 transitions. Second operand has 13 states, 12 states have (on average 8.5) internal successors, (102), 13 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-28 04:23:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:23:39,395 INFO L93 Difference]: Finished difference Result 4789 states and 6943 transitions. [2024-11-28 04:23:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:23:39,395 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 13 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-28 04:23:39,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:23:39,398 INFO L225 Difference]: With dead ends: 4789 [2024-11-28 04:23:39,399 INFO L226 Difference]: Without dead ends: 4789 [2024-11-28 04:23:39,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:23:39,399 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2665 mSDsluCounter, 9779 mSDsCounter, 0 mSdLazyCounter, 7541 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2683 SdHoareTripleChecker+Valid, 11677 SdHoareTripleChecker+Invalid, 7563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:23:39,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2683 Valid, 11677 Invalid, 7563 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 7541 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-28 04:23:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2024-11-28 04:23:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 4786. [2024-11-28 04:23:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4786 states, 4046 states have (on average 1.698961937716263) internal successors, (6874), 4756 states have internal predecessors, (6874), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:23:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 6930 transitions. [2024-11-28 04:23:39,438 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 6930 transitions. Word has length 104 [2024-11-28 04:23:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:23:39,438 INFO L471 AbstractCegarLoop]: Abstraction has 4786 states and 6930 transitions. [2024-11-28 04:23:39,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 13 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-28 04:23:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 6930 transitions. [2024-11-28 04:23:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 04:23:39,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:23:39,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:23:39,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 04:23:39,440 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:23:39,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:39,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1027771036, now seen corresponding path program 1 times [2024-11-28 04:23:39,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:39,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986095385] [2024-11-28 04:23:39,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:39,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:23:40,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986095385] [2024-11-28 04:23:40,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986095385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:23:40,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957439852] [2024-11-28 04:23:40,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:40,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:23:40,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:23:40,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:23:40,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:23:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:40,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 04:23:40,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:23:40,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:23:40,595 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:23:40,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:23:40,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:23:40,663 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:40,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:23:40,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:40,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:23:40,761 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:40,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:23:40,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:40,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:23:40,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:23:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:40,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:23:40,968 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2062 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 04:23:40,978 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2062 (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$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2061))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2062)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 04:23:40,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2062 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2061))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2062)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 04:23:41,025 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-28 04:23:41,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-28 04:23:41,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957439852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:23:41,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:23:41,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 19 [2024-11-28 04:23:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581401433] [2024-11-28 04:23:41,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:23:41,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 04:23:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:23:41,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 04:23:41,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=434, Unknown=42, NotChecked=138, Total=702 [2024-11-28 04:23:41,095 INFO L87 Difference]: Start difference. First operand 4786 states and 6930 transitions. Second operand has 20 states, 18 states have (on average 8.61111111111111) internal successors, (155), 19 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:23:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:23:46,000 INFO L93 Difference]: Finished difference Result 4788 states and 6941 transitions. [2024-11-28 04:23:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:23:46,000 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.61111111111111) internal successors, (155), 19 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 04:23:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:23:46,005 INFO L225 Difference]: With dead ends: 4788 [2024-11-28 04:23:46,005 INFO L226 Difference]: Without dead ends: 4788 [2024-11-28 04:23:46,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=842, Unknown=58, NotChecked=192, Total=1260 [2024-11-28 04:23:46,006 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2644 mSDsluCounter, 16822 mSDsCounter, 0 mSdLazyCounter, 8760 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 18713 SdHoareTripleChecker+Invalid, 8783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:23:46,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 18713 Invalid, 8783 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8760 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 04:23:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2024-11-28 04:23:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4785. [2024-11-28 04:23:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4785 states, 4046 states have (on average 1.6984676223430548) internal successors, (6872), 4755 states have internal predecessors, (6872), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:23:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 6928 transitions. [2024-11-28 04:23:46,053 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 6928 transitions. Word has length 105 [2024-11-28 04:23:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:23:46,053 INFO L471 AbstractCegarLoop]: Abstraction has 4785 states and 6928 transitions. [2024-11-28 04:23:46,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.61111111111111) internal successors, (155), 19 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:23:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 6928 transitions. [2024-11-28 04:23:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 04:23:46,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:23:46,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:23:46,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 04:23:46,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:23:46,255 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:23:46,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:46,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1027771037, now seen corresponding path program 1 times [2024-11-28 04:23:46,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:46,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527258691] [2024-11-28 04:23:46,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:47,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:23:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527258691] [2024-11-28 04:23:47,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527258691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:23:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12306935] [2024-11-28 04:23:47,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:23:47,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:23:47,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:23:47,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:23:47,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:23:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:23:47,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 04:23:47,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:23:47,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:23:48,078 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:23:48,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:23:48,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:23:48,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:23:48,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:23:48,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:23:48,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:23:48,384 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:48,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:23:48,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:23:48,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:23:48,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2024-11-28 04:23:48,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:23:48,636 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 04:23:48,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 62 [2024-11-28 04:23:48,640 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 5 treesize of output 3 [2024-11-28 04:23:48,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:23:48,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:23:48,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:23:48,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:23:48,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:23:48,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:23:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:23:48,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:23:49,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2245 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2245))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2246 (Array Int Int))) (<= 0 (+ 20 (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_2245 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2245))) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2246 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2246))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse2 .cse3 v_ArrVal_2248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0)))))) is different from false [2024-11-28 04:23:49,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2245 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_2245))) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2246 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_2246))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_2248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ 8 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0)))) (forall ((v_ArrVal_2245 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_2245))) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2246 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_2246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (< (+ 8 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0))))))) is different from false [2024-11-28 04:23:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12306935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:23:50,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:23:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2024-11-28 04:23:50,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198786570] [2024-11-28 04:23:50,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:23:50,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 04:23:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:23:50,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 04:23:50,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=923, Unknown=11, NotChecked=126, Total=1190 [2024-11-28 04:23:50,056 INFO L87 Difference]: Start difference. First operand 4785 states and 6928 transitions. Second operand has 26 states, 23 states have (on average 8.73913043478261) internal successors, (201), 26 states have internal predecessors, (201), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:24:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:24:01,490 INFO L93 Difference]: Finished difference Result 6635 states and 9258 transitions. [2024-11-28 04:24:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:24:01,490 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 8.73913043478261) internal successors, (201), 26 states have internal predecessors, (201), 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 105 [2024-11-28 04:24:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:24:01,496 INFO L225 Difference]: With dead ends: 6635 [2024-11-28 04:24:01,496 INFO L226 Difference]: Without dead ends: 6635 [2024-11-28 04:24:01,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=250, Invalid=1553, Unknown=11, NotChecked=166, Total=1980 [2024-11-28 04:24:01,497 INFO L435 NwaCegarLoop]: 1904 mSDtfsCounter, 7239 mSDsluCounter, 22661 mSDsCounter, 0 mSdLazyCounter, 16208 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7267 SdHoareTripleChecker+Valid, 24565 SdHoareTripleChecker+Invalid, 16271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 16208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:24:01,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7267 Valid, 24565 Invalid, 16271 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 16208 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-28 04:24:01,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6635 states. [2024-11-28 04:24:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6635 to 4757. [2024-11-28 04:24:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4757 states, 4020 states have (on average 1.7022388059701492) internal successors, (6843), 4729 states have internal predecessors, (6843), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:24:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6897 transitions. [2024-11-28 04:24:01,553 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6897 transitions. Word has length 105 [2024-11-28 04:24:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:24:01,553 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 6897 transitions. [2024-11-28 04:24:01,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 8.73913043478261) internal successors, (201), 26 states have internal predecessors, (201), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:24:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6897 transitions. [2024-11-28 04:24:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 04:24:01,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:24:01,554 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] [2024-11-28 04:24:01,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:24:01,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-28 04:24:01,754 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:24:01,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:24:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1308797673, now seen corresponding path program 1 times [2024-11-28 04:24:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:24:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667560189] [2024-11-28 04:24:01,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:24:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:24:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:24:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:24:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:24:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667560189] [2024-11-28 04:24:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667560189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:24:02,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:24:02,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 04:24:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174225663] [2024-11-28 04:24:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:24:02,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:24:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:24:02,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:24:02,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:24:02,596 INFO L87 Difference]: Start difference. First operand 4757 states and 6897 transitions. Second operand has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:24:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:24:09,098 INFO L93 Difference]: Finished difference Result 4796 states and 6949 transitions. [2024-11-28 04:24:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:24:09,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 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 108 [2024-11-28 04:24:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:24:09,104 INFO L225 Difference]: With dead ends: 4796 [2024-11-28 04:24:09,104 INFO L226 Difference]: Without dead ends: 4796 [2024-11-28 04:24:09,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-28 04:24:09,105 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 2692 mSDsluCounter, 22414 mSDsCounter, 0 mSdLazyCounter, 11317 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2710 SdHoareTripleChecker+Valid, 24304 SdHoareTripleChecker+Invalid, 11344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 11317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:24:09,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2710 Valid, 24304 Invalid, 11344 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 11317 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-28 04:24:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2024-11-28 04:24:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 4792. [2024-11-28 04:24:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4792 states, 4054 states have (on average 1.697089294523927) internal successors, (6880), 4762 states have internal predecessors, (6880), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:24:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4792 states to 4792 states and 6936 transitions. [2024-11-28 04:24:09,148 INFO L78 Accepts]: Start accepts. Automaton has 4792 states and 6936 transitions. Word has length 108 [2024-11-28 04:24:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:24:09,148 INFO L471 AbstractCegarLoop]: Abstraction has 4792 states and 6936 transitions. [2024-11-28 04:24:09,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:24:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4792 states and 6936 transitions. [2024-11-28 04:24:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 04:24:09,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:24:09,149 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] [2024-11-28 04:24:09,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 04:24:09,150 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:24:09,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:24:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1308797672, now seen corresponding path program 1 times [2024-11-28 04:24:09,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:24:09,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211613256] [2024-11-28 04:24:09,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:24:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:24:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:24:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:24:10,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:24:10,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211613256] [2024-11-28 04:24:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211613256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:24:10,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:24:10,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 04:24:10,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258977535] [2024-11-28 04:24:10,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:24:10,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:24:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:24:10,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:24:10,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 04:24:10,239 INFO L87 Difference]: Start difference. First operand 4792 states and 6936 transitions. Second operand has 18 states, 16 states have (on average 6.625) internal successors, (106), 17 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:24:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:24:20,239 INFO L93 Difference]: Finished difference Result 4795 states and 6947 transitions. [2024-11-28 04:24:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:24:20,240 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.625) internal successors, (106), 17 states have internal predecessors, (106), 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 108 [2024-11-28 04:24:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:24:20,244 INFO L225 Difference]: With dead ends: 4795 [2024-11-28 04:24:20,244 INFO L226 Difference]: Without dead ends: 4795 [2024-11-28 04:24:20,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 04:24:20,245 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2665 mSDsluCounter, 20950 mSDsCounter, 0 mSdLazyCounter, 15522 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2683 SdHoareTripleChecker+Valid, 22841 SdHoareTripleChecker+Invalid, 15548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 15522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:24:20,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2683 Valid, 22841 Invalid, 15548 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 15522 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-28 04:24:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2024-11-28 04:24:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4792. [2024-11-28 04:24:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4792 states, 4054 states have (on average 1.6965959546127283) internal successors, (6878), 4762 states have internal predecessors, (6878), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:24:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4792 states to 4792 states and 6934 transitions. [2024-11-28 04:24:20,292 INFO L78 Accepts]: Start accepts. Automaton has 4792 states and 6934 transitions. Word has length 108 [2024-11-28 04:24:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:24:20,292 INFO L471 AbstractCegarLoop]: Abstraction has 4792 states and 6934 transitions. [2024-11-28 04:24:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.625) internal successors, (106), 17 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:24:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4792 states and 6934 transitions. [2024-11-28 04:24:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 04:24:20,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:24:20,293 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-28 04:24:20,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 04:24:20,293 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:24:20,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:24:20,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1858815774, now seen corresponding path program 1 times [2024-11-28 04:24:20,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:24:20,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265611384] [2024-11-28 04:24:20,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:24:20,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:24:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:24:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:24:21,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:24:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265611384] [2024-11-28 04:24:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265611384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:24:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74862694] [2024-11-28 04:24:21,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:24:21,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:24:21,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:24:21,030 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:24:21,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:24:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:24:21,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 04:24:21,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:24:21,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:24:21,569 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:24:21,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:24:21,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:24:21,708 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:21,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:24:21,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:21,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:24:21,829 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:21,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:24:21,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:21,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:24:21,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:21,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:24:21,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:24:21,972 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:21,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:24:21,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:24:26,788 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-28 04:24:26,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-28 04:24:26,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2616 (Array Int Int)) (v_ArrVal_2615 (Array Int Int)) (v_ArrVal_2622 (Array Int Int)) (v_ArrVal_2618 (Array Int Int)) (v_ArrVal_2617 (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$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2622))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2615)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2616)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2617)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2618)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-28 04:24:26,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74862694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:24:26,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:24:26,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2024-11-28 04:24:26,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68497436] [2024-11-28 04:24:26,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:24:26,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 04:24:26,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:24:26,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 04:24:26,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=918, Unknown=46, NotChecked=64, Total=1190 [2024-11-28 04:24:26,812 INFO L87 Difference]: Start difference. First operand 4792 states and 6934 transitions. Second operand has 24 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 23 states have internal predecessors, (167), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:24:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:24:32,720 INFO L93 Difference]: Finished difference Result 4794 states and 6945 transitions. [2024-11-28 04:24:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:24:32,721 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 23 states have internal predecessors, (167), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2024-11-28 04:24:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:24:32,725 INFO L225 Difference]: With dead ends: 4794 [2024-11-28 04:24:32,725 INFO L226 Difference]: Without dead ends: 4794 [2024-11-28 04:24:32,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=266, Invalid=1414, Unknown=46, NotChecked=80, Total=1806 [2024-11-28 04:24:32,726 INFO L435 NwaCegarLoop]: 1889 mSDtfsCounter, 2645 mSDsluCounter, 16838 mSDsCounter, 0 mSdLazyCounter, 8771 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 18727 SdHoareTripleChecker+Invalid, 8799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 8771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:24:32,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 18727 Invalid, 8799 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 8771 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-28 04:24:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2024-11-28 04:24:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 4791. [2024-11-28 04:24:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4791 states, 4054 states have (on average 1.6961026147015295) internal successors, (6876), 4761 states have internal predecessors, (6876), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:24:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4791 states to 4791 states and 6932 transitions. [2024-11-28 04:24:32,773 INFO L78 Accepts]: Start accepts. Automaton has 4791 states and 6932 transitions. Word has length 109 [2024-11-28 04:24:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:24:32,774 INFO L471 AbstractCegarLoop]: Abstraction has 4791 states and 6932 transitions. [2024-11-28 04:24:32,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 23 states have internal predecessors, (167), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:24:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4791 states and 6932 transitions. [2024-11-28 04:24:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 04:24:32,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:24:32,775 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-28 04:24:32,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 04:24:32,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-28 04:24:32,975 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:24:32,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:24:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1858815775, now seen corresponding path program 1 times [2024-11-28 04:24:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:24:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020063754] [2024-11-28 04:24:32,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:24:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:24:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:24:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:24:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:24:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020063754] [2024-11-28 04:24:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020063754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:24:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139096097] [2024-11-28 04:24:34,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:24:34,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:24:34,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:24:34,311 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:24:34,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:24:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:24:34,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 04:24:34,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:24:34,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:24:34,867 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:24:34,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:24:34,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:24:34,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:24:34,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:24:35,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:24:35,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:24:35,237 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:35,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:24:35,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:24:35,437 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:35,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:24:35,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:24:35,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:35,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:24:35,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:24:35,766 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:35,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:24:35,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:24:35,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:24:35,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:24:35,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:24:35,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-28 04:24:35,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:24:36,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:24:36,054 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 04:24:36,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-28 04:24:36,070 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:24:36,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:24:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:24:36,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:24:37,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0))) (forall ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2817 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2818))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2817) .cse0 v_ArrVal_2820) (select (select (store .cse1 .cse0 v_ArrVal_2819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2822))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2817 (Array Int Int))) (or (forall ((v_ArrVal_2823 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2818))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2819))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2817) .cse3 v_ArrVal_2820) .cse4 v_ArrVal_2822) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2823) (select (select (store .cse5 .cse4 v_ArrVal_2821) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0)))))) is different from false [2024-11-28 04:24:38,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2816 (Array Int Int)) (v_ArrVal_2815 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2816))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2818))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2815) .cse0 v_ArrVal_2817) .cse1 v_ArrVal_2820) (select (select (store .cse2 .cse1 v_ArrVal_2819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2822))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0)))) (forall ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2816 (Array Int Int)) (v_ArrVal_2815 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0)) (forall ((v_ArrVal_2823 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2816))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2818))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2819))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2815) .cse5 v_ArrVal_2817) .cse6 v_ArrVal_2820) .cse7 v_ArrVal_2822) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2823) (select (select (store .cse8 .cse7 v_ArrVal_2821) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-28 04:24:44,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:24:44,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-28 04:24:45,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_prenex_39))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_41))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_38))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_prenex_37) .cse0 v_prenex_42) .cse1 v_prenex_40) .cse2 v_prenex_34) (select (select (store .cse3 .cse2 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_33))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2829 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2823 Int) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2816 (Array Int Int)) (v_ArrVal_2815 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc62#1.base_7| |c_ULTIMATE.start_main_#t~mem55#1.base|) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2828))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2816))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2818))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2819))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2829) .cse7 v_ArrVal_2815) .cse8 v_ArrVal_2817) .cse9 v_ArrVal_2820) .cse10 v_ArrVal_2822) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2823) (select (select (store .cse11 .cse10 v_ArrVal_2821) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2829 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2823 Int) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2816 (Array Int Int)) (v_ArrVal_2815 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc62#1.base_7| |c_ULTIMATE.start_main_#t~mem55#1.base|) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2828))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_2816))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_2818))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_2819))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2829) .cse15 v_ArrVal_2815) .cse16 v_ArrVal_2817) .cse17 v_ArrVal_2820) .cse18 v_ArrVal_2822) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2823) (select (select (store .cse19 .cse18 v_ArrVal_2821) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-28 04:24:45,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139096097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:24:45,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:24:45,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-28 04:24:45,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702211906] [2024-11-28 04:24:45,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:24:45,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 04:24:45,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:24:45,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 04:24:45,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1423, Unknown=36, NotChecked=240, Total=1892 [2024-11-28 04:24:45,395 INFO L87 Difference]: Start difference. First operand 4791 states and 6932 transitions. Second operand has 32 states, 29 states have (on average 6.137931034482759) internal successors, (178), 30 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:25:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:45,380 INFO L93 Difference]: Finished difference Result 4793 states and 6943 transitions. [2024-11-28 04:25:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:25:45,381 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 6.137931034482759) internal successors, (178), 30 states have internal predecessors, (178), 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 109 [2024-11-28 04:25:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:45,386 INFO L225 Difference]: With dead ends: 4793 [2024-11-28 04:25:45,386 INFO L226 Difference]: Without dead ends: 4793 [2024-11-28 04:25:45,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=334, Invalid=2192, Unknown=36, NotChecked=300, Total=2862 [2024-11-28 04:25:45,388 INFO L435 NwaCegarLoop]: 1889 mSDtfsCounter, 2652 mSDsluCounter, 20965 mSDsCounter, 0 mSdLazyCounter, 15505 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2670 SdHoareTripleChecker+Valid, 22854 SdHoareTripleChecker+Invalid, 15538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 15505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:45,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2670 Valid, 22854 Invalid, 15538 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [33 Valid, 15505 Invalid, 0 Unknown, 0 Unchecked, 58.0s Time] [2024-11-28 04:25:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2024-11-28 04:25:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 4755. [2024-11-28 04:25:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4755 states, 4020 states have (on average 1.7012437810945273) internal successors, (6839), 4727 states have internal predecessors, (6839), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:25:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 6893 transitions. [2024-11-28 04:25:45,440 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 6893 transitions. Word has length 109 [2024-11-28 04:25:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:45,441 INFO L471 AbstractCegarLoop]: Abstraction has 4755 states and 6893 transitions. [2024-11-28 04:25:45,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 6.137931034482759) internal successors, (178), 30 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:25:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 6893 transitions. [2024-11-28 04:25:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-28 04:25:45,442 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:45,442 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-28 04:25:45,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 04:25:45,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:45,643 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:25:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -677663155, now seen corresponding path program 1 times [2024-11-28 04:25:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423048131] [2024-11-28 04:25:45,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:25:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423048131] [2024-11-28 04:25:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423048131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:25:46,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:25:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:25:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818508078] [2024-11-28 04:25:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:25:46,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:25:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:46,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:25:46,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:25:46,317 INFO L87 Difference]: Start difference. First operand 4755 states and 6893 transitions. Second operand has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:25:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:54,701 INFO L93 Difference]: Finished difference Result 4754 states and 6891 transitions. [2024-11-28 04:25:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:25:54,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 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 111 [2024-11-28 04:25:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:54,706 INFO L225 Difference]: With dead ends: 4754 [2024-11-28 04:25:54,706 INFO L226 Difference]: Without dead ends: 4754 [2024-11-28 04:25:54,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:25:54,707 INFO L435 NwaCegarLoop]: 2731 mSDtfsCounter, 2 mSDsluCounter, 8789 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11520 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:54,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11520 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-28 04:25:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2024-11-28 04:25:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4754. [2024-11-28 04:25:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 4020 states have (on average 1.7007462686567165) internal successors, (6837), 4726 states have internal predecessors, (6837), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:25:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6891 transitions. [2024-11-28 04:25:54,747 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6891 transitions. Word has length 111 [2024-11-28 04:25:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:54,748 INFO L471 AbstractCegarLoop]: Abstraction has 4754 states and 6891 transitions. [2024-11-28 04:25:54,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:25:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6891 transitions. [2024-11-28 04:25:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-28 04:25:54,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:54,748 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-28 04:25:54,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 04:25:54,749 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:25:54,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash -677663154, now seen corresponding path program 1 times [2024-11-28 04:25:54,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:54,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82999343] [2024-11-28 04:25:54,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:25:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82999343] [2024-11-28 04:25:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82999343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:25:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:25:58,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 04:25:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310728383] [2024-11-28 04:25:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:25:58,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:25:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:58,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:25:58,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:25:58,073 INFO L87 Difference]: Start difference. First operand 4754 states and 6891 transitions. Second operand has 19 states, 17 states have (on average 6.411764705882353) internal successors, (109), 18 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:26:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:26:56,601 INFO L93 Difference]: Finished difference Result 4798 states and 6947 transitions. [2024-11-28 04:26:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:26:56,602 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.411764705882353) internal successors, (109), 18 states have internal predecessors, (109), 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 111 [2024-11-28 04:26:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:26:56,609 INFO L225 Difference]: With dead ends: 4798 [2024-11-28 04:26:56,609 INFO L226 Difference]: Without dead ends: 4798 [2024-11-28 04:26:56,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 04:26:56,610 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 2664 mSDsluCounter, 20598 mSDsCounter, 0 mSdLazyCounter, 15871 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 22488 SdHoareTripleChecker+Invalid, 15896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 15871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:26:56,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 22488 Invalid, 15896 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [25 Valid, 15871 Invalid, 0 Unknown, 0 Unchecked, 57.1s Time] [2024-11-28 04:26:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2024-11-28 04:26:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 4795. [2024-11-28 04:26:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4795 states, 4060 states have (on average 1.694088669950739) internal successors, (6878), 4765 states have internal predecessors, (6878), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:26:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4795 states and 6934 transitions. [2024-11-28 04:26:56,675 INFO L78 Accepts]: Start accepts. Automaton has 4795 states and 6934 transitions. Word has length 111 [2024-11-28 04:26:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:26:56,675 INFO L471 AbstractCegarLoop]: Abstraction has 4795 states and 6934 transitions. [2024-11-28 04:26:56,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.411764705882353) internal successors, (109), 18 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:26:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4795 states and 6934 transitions. [2024-11-28 04:26:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 04:26:56,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:26:56,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:26:56,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 04:26:56,677 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:26:56,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:26:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash 968076007, now seen corresponding path program 1 times [2024-11-28 04:26:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:26:56,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851338213] [2024-11-28 04:26:56,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:26:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:26:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:26:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:26:59,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:26:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851338213] [2024-11-28 04:26:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851338213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:26:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071885123] [2024-11-28 04:26:59,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:26:59,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:59,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:59,756 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:26:59,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:27:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:27:00,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 04:27:00,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:27:00,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:27:00,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:27:00,864 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:27:00,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:27:00,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:27:00,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:27:01,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:27:01,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:27:01,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:27:01,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:27:01,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:27:02,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:27:02,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:27:02,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:27:02,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:27:02,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:27:02,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-28 04:27:02,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:27:02,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:27:02,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:27:03,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:27:03,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:27:03,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:27:03,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:27:03,332 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-28 04:27:03,377 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:27:03,377 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-28 04:27:03,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:27:03,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:27:03,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-28 04:27:03,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:27:03,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:27:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:27:03,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:27:03,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3227 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:27:04,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3224) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0)))) (forall ((v_ArrVal_3224 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0)) (forall ((v_ArrVal_3226 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3225))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3224) .cse1 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse2 .cse1 v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-28 04:27:05,451 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3222))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3223) .cse1 v_ArrVal_3224) (select (select (store .cse2 .cse1 v_ArrVal_3225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3227))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0)))) (forall ((v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int))) (or (forall ((v_ArrVal_3226 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3222))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3225))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3223) .cse4 v_ArrVal_3224) .cse5 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse6 .cse5 v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0))))))) is different from false [2024-11-28 04:27:23,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0))) (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3218))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3220))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3222))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3219) .cse0 v_ArrVal_3221) .cse1 v_ArrVal_3223) .cse2 v_ArrVal_3224) (select (select (store .cse3 .cse2 v_ArrVal_3225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3227))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (or (forall ((v_ArrVal_3226 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3218))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3220))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3222))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3225))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3219) .cse7 v_ArrVal_3221) .cse8 v_ArrVal_3223) .cse9 v_ArrVal_3224) .cse10 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse11 .cse10 v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0)))))) is different from false [2024-11-28 04:27:23,428 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0))) (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3218))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3220))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3222))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3219) .cse1 v_ArrVal_3221) .cse2 v_ArrVal_3223) .cse3 v_ArrVal_3224) (select (select (store .cse4 .cse3 v_ArrVal_3225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3227))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (or (forall ((v_ArrVal_3226 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3218))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3220))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3222))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3225))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3219) .cse8 v_ArrVal_3221) .cse9 v_ArrVal_3223) .cse10 v_ArrVal_3224) .cse11 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse12 .cse11 v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0))))))) is different from false [2024-11-28 04:27:23,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:23,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1180 treesize of output 1198 [2024-11-28 04:27:28,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc62#1.base_9| |c_ULTIMATE.start_main_#t~mem55#1.base|) (forall ((v_ArrVal_3226 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3233))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3218))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3220))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3222))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3225))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3234) .cse0 v_ArrVal_3219) .cse1 v_ArrVal_3221) .cse2 v_ArrVal_3223) .cse3 v_ArrVal_3224) .cse4 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse6 .cse4 v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_prenex_57 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_66 (Array Int Int)) (v_prenex_55 (Array Int Int)) (v_prenex_59 (Array Int Int))) (< 0 (+ (select (select (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_prenex_57))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_prenex_65))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_prenex_55))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_prenex_58))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_prenex_59) .cse11 v_prenex_66) .cse12 v_prenex_56) .cse13 v_prenex_60) .cse14 v_prenex_61) (select (select (store .cse15 .cse14 v_prenex_63) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_64))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 41))))) is different from false [2024-11-28 04:27:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071885123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:27:28,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:27:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2024-11-28 04:27:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15445071] [2024-11-28 04:27:28,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:27:28,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 04:27:28,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:27:28,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 04:27:28,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1004, Unknown=31, NotChecked=426, Total=1640 [2024-11-28 04:27:28,311 INFO L87 Difference]: Start difference. First operand 4795 states and 6934 transitions. Second operand has 27 states, 25 states have (on average 6.8) internal successors, (170), 25 states have internal predecessors, (170), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:28:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:28:37,086 INFO L93 Difference]: Finished difference Result 4797 states and 6945 transitions. [2024-11-28 04:28:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 04:28:37,086 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.8) internal successors, (170), 25 states have internal predecessors, (170), 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 112 [2024-11-28 04:28:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:28:37,091 INFO L225 Difference]: With dead ends: 4797 [2024-11-28 04:28:37,091 INFO L226 Difference]: Without dead ends: 4797 [2024-11-28 04:28:37,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=309, Invalid=1754, Unknown=31, NotChecked=558, Total=2652 [2024-11-28 04:28:37,092 INFO L435 NwaCegarLoop]: 1888 mSDtfsCounter, 2642 mSDsluCounter, 18003 mSDsCounter, 0 mSdLazyCounter, 13045 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 19891 SdHoareTripleChecker+Invalid, 13071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 13045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:28:37,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2660 Valid, 19891 Invalid, 13071 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [26 Valid, 13045 Invalid, 0 Unknown, 0 Unchecked, 66.6s Time] [2024-11-28 04:28:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2024-11-28 04:28:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4753. [2024-11-28 04:28:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4753 states, 4020 states have (on average 1.7002487562189055) internal successors, (6835), 4725 states have internal predecessors, (6835), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:28:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 6889 transitions. [2024-11-28 04:28:37,133 INFO L78 Accepts]: Start accepts. Automaton has 4753 states and 6889 transitions. Word has length 112 [2024-11-28 04:28:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:28:37,133 INFO L471 AbstractCegarLoop]: Abstraction has 4753 states and 6889 transitions. [2024-11-28 04:28:37,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.8) internal successors, (170), 25 states have internal predecessors, (170), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:28:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4753 states and 6889 transitions. [2024-11-28 04:28:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 04:28:37,134 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:28:37,134 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, 1, 1, 1] [2024-11-28 04:28:37,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 04:28:37,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-28 04:28:37,335 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:28:37,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:28:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1916052354, now seen corresponding path program 1 times [2024-11-28 04:28:37,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:28:37,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478095990] [2024-11-28 04:28:37,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:28:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:28:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:28:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:28:39,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:28:39,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478095990] [2024-11-28 04:28:39,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478095990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:28:39,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:28:39,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:28:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551903102] [2024-11-28 04:28:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:28:39,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:28:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:28:39,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:28:39,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:28:39,216 INFO L87 Difference]: Start difference. First operand 4753 states and 6889 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:29:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:29:10,268 INFO L93 Difference]: Finished difference Result 4752 states and 6887 transitions. [2024-11-28 04:29:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:29:10,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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 114 [2024-11-28 04:29:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:29:10,274 INFO L225 Difference]: With dead ends: 4752 [2024-11-28 04:29:10,274 INFO L226 Difference]: Without dead ends: 4752 [2024-11-28 04:29:10,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:29:10,274 INFO L435 NwaCegarLoop]: 1919 mSDtfsCounter, 5258 mSDsluCounter, 11365 mSDsCounter, 0 mSdLazyCounter, 5891 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5266 SdHoareTripleChecker+Valid, 13284 SdHoareTripleChecker+Invalid, 5913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:29:10,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5266 Valid, 13284 Invalid, 5913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5891 Invalid, 0 Unknown, 0 Unchecked, 30.3s Time] [2024-11-28 04:29:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4752 states. [2024-11-28 04:29:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4752 to 4752. [2024-11-28 04:29:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4020 states have (on average 1.6997512437810944) internal successors, (6833), 4724 states have internal predecessors, (6833), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:29:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 6887 transitions. [2024-11-28 04:29:10,316 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 6887 transitions. Word has length 114 [2024-11-28 04:29:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:29:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 6887 transitions. [2024-11-28 04:29:10,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:29:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 6887 transitions. [2024-11-28 04:29:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 04:29:10,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:29:10,318 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, 1, 1, 1] [2024-11-28 04:29:10,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 04:29:10,318 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:29:10,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:29:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1916052353, now seen corresponding path program 1 times [2024-11-28 04:29:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:29:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507097394] [2024-11-28 04:29:10,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:29:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:29:13,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:29:13,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507097394] [2024-11-28 04:29:13,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507097394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:29:13,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:29:13,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 04:29:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168994540] [2024-11-28 04:29:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:29:13,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:29:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:29:13,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:29:13,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:29:13,056 INFO L87 Difference]: Start difference. First operand 4752 states and 6887 transitions. Second operand has 16 states, 15 states have (on average 7.466666666666667) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:30:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:30:14,077 INFO L93 Difference]: Finished difference Result 4836 states and 6997 transitions. [2024-11-28 04:30:14,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:30:14,078 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.466666666666667) internal successors, (112), 16 states have internal predecessors, (112), 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 114 [2024-11-28 04:30:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:30:14,083 INFO L225 Difference]: With dead ends: 4836 [2024-11-28 04:30:14,083 INFO L226 Difference]: Without dead ends: 4836 [2024-11-28 04:30:14,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 04:30:14,084 INFO L435 NwaCegarLoop]: 1897 mSDtfsCounter, 2715 mSDsluCounter, 21763 mSDsCounter, 0 mSdLazyCounter, 12086 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 23660 SdHoareTripleChecker+Invalid, 12112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 12086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:30:14,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 23660 Invalid, 12112 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [26 Valid, 12086 Invalid, 0 Unknown, 0 Unchecked, 59.6s Time] [2024-11-28 04:30:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2024-11-28 04:30:14,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4799. [2024-11-28 04:30:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4799 states, 4066 states have (on average 1.6920806689621248) internal successors, (6880), 4769 states have internal predecessors, (6880), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:30:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4799 states to 4799 states and 6936 transitions. [2024-11-28 04:30:14,128 INFO L78 Accepts]: Start accepts. Automaton has 4799 states and 6936 transitions. Word has length 114 [2024-11-28 04:30:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:30:14,128 INFO L471 AbstractCegarLoop]: Abstraction has 4799 states and 6936 transitions. [2024-11-28 04:30:14,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.466666666666667) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:30:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4799 states and 6936 transitions. [2024-11-28 04:30:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 04:30:14,129 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:30:14,129 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, 1, 1, 1, 1] [2024-11-28 04:30:14,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 04:30:14,129 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:30:14,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:30:14,129 INFO L85 PathProgramCache]: Analyzing trace with hash -752390842, now seen corresponding path program 1 times [2024-11-28 04:30:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:30:14,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970368009] [2024-11-28 04:30:14,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:30:14,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:30:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:30:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:30:17,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:30:17,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970368009] [2024-11-28 04:30:17,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970368009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:30:17,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:30:17,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:30:17,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070545090] [2024-11-28 04:30:17,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:30:17,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:30:17,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:30:17,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:30:17,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:30:17,966 INFO L87 Difference]: Start difference. First operand 4799 states and 6936 transitions. Second operand has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 12 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:30:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:30:48,046 INFO L93 Difference]: Finished difference Result 4798 states and 6934 transitions. [2024-11-28 04:30:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:30:48,046 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 12 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-28 04:30:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:30:48,052 INFO L225 Difference]: With dead ends: 4798 [2024-11-28 04:30:48,052 INFO L226 Difference]: Without dead ends: 4798 [2024-11-28 04:30:48,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:30:48,053 INFO L435 NwaCegarLoop]: 1917 mSDtfsCounter, 5247 mSDsluCounter, 8655 mSDsCounter, 0 mSdLazyCounter, 5718 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5255 SdHoareTripleChecker+Valid, 10572 SdHoareTripleChecker+Invalid, 5738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:30:48,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5255 Valid, 10572 Invalid, 5738 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 5718 Invalid, 0 Unknown, 0 Unchecked, 29.0s Time] [2024-11-28 04:30:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2024-11-28 04:30:48,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 4751. [2024-11-28 04:30:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4751 states, 4020 states have (on average 1.6992537313432836) internal successors, (6831), 4723 states have internal predecessors, (6831), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:30:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4751 states to 4751 states and 6885 transitions. [2024-11-28 04:30:48,110 INFO L78 Accepts]: Start accepts. Automaton has 4751 states and 6885 transitions. Word has length 115 [2024-11-28 04:30:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:30:48,110 INFO L471 AbstractCegarLoop]: Abstraction has 4751 states and 6885 transitions. [2024-11-28 04:30:48,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 12 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:30:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4751 states and 6885 transitions. [2024-11-28 04:30:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 04:30:48,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:30:48,111 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, 1, 1, 1, 1, 1, 1] [2024-11-28 04:30:48,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-28 04:30:48,111 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:30:48,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:30:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash -999587262, now seen corresponding path program 1 times [2024-11-28 04:30:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:30:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800589121] [2024-11-28 04:30:48,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:30:48,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:30:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:30:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:30:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:30:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800589121] [2024-11-28 04:30:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800589121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:30:51,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:30:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 04:30:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956739880] [2024-11-28 04:30:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:30:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:30:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:30:51,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:30:51,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-28 04:30:51,253 INFO L87 Difference]: Start difference. First operand 4751 states and 6885 transitions. Second operand has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:31:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:31:39,141 INFO L93 Difference]: Finished difference Result 4834 states and 6993 transitions. [2024-11-28 04:31:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:31:39,142 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 states have internal predecessors, (115), 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 117 [2024-11-28 04:31:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:31:39,147 INFO L225 Difference]: With dead ends: 4834 [2024-11-28 04:31:39,147 INFO L226 Difference]: Without dead ends: 4834 [2024-11-28 04:31:39,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-28 04:31:39,148 INFO L435 NwaCegarLoop]: 1889 mSDtfsCounter, 2742 mSDsluCounter, 13937 mSDsCounter, 0 mSdLazyCounter, 9037 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 15826 SdHoareTripleChecker+Invalid, 9065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:31:39,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 15826 Invalid, 9065 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 9037 Invalid, 0 Unknown, 0 Unchecked, 46.3s Time] [2024-11-28 04:31:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2024-11-28 04:31:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4804. [2024-11-28 04:31:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4804 states, 4072 states have (on average 1.6910609037328095) internal successors, (6886), 4774 states have internal predecessors, (6886), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:31:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6942 transitions. [2024-11-28 04:31:39,185 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6942 transitions. Word has length 117 [2024-11-28 04:31:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:31:39,185 INFO L471 AbstractCegarLoop]: Abstraction has 4804 states and 6942 transitions. [2024-11-28 04:31:39,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:31:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6942 transitions. [2024-11-28 04:31:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 04:31:39,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:31:39,186 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, 1, 1, 1, 1, 1, 1] [2024-11-28 04:31:39,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 04:31:39,186 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:31:39,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:31:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash -999587263, now seen corresponding path program 1 times [2024-11-28 04:31:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:31:39,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437151956] [2024-11-28 04:31:39,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:31:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:31:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:31:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:31:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:31:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437151956] [2024-11-28 04:31:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437151956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:31:39,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:31:39,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:31:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747924369] [2024-11-28 04:31:39,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:31:39,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:31:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:31:39,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:31:39,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:31:39,480 INFO L87 Difference]: Start difference. First operand 4804 states and 6942 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:31:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:31:49,272 INFO L93 Difference]: Finished difference Result 4803 states and 6938 transitions. [2024-11-28 04:31:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:31:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 117 [2024-11-28 04:31:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:31:49,277 INFO L225 Difference]: With dead ends: 4803 [2024-11-28 04:31:49,277 INFO L226 Difference]: Without dead ends: 4803 [2024-11-28 04:31:49,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:31:49,277 INFO L435 NwaCegarLoop]: 2727 mSDtfsCounter, 5 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9017 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:31:49,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 9017 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-28 04:31:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2024-11-28 04:31:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4803. [2024-11-28 04:31:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4803 states, 4072 states have (on average 1.6900785854616895) internal successors, (6882), 4773 states have internal predecessors, (6882), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 04:31:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4803 states to 4803 states and 6938 transitions. [2024-11-28 04:31:49,313 INFO L78 Accepts]: Start accepts. Automaton has 4803 states and 6938 transitions. Word has length 117 [2024-11-28 04:31:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:31:49,313 INFO L471 AbstractCegarLoop]: Abstraction has 4803 states and 6938 transitions. [2024-11-28 04:31:49,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:31:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4803 states and 6938 transitions. [2024-11-28 04:31:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:31:49,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:31:49,314 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:31:49,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-28 04:31:49,314 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:31:49,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:31:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash 959440923, now seen corresponding path program 1 times [2024-11-28 04:31:49,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:31:49,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71048674] [2024-11-28 04:31:49,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:31:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:31:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:31:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:31:49,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:31:49,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71048674] [2024-11-28 04:31:49,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71048674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:31:49,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:31:49,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:31:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129069624] [2024-11-28 04:31:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:31:49,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:31:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:31:49,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:31:49,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:31:49,807 INFO L87 Difference]: Start difference. First operand 4803 states and 6938 transitions. Second operand has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:32:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:32:00,334 INFO L93 Difference]: Finished difference Result 4802 states and 6936 transitions. [2024-11-28 04:32:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:32:00,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 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 118 [2024-11-28 04:32:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:32:00,339 INFO L225 Difference]: With dead ends: 4802 [2024-11-28 04:32:00,340 INFO L226 Difference]: Without dead ends: 4802 [2024-11-28 04:32:00,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:32:00,340 INFO L435 NwaCegarLoop]: 2727 mSDtfsCounter, 4 mSDsluCounter, 6272 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8999 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:32:00,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8999 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-11-28 04:32:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states. [2024-11-28 04:32:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4749. [2024-11-28 04:32:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4749 states, 4020 states have (on average 1.6982587064676617) internal successors, (6827), 4721 states have internal predecessors, (6827), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 04:32:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 6881 transitions. [2024-11-28 04:32:00,401 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 6881 transitions. Word has length 118 [2024-11-28 04:32:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:32:00,402 INFO L471 AbstractCegarLoop]: Abstraction has 4749 states and 6881 transitions. [2024-11-28 04:32:00,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:32:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 6881 transitions. [2024-11-28 04:32:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:32:00,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:32:00,403 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:32:00,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 04:32:00,403 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:32:00,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:32:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash -922433342, now seen corresponding path program 1 times [2024-11-28 04:32:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:32:00,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918394000] [2024-11-28 04:32:00,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:32:00,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:32:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:32:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:32:03,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:32:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918394000] [2024-11-28 04:32:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918394000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:32:03,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:32:03,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-28 04:32:03,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930127157] [2024-11-28 04:32:03,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:32:03,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 04:32:03,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:32:03,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 04:32:03,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:32:03,635 INFO L87 Difference]: Start difference. First operand 4749 states and 6881 transitions. Second operand has 21 states, 20 states have (on average 5.8) internal successors, (116), 21 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:15,406 INFO L93 Difference]: Finished difference Result 4832 states and 6987 transitions. [2024-11-28 04:33:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:33:15,407 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.8) internal successors, (116), 21 states have internal predecessors, (116), 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 118 [2024-11-28 04:33:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:15,413 INFO L225 Difference]: With dead ends: 4832 [2024-11-28 04:33:15,414 INFO L226 Difference]: Without dead ends: 4832 [2024-11-28 04:33:15,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 04:33:15,414 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2756 mSDsluCounter, 29850 mSDsCounter, 0 mSdLazyCounter, 14691 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2774 SdHoareTripleChecker+Valid, 31741 SdHoareTripleChecker+Invalid, 14726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 14691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:15,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2774 Valid, 31741 Invalid, 14726 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [35 Valid, 14691 Invalid, 0 Unknown, 0 Unchecked, 69.8s Time] [2024-11-28 04:33:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2024-11-28 04:33:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4804. [2024-11-28 04:33:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4804 states, 4074 states have (on average 1.6892488954344624) internal successors, (6882), 4774 states have internal predecessors, (6882), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 26 states have call predecessors, (31), 29 states have call successors, (31) [2024-11-28 04:33:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6942 transitions. [2024-11-28 04:33:15,499 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6942 transitions. Word has length 118 [2024-11-28 04:33:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:15,499 INFO L471 AbstractCegarLoop]: Abstraction has 4804 states and 6942 transitions. [2024-11-28 04:33:15,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.8) internal successors, (116), 21 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6942 transitions. [2024-11-28 04:33:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:33:15,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:15,501 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:15,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-28 04:33:15,501 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:33:15,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash -922433341, now seen corresponding path program 1 times [2024-11-28 04:33:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:15,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920486736] [2024-11-28 04:33:15,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:18,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920486736] [2024-11-28 04:33:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920486736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:18,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:18,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 04:33:18,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245702693] [2024-11-28 04:33:18,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:18,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:33:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:18,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:33:18,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:33:18,429 INFO L87 Difference]: Start difference. First operand 4804 states and 6942 transitions. Second operand has 19 states, 18 states have (on average 6.444444444444445) internal successors, (116), 19 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:03,201 INFO L93 Difference]: Finished difference Result 4831 states and 6985 transitions. [2024-11-28 04:34:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 04:34:03,201 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.444444444444445) internal successors, (116), 19 states have internal predecessors, (116), 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 118 [2024-11-28 04:34:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:03,207 INFO L225 Difference]: With dead ends: 4831 [2024-11-28 04:34:03,207 INFO L226 Difference]: Without dead ends: 4831 [2024-11-28 04:34:03,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 04:34:03,208 INFO L435 NwaCegarLoop]: 1900 mSDtfsCounter, 2690 mSDsluCounter, 13985 mSDsCounter, 0 mSdLazyCounter, 9006 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 15885 SdHoareTripleChecker+Invalid, 9034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:03,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2708 Valid, 15885 Invalid, 9034 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 9006 Invalid, 0 Unknown, 0 Unchecked, 43.1s Time] [2024-11-28 04:34:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2024-11-28 04:34:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4804. [2024-11-28 04:34:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4804 states, 4072 states have (on average 1.6895874263261297) internal successors, (6880), 4774 states have internal predecessors, (6880), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 26 states have call predecessors, (31), 29 states have call successors, (31) [2024-11-28 04:34:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6940 transitions. [2024-11-28 04:34:03,252 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6940 transitions. Word has length 118 [2024-11-28 04:34:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:03,252 INFO L471 AbstractCegarLoop]: Abstraction has 4804 states and 6940 transitions. [2024-11-28 04:34:03,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.444444444444445) internal successors, (116), 19 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6940 transitions. [2024-11-28 04:34:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-28 04:34:03,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:03,253 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:03,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-28 04:34:03,253 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:34:03,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:03,253 INFO L85 PathProgramCache]: Analyzing trace with hash -322101751, now seen corresponding path program 1 times [2024-11-28 04:34:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:34:03,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330209205] [2024-11-28 04:34:03,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:03,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:34:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:06,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:06,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330209205] [2024-11-28 04:34:06,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330209205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:06,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708138840] [2024-11-28 04:34:06,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:06,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:06,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:06,714 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:06,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4507e892-3dd8-4e42-b4b8-11c6e5d421b9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:34:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:07,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-28 04:34:07,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:07,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:08,031 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:34:08,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:34:08,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:34:08,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:34:08,649 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:08,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:34:08,660 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-28 04:34:08,947 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:08,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:34:08,959 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-28 04:34:09,244 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:09,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:34:09,266 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-28 04:34:09,445 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:09,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:34:09,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 04:34:09,752 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:09,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:34:09,773 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-28 04:34:09,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:10,043 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 04:34:10,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 63 [2024-11-28 04:34:10,054 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-28 04:34:10,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:34:10,476 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 04:34:10,476 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-28 04:34:10,498 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-28 04:34:10,607 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-28 04:34:10,934 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 04:34:10,935 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-28 04:34:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:10,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:34:11,100 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4260 Int) (v_ArrVal_4258 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem63#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem63#1.base|) (+ |c_ULTIMATE.start_main_#t~mem63#1.offset| 40) v_ArrVal_4260)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem63#1.base| v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1)) is different from false [2024-11-28 04:34:11,151 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4260 Int) (|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int) (v_ArrVal_4258 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (= (select |c_#valid| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| .cse2 (store (select |c_#memory_$Pointer$#2.base| .cse2) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) 1)))) is different from false [2024-11-28 04:34:11,229 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4260 Int) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4258 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_4255)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (= (select |c_#valid| (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem61#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem61#1.base|) |c_ULTIMATE.start_main_#t~mem61#1.offset| |c_ULTIMATE.start_main_#t~malloc62#1.base|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-28 04:34:11,251 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 446 treesize of output 300 [2024-11-28 04:34:11,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4260 Int) (|v_ULTIMATE.start_main_#t~malloc62#1.base_12| Int) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4258 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_4255)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem61#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem61#1.base|) |c_ULTIMATE.start_main_#t~mem61#1.offset| |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) is different from false [2024-11-28 04:34:11,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4260 Int) (v_ArrVal_4252 (Array Int Int)) (v_ArrVal_4253 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_12| Int) (v_ArrVal_4255 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int) (v_ArrVal_4258 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4253)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4252)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4255))) (or (= (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|) (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:34:11,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4260 Int) (v_ArrVal_4252 (Array Int Int)) (v_ArrVal_4253 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_12| Int) (v_ArrVal_4255 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int) (v_ArrVal_4258 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_4253))) (let ((.cse7 (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_4252)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4255))) (or (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc62#1.base_12| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-28 04:34:15,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4251 (Array Int Int)) (v_ArrVal_4260 Int) (v_ArrVal_4252 (Array Int Int)) (v_ArrVal_4253 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_12| Int) (v_ArrVal_4255 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int) (v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4250 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4251)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse9 .cse8 v_ArrVal_4253))) (let ((.cse7 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4250) .cse8 v_ArrVal_4252)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4255))) (or (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))))))) is different from false [2024-11-28 04:35:15,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4251 (Array Int Int)) (v_ArrVal_4260 Int) (v_ArrVal_4252 (Array Int Int)) (v_ArrVal_4253 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_12| Int) (v_ArrVal_4255 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int) (v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4248 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4250 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4248)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_4251))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_4253))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4249) .cse8 v_ArrVal_4250) .cse9 v_ArrVal_4252)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4255))) (or (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))))))))) is different from false [2024-11-28 04:35:15,182 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4251 (Array Int Int)) (v_ArrVal_4260 Int) (v_ArrVal_4252 (Array Int Int)) (v_ArrVal_4253 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_12| Int) (v_ArrVal_4255 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int) (v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4248 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4250 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_4248))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4251))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_4253))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_4249) .cse9 v_ArrVal_4250) .cse10 v_ArrVal_4252)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4255))) (or (= (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|) (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-28 04:35:15,286 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int) (v_ArrVal_4250 (Array Int Int)) (v_ArrVal_4251 (Array Int Int)) (v_ArrVal_4260 Int) (v_ArrVal_4252 (Array Int Int)) (v_ArrVal_4253 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_12| Int) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4246 (Array Int Int)) (v_ArrVal_4247 (Array Int Int)) (v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4248 (Array Int Int)) (v_ArrVal_4249 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4246)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_4248))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4251))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_4253))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4247) .cse8 v_ArrVal_4249) .cse9 v_ArrVal_4250) .cse10 v_ArrVal_4252)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4255))) (or (= (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|) (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-28 04:35:15,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int) (v_ArrVal_4250 (Array Int Int)) (v_ArrVal_4251 (Array Int Int)) (v_ArrVal_4260 Int) (v_ArrVal_4252 (Array Int Int)) (v_ArrVal_4253 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_12| Int) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4246 (Array Int Int)) (v_ArrVal_4247 (Array Int Int)) (v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4248 (Array Int Int)) (v_ArrVal_4249 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_4246))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4248))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4251))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_4253))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_4247) .cse9 v_ArrVal_4249) .cse10 v_ArrVal_4250) .cse11 v_ArrVal_4252)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4255))) (or (= (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|) (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-28 04:35:15,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem63#1.offset_10| Int) (v_ArrVal_4250 (Array Int Int)) (v_ArrVal_4251 (Array Int Int)) (v_ArrVal_4260 Int) (v_ArrVal_4252 (Array Int Int)) (v_ArrVal_4253 (Array Int Int)) (v_ArrVal_4265 (Array Int Int)) (v_ArrVal_4266 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_12| Int) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4246 (Array Int Int)) (v_ArrVal_4247 (Array Int Int)) (v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4248 (Array Int Int)) (v_ArrVal_4249 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4265)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_4246))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4248))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4251))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_4253))) (let ((.cse7 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4266) .cse8 v_ArrVal_4247) .cse9 v_ArrVal_4249) .cse10 v_ArrVal_4250) .cse11 v_ArrVal_4252)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4255))) (or (< |v_ULTIMATE.start_main_#t~mem63#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc62#1.base_12| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc62#1.base_12|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem63#1.offset_10| 40) v_ArrVal_4260)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4258) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))))) is different from false [2024-11-28 04:35:15,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708138840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:15,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:35:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 27 [2024-11-28 04:35:15,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693407449] [2024-11-28 04:35:15,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:35:15,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 04:35:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:35:15,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 04:35:15,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=759, Unknown=20, NotChecked=804, Total=1722 [2024-11-28 04:35:15,637 INFO L87 Difference]: Start difference. First operand 4804 states and 6940 transitions. Second operand has 28 states, 26 states have (on average 6.923076923076923) internal successors, (180), 28 states have internal predecessors, (180), 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)