./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:10:24,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:10:24,751 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-24 01:10:24,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:10:24,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:10:24,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:10:24,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:10:24,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:10:24,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:10:24,801 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:10:24,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:10:24,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:10:24,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:10:24,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:10:24,804 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:10:24,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:10:24,804 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:10:24,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:10:24,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:10:24,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:10:24,804 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 01:10:24,804 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 01:10:24,804 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:10:24,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:10:24,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:10:24,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:10:24,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:10:24,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:10:24,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:10:24,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:10:24,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:10:24,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:10:24,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:10:24,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:10:24,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:10:24,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:10:24,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:10:24,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:10:24,808 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_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-24 01:10:25,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:10:25,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:10:25,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:10:25,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:10:25,143 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:10:25,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2024-11-24 01:10:28,091 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/data/759beb38f/de879ce66b884f148b7ea8b348320ee4/FLAGb6780531f [2024-11-24 01:10:28,406 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:10:28,407 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2024-11-24 01:10:28,423 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/data/759beb38f/de879ce66b884f148b7ea8b348320ee4/FLAGb6780531f [2024-11-24 01:10:28,437 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/data/759beb38f/de879ce66b884f148b7ea8b348320ee4 [2024-11-24 01:10:28,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:10:28,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:10:28,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:10:28,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:10:28,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:10:28,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:28" (1/1) ... [2024-11-24 01:10:28,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4164bb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:28, skipping insertion in model container [2024-11-24 01:10:28,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:28" (1/1) ... [2024-11-24 01:10:28,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:10:28,940 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 01:10:28,973 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 01:10:28,977 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 01:10:28,982 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 01:10:28,989 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 01:10:29,037 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 01:10:29,037 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 01:10:29,040 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 01:10:29,040 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 01:10:29,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:10:29,058 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:10:29,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:10:29,238 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:10:29,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29 WrapperNode [2024-11-24 01:10:29,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:10:29,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:10:29,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:10:29,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:10:29,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,363 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-24 01:10:29,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:10:29,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:10:29,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:10:29,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:10:29,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,460 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-24 01:10:29,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:10:29,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:10:29,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:10:29,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:10:29,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (1/1) ... [2024-11-24 01:10:29,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:10:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:29,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:10:29,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:10:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-24 01:10:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-24 01:10:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-24 01:10:29,706 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-24 01:10:29,706 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-24 01:10:29,706 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-24 01:10:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-24 01:10:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-24 01:10:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-24 01:10:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-24 01:10:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-24 01:10:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-24 01:10:29,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-24 01:10:29,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-24 01:10:29,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-24 01:10:29,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-24 01:10:29,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-24 01:10:29,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-24 01:10:29,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:10:29,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-24 01:10:29,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-24 01:10:29,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-24 01:10:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:10:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 01:10:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-24 01:10:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:10:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:10:29,944 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:10:29,945 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:10:29,948 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-24 01:10:29,987 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-24 01:10:30,005 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-24 01:10:32,602 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-24 01:10:32,602 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:10:32,654 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:10:32,655 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-24 01:10:32,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:32 BoogieIcfgContainer [2024-11-24 01:10:32,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:10:32,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:10:32,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:10:32,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:10:32,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:10:28" (1/3) ... [2024-11-24 01:10:32,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110c2927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:32, skipping insertion in model container [2024-11-24 01:10:32,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:29" (2/3) ... [2024-11-24 01:10:32,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110c2927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:32, skipping insertion in model container [2024-11-24 01:10:32,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:32" (3/3) ... [2024-11-24 01:10:32,665 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2024-11-24 01:10:32,682 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:10:32,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test2-1.i that has 4 procedures, 1064 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2024-11-24 01:10:32,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:10:32,777 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;@7fc24156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:10:32,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-24 01:10:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 1054 states, 632 states have (on average 2.0126582278481013) internal successors, (1272), 1049 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:10:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-24 01:10:32,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:32,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-24 01:10:32,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:32,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:32,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1758863, now seen corresponding path program 1 times [2024-11-24 01:10:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:32,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737718475] [2024-11-24 01:10:32,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:33,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737718475] [2024-11-24 01:10:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737718475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:33,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:10:33,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087430577] [2024-11-24 01:10:33,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:33,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:33,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:33,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:33,141 INFO L87 Difference]: Start difference. First operand has 1054 states, 632 states have (on average 2.0126582278481013) internal successors, (1272), 1049 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:34,430 INFO L93 Difference]: Finished difference Result 1351 states and 1604 transitions. [2024-11-24 01:10:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:10:34,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-24 01:10:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:34,447 INFO L225 Difference]: With dead ends: 1351 [2024-11-24 01:10:34,448 INFO L226 Difference]: Without dead ends: 1347 [2024-11-24 01:10:34,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:34,455 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 383 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:34,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 2651 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 01:10:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-11-24 01:10:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1261. [2024-11-24 01:10:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 845 states have (on average 1.8804733727810652) internal successors, (1589), 1256 states have internal predecessors, (1589), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:10:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1595 transitions. [2024-11-24 01:10:34,548 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1595 transitions. Word has length 4 [2024-11-24 01:10:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:34,548 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1595 transitions. [2024-11-24 01:10:34,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1595 transitions. [2024-11-24 01:10:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-24 01:10:34,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:34,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-24 01:10:34,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:10:34,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-24 01:10:34,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:34,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208594650] [2024-11-24 01:10:34,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:34,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:34,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:34,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208594650] [2024-11-24 01:10:34,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208594650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:34,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:34,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:10:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404481735] [2024-11-24 01:10:34,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:34,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:10:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:34,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:10:34,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:34,627 INFO L87 Difference]: Start difference. First operand 1261 states and 1595 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:35,304 INFO L93 Difference]: Finished difference Result 1258 states and 1587 transitions. [2024-11-24 01:10:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:10:35,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-24 01:10:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:35,311 INFO L225 Difference]: With dead ends: 1258 [2024-11-24 01:10:35,311 INFO L226 Difference]: Without dead ends: 1258 [2024-11-24 01:10:35,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:35,315 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 1087 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:35,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 862 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 01:10:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-24 01:10:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1258. [2024-11-24 01:10:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 853 states have (on average 1.8534583821805393) internal successors, (1581), 1253 states have internal predecessors, (1581), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:10:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1587 transitions. [2024-11-24 01:10:35,363 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1587 transitions. Word has length 4 [2024-11-24 01:10:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:35,364 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1587 transitions. [2024-11-24 01:10:35,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1587 transitions. [2024-11-24 01:10:35,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-24 01:10:35,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:35,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-24 01:10:35,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:10:35,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:35,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-24 01:10:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:35,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069319539] [2024-11-24 01:10:35,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:35,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:35,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069319539] [2024-11-24 01:10:35,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069319539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:35,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:35,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:10:35,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818605544] [2024-11-24 01:10:35,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:35,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:10:35,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:35,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:10:35,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:35,533 INFO L87 Difference]: Start difference. First operand 1258 states and 1587 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:36,653 INFO L93 Difference]: Finished difference Result 2018 states and 2492 transitions. [2024-11-24 01:10:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:10:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-24 01:10:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:36,663 INFO L225 Difference]: With dead ends: 2018 [2024-11-24 01:10:36,664 INFO L226 Difference]: Without dead ends: 2018 [2024-11-24 01:10:36,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:36,668 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 904 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:36,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1695 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-24 01:10:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2024-11-24 01:10:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1756. [2024-11-24 01:10:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1352 states have (on average 1.827662721893491) internal successors, (2471), 1749 states have internal predecessors, (2471), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2481 transitions. [2024-11-24 01:10:36,720 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2481 transitions. Word has length 4 [2024-11-24 01:10:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:36,720 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2481 transitions. [2024-11-24 01:10:36,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2481 transitions. [2024-11-24 01:10:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-24 01:10:36,721 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:36,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:36,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:10:36,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:36,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235122, now seen corresponding path program 1 times [2024-11-24 01:10:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796079585] [2024-11-24 01:10:36,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:36,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796079585] [2024-11-24 01:10:36,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796079585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:36,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:36,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:10:36,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450986728] [2024-11-24 01:10:36,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:36,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:10:36,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:36,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:10:36,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:36,840 INFO L87 Difference]: Start difference. First operand 1756 states and 2481 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:37,675 INFO L93 Difference]: Finished difference Result 1795 states and 2413 transitions. [2024-11-24 01:10:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:10:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-24 01:10:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:37,683 INFO L225 Difference]: With dead ends: 1795 [2024-11-24 01:10:37,683 INFO L226 Difference]: Without dead ends: 1795 [2024-11-24 01:10:37,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:37,684 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 1072 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:37,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1421 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 01:10:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-11-24 01:10:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1709. [2024-11-24 01:10:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1352 states have (on average 1.7751479289940828) internal successors, (2400), 1702 states have internal predecessors, (2400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2410 transitions. [2024-11-24 01:10:37,730 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2410 transitions. Word has length 10 [2024-11-24 01:10:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:37,731 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2410 transitions. [2024-11-24 01:10:37,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2410 transitions. [2024-11-24 01:10:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-24 01:10:37,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:37,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:37,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:10:37,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:37,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235123, now seen corresponding path program 1 times [2024-11-24 01:10:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:37,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173440639] [2024-11-24 01:10:37,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:37,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:37,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:37,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173440639] [2024-11-24 01:10:37,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173440639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:37,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:37,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:10:37,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550566782] [2024-11-24 01:10:37,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:37,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:10:37,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:37,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:10:37,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:37,900 INFO L87 Difference]: Start difference. First operand 1709 states and 2410 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:38,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:38,737 INFO L93 Difference]: Finished difference Result 2004 states and 2756 transitions. [2024-11-24 01:10:38,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:10:38,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-24 01:10:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:38,745 INFO L225 Difference]: With dead ends: 2004 [2024-11-24 01:10:38,745 INFO L226 Difference]: Without dead ends: 2004 [2024-11-24 01:10:38,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:38,746 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 864 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:38,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1669 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 01:10:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2024-11-24 01:10:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1684. [2024-11-24 01:10:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1352 states have (on average 1.738905325443787) internal successors, (2351), 1677 states have internal predecessors, (2351), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2361 transitions. [2024-11-24 01:10:38,790 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2361 transitions. Word has length 10 [2024-11-24 01:10:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:38,790 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2361 transitions. [2024-11-24 01:10:38,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2361 transitions. [2024-11-24 01:10:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-24 01:10:38,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:38,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:38,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 01:10:38,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:38,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash -564898849, now seen corresponding path program 1 times [2024-11-24 01:10:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:38,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780272897] [2024-11-24 01:10:38,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:38,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:38,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780272897] [2024-11-24 01:10:38,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780272897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:38,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:38,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:10:38,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819517094] [2024-11-24 01:10:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:38,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:38,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:38,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:38,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:38,905 INFO L87 Difference]: Start difference. First operand 1684 states and 2361 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:39,686 INFO L93 Difference]: Finished difference Result 1808 states and 2520 transitions. [2024-11-24 01:10:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:10:39,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-24 01:10:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:39,693 INFO L225 Difference]: With dead ends: 1808 [2024-11-24 01:10:39,693 INFO L226 Difference]: Without dead ends: 1808 [2024-11-24 01:10:39,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:39,695 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 1287 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:39,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1402 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 01:10:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-24 01:10:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1661. [2024-11-24 01:10:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1352 states have (on average 1.6878698224852071) internal successors, (2282), 1654 states have internal predecessors, (2282), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2292 transitions. [2024-11-24 01:10:39,739 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2292 transitions. Word has length 14 [2024-11-24 01:10:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:39,739 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2292 transitions. [2024-11-24 01:10:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2292 transitions. [2024-11-24 01:10:39,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-24 01:10:39,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:39,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:39,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:10:39,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:39,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash -564898848, now seen corresponding path program 1 times [2024-11-24 01:10:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14728256] [2024-11-24 01:10:39,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:39,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:39,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:39,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14728256] [2024-11-24 01:10:39,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14728256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:39,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:39,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:10:39,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769193273] [2024-11-24 01:10:39,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:39,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:39,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:39,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:39,985 INFO L87 Difference]: Start difference. First operand 1661 states and 2292 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:41,201 INFO L93 Difference]: Finished difference Result 2162 states and 2775 transitions. [2024-11-24 01:10:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:10:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-24 01:10:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:41,208 INFO L225 Difference]: With dead ends: 2162 [2024-11-24 01:10:41,208 INFO L226 Difference]: Without dead ends: 2162 [2024-11-24 01:10:41,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:41,209 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1278 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:41,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2255 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-24 01:10:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2024-11-24 01:10:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1757. [2024-11-24 01:10:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1448 states have (on average 1.6685082872928176) internal successors, (2416), 1750 states have internal predecessors, (2416), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2426 transitions. [2024-11-24 01:10:41,250 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2426 transitions. Word has length 14 [2024-11-24 01:10:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:41,251 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2426 transitions. [2024-11-24 01:10:41,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2426 transitions. [2024-11-24 01:10:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 01:10:41,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:41,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:41,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 01:10:41,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:41,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1701595783, now seen corresponding path program 1 times [2024-11-24 01:10:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:41,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059963518] [2024-11-24 01:10:41,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:41,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:41,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:41,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059963518] [2024-11-24 01:10:41,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059963518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:41,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:41,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:10:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003092451] [2024-11-24 01:10:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:41,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:41,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:41,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:41,329 INFO L87 Difference]: Start difference. First operand 1757 states and 2426 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:41,406 INFO L93 Difference]: Finished difference Result 1429 states and 1909 transitions. [2024-11-24 01:10:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:10:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-24 01:10:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:41,411 INFO L225 Difference]: With dead ends: 1429 [2024-11-24 01:10:41,411 INFO L226 Difference]: Without dead ends: 1429 [2024-11-24 01:10:41,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:41,412 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 45 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:41,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2812 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:10:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2024-11-24 01:10:41,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1429. [2024-11-24 01:10:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1139 states have (on average 1.6672519754170325) internal successors, (1899), 1422 states have internal predecessors, (1899), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1909 transitions. [2024-11-24 01:10:41,444 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1909 transitions. Word has length 16 [2024-11-24 01:10:41,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:41,445 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1909 transitions. [2024-11-24 01:10:41,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1909 transitions. [2024-11-24 01:10:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-24 01:10:41,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:41,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:41,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:10:41,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:41,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:41,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2113969666, now seen corresponding path program 1 times [2024-11-24 01:10:41,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:41,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847804323] [2024-11-24 01:10:41,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:41,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:41,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847804323] [2024-11-24 01:10:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847804323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:41,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:10:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995130068] [2024-11-24 01:10:41,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:41,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:10:41,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:41,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:10:41,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:41,566 INFO L87 Difference]: Start difference. First operand 1429 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:41,604 INFO L93 Difference]: Finished difference Result 1279 states and 1679 transitions. [2024-11-24 01:10:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:10:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-24 01:10:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:41,609 INFO L225 Difference]: With dead ends: 1279 [2024-11-24 01:10:41,610 INFO L226 Difference]: Without dead ends: 1279 [2024-11-24 01:10:41,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:41,612 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 71 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:41,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1617 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:10:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-11-24 01:10:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2024-11-24 01:10:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1013 states have (on average 1.6475814412635736) internal successors, (1669), 1272 states have internal predecessors, (1669), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1679 transitions. [2024-11-24 01:10:41,639 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1679 transitions. Word has length 20 [2024-11-24 01:10:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:41,639 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1679 transitions. [2024-11-24 01:10:41,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1679 transitions. [2024-11-24 01:10:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-24 01:10:41,640 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:41,640 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] [2024-11-24 01:10:41,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 01:10:41,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:41,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash 5595258, now seen corresponding path program 1 times [2024-11-24 01:10:41,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:41,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091463886] [2024-11-24 01:10:41,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:41,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091463886] [2024-11-24 01:10:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091463886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:41,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:41,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:10:41,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510253523] [2024-11-24 01:10:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:41,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:41,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:41,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:41,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:41,741 INFO L87 Difference]: Start difference. First operand 1279 states and 1679 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:41,820 INFO L93 Difference]: Finished difference Result 1249 states and 1621 transitions. [2024-11-24 01:10:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:10:41,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-24 01:10:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:41,825 INFO L225 Difference]: With dead ends: 1249 [2024-11-24 01:10:41,825 INFO L226 Difference]: Without dead ends: 1249 [2024-11-24 01:10:41,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:41,826 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 48 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:41,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2359 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:10:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-24 01:10:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-11-24 01:10:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 997 states have (on average 1.6158475426278835) internal successors, (1611), 1242 states have internal predecessors, (1611), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1621 transitions. [2024-11-24 01:10:41,853 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1621 transitions. Word has length 22 [2024-11-24 01:10:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:41,853 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1621 transitions. [2024-11-24 01:10:41,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1621 transitions. [2024-11-24 01:10:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-24 01:10:41,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:41,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] [2024-11-24 01:10:41,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:10:41,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:41,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1582467048, now seen corresponding path program 1 times [2024-11-24 01:10:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740247687] [2024-11-24 01:10:41,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:41,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740247687] [2024-11-24 01:10:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740247687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:41,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:41,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:10:41,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837806945] [2024-11-24 01:10:41,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:41,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:41,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:41,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:41,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:41,953 INFO L87 Difference]: Start difference. First operand 1249 states and 1621 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:42,666 INFO L93 Difference]: Finished difference Result 1383 states and 1768 transitions. [2024-11-24 01:10:42,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:10:42,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-24 01:10:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:42,671 INFO L225 Difference]: With dead ends: 1383 [2024-11-24 01:10:42,671 INFO L226 Difference]: Without dead ends: 1383 [2024-11-24 01:10:42,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:42,672 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 925 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:42,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1566 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 01:10:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-24 01:10:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1245. [2024-11-24 01:10:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 997 states have (on average 1.6078234704112337) internal successors, (1603), 1238 states have internal predecessors, (1603), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1613 transitions. [2024-11-24 01:10:42,703 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1613 transitions. Word has length 36 [2024-11-24 01:10:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:42,704 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1613 transitions. [2024-11-24 01:10:42,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1613 transitions. [2024-11-24 01:10:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-24 01:10:42,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:42,705 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] [2024-11-24 01:10:42,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 01:10:42,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:42,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1582467049, now seen corresponding path program 1 times [2024-11-24 01:10:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228506272] [2024-11-24 01:10:42,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:42,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:42,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:42,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228506272] [2024-11-24 01:10:42,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228506272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:42,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:42,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:10:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199425968] [2024-11-24 01:10:42,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:42,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:42,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:42,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:42,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:42,977 INFO L87 Difference]: Start difference. First operand 1245 states and 1613 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:43,805 INFO L93 Difference]: Finished difference Result 1829 states and 2411 transitions. [2024-11-24 01:10:43,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:10:43,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-24 01:10:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:43,810 INFO L225 Difference]: With dead ends: 1829 [2024-11-24 01:10:43,810 INFO L226 Difference]: Without dead ends: 1829 [2024-11-24 01:10:43,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:43,811 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 659 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:43,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1910 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 01:10:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-11-24 01:10:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1241. [2024-11-24 01:10:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 997 states have (on average 1.5997993981945837) internal successors, (1595), 1234 states have internal predecessors, (1595), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1605 transitions. [2024-11-24 01:10:43,858 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1605 transitions. Word has length 36 [2024-11-24 01:10:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:43,858 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1605 transitions. [2024-11-24 01:10:43,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1605 transitions. [2024-11-24 01:10:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-24 01:10:43,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:43,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:43,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 01:10:43,860 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:43,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:43,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1978501923, now seen corresponding path program 1 times [2024-11-24 01:10:43,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:43,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248913223] [2024-11-24 01:10:43,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:43,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:43,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248913223] [2024-11-24 01:10:43,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248913223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:43,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:43,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:10:43,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299164811] [2024-11-24 01:10:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:43,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:43,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:43,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:43,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:43,974 INFO L87 Difference]: Start difference. First operand 1241 states and 1605 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:44,027 INFO L93 Difference]: Finished difference Result 1223 states and 1575 transitions. [2024-11-24 01:10:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:10:44,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-24 01:10:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:44,031 INFO L225 Difference]: With dead ends: 1223 [2024-11-24 01:10:44,031 INFO L226 Difference]: Without dead ends: 1223 [2024-11-24 01:10:44,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:44,033 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 27 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:44,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2330 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:10:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-24 01:10:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2024-11-24 01:10:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 979 states have (on average 1.5985699693564863) internal successors, (1565), 1216 states have internal predecessors, (1565), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1575 transitions. [2024-11-24 01:10:44,057 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1575 transitions. Word has length 62 [2024-11-24 01:10:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:44,057 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1575 transitions. [2024-11-24 01:10:44,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1575 transitions. [2024-11-24 01:10:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-24 01:10:44,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:44,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:44,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 01:10:44,060 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:44,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:44,060 INFO L85 PathProgramCache]: Analyzing trace with hash -12119383, now seen corresponding path program 1 times [2024-11-24 01:10:44,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:44,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101775756] [2024-11-24 01:10:44,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:44,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:44,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-24 01:10:44,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101775756] [2024-11-24 01:10:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101775756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:44,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:44,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:10:44,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547383792] [2024-11-24 01:10:44,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:44,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:10:44,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:44,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:10:44,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:44,239 INFO L87 Difference]: Start difference. First operand 1223 states and 1575 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:44,307 INFO L93 Difference]: Finished difference Result 1495 states and 1889 transitions. [2024-11-24 01:10:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:10:44,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-24 01:10:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:44,313 INFO L225 Difference]: With dead ends: 1495 [2024-11-24 01:10:44,313 INFO L226 Difference]: Without dead ends: 1495 [2024-11-24 01:10:44,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:44,314 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 206 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:44,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1569 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:10:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-24 01:10:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1482. [2024-11-24 01:10:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1238 states have (on average 1.5145395799676897) internal successors, (1875), 1475 states have internal predecessors, (1875), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1885 transitions. [2024-11-24 01:10:44,342 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1885 transitions. Word has length 70 [2024-11-24 01:10:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:44,342 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1885 transitions. [2024-11-24 01:10:44,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1885 transitions. [2024-11-24 01:10:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-24 01:10:44,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:44,345 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] [2024-11-24 01:10:44,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 01:10:44,345 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:44,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 836446931, now seen corresponding path program 1 times [2024-11-24 01:10:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55437793] [2024-11-24 01:10:44,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:44,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:44,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55437793] [2024-11-24 01:10:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55437793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:44,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:44,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:10:44,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100267805] [2024-11-24 01:10:44,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:44,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:10:44,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:44,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:10:44,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:10:44,910 INFO L87 Difference]: Start difference. First operand 1482 states and 1885 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:45,120 INFO L93 Difference]: Finished difference Result 2102 states and 2618 transitions. [2024-11-24 01:10:45,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:10:45,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 76 [2024-11-24 01:10:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:45,126 INFO L225 Difference]: With dead ends: 2102 [2024-11-24 01:10:45,126 INFO L226 Difference]: Without dead ends: 2099 [2024-11-24 01:10:45,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:10:45,130 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 734 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 4507 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:45,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 4507 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:10:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-11-24 01:10:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1383. [2024-11-24 01:10:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1139 states have (on average 1.533801580333626) internal successors, (1747), 1376 states have internal predecessors, (1747), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1757 transitions. [2024-11-24 01:10:45,157 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1757 transitions. Word has length 76 [2024-11-24 01:10:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:45,158 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1757 transitions. [2024-11-24 01:10:45,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1757 transitions. [2024-11-24 01:10:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-24 01:10:45,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:45,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:45,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 01:10:45,160 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:45,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash 5623378, now seen corresponding path program 1 times [2024-11-24 01:10:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:45,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642628740] [2024-11-24 01:10:45,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:45,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642628740] [2024-11-24 01:10:45,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642628740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:45,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:45,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:10:45,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303430194] [2024-11-24 01:10:45,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:45,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:10:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:45,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:10:45,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:10:45,341 INFO L87 Difference]: Start difference. First operand 1383 states and 1757 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:45,398 INFO L93 Difference]: Finished difference Result 1365 states and 1727 transitions. [2024-11-24 01:10:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:10:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-24 01:10:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:45,406 INFO L225 Difference]: With dead ends: 1365 [2024-11-24 01:10:45,408 INFO L226 Difference]: Without dead ends: 1365 [2024-11-24 01:10:45,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:45,410 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 21 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:45,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2324 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:10:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-11-24 01:10:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2024-11-24 01:10:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1121 states have (on average 1.5316681534344336) internal successors, (1717), 1358 states have internal predecessors, (1717), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1727 transitions. [2024-11-24 01:10:45,435 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1727 transitions. Word has length 78 [2024-11-24 01:10:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:45,436 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1727 transitions. [2024-11-24 01:10:45,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1727 transitions. [2024-11-24 01:10:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-24 01:10:45,437 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:45,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 01:10:45,437 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:45,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash -18190178, now seen corresponding path program 1 times [2024-11-24 01:10:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:45,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577132378] [2024-11-24 01:10:45,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:45,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:45,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577132378] [2024-11-24 01:10:45,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577132378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:45,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:45,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:10:45,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035774517] [2024-11-24 01:10:45,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:45,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:10:45,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:45,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:10:45,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:45,803 INFO L87 Difference]: Start difference. First operand 1365 states and 1727 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:46,552 INFO L93 Difference]: Finished difference Result 1364 states and 1725 transitions. [2024-11-24 01:10:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:10:46,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-24 01:10:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:46,558 INFO L225 Difference]: With dead ends: 1364 [2024-11-24 01:10:46,558 INFO L226 Difference]: Without dead ends: 1364 [2024-11-24 01:10:46,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:10:46,559 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 2 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:46,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2331 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 01:10:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-11-24 01:10:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2024-11-24 01:10:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1121 states have (on average 1.5298840321141838) internal successors, (1715), 1357 states have internal predecessors, (1715), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1725 transitions. [2024-11-24 01:10:46,590 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1725 transitions. Word has length 86 [2024-11-24 01:10:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:46,590 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1725 transitions. [2024-11-24 01:10:46,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1725 transitions. [2024-11-24 01:10:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-24 01:10:46,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:46,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] [2024-11-24 01:10:46,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 01:10:46,592 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash -18190177, now seen corresponding path program 1 times [2024-11-24 01:10:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:46,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497139100] [2024-11-24 01:10:46,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:46,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497139100] [2024-11-24 01:10:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497139100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:47,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:47,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:10:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740907430] [2024-11-24 01:10:47,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:47,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:10:47,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:47,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:10:47,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:10:47,263 INFO L87 Difference]: Start difference. First operand 1364 states and 1725 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:48,246 INFO L93 Difference]: Finished difference Result 1363 states and 1723 transitions. [2024-11-24 01:10:48,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:10:48,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-24 01:10:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:48,251 INFO L225 Difference]: With dead ends: 1363 [2024-11-24 01:10:48,251 INFO L226 Difference]: Without dead ends: 1363 [2024-11-24 01:10:48,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:10:48,252 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 1 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:48,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2257 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-24 01:10:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2024-11-24 01:10:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2024-11-24 01:10:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5308310991957104) internal successors, (1713), 1356 states have internal predecessors, (1713), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:10:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1723 transitions. [2024-11-24 01:10:48,274 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1723 transitions. Word has length 86 [2024-11-24 01:10:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:48,274 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1723 transitions. [2024-11-24 01:10:48,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:10:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1723 transitions. [2024-11-24 01:10:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 01:10:48,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:48,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:48,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 01:10:48,276 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:48,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash 785773989, now seen corresponding path program 1 times [2024-11-24 01:10:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:48,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563779070] [2024-11-24 01:10:48,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:48,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:48,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:48,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563779070] [2024-11-24 01:10:48,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563779070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:48,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:48,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:10:48,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061890059] [2024-11-24 01:10:48,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:48,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:10:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:48,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:10:48,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:10:48,607 INFO L87 Difference]: Start difference. First operand 1363 states and 1723 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:10:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:49,403 INFO L93 Difference]: Finished difference Result 1381 states and 1749 transitions. [2024-11-24 01:10:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:10:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 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 94 [2024-11-24 01:10:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:49,412 INFO L225 Difference]: With dead ends: 1381 [2024-11-24 01:10:49,415 INFO L226 Difference]: Without dead ends: 1381 [2024-11-24 01:10:49,416 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-24 01:10:49,416 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 6 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:49,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3128 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 01:10:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-24 01:10:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1372. [2024-11-24 01:10:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1127 states have (on average 1.5297249334516416) internal successors, (1724), 1363 states have internal predecessors, (1724), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-24 01:10:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1739 transitions. [2024-11-24 01:10:49,446 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1739 transitions. Word has length 94 [2024-11-24 01:10:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:49,447 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1739 transitions. [2024-11-24 01:10:49,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:10:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1739 transitions. [2024-11-24 01:10:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 01:10:49,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:49,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:49,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 01:10:49,448 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:49,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash 785773990, now seen corresponding path program 1 times [2024-11-24 01:10:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:49,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632373484] [2024-11-24 01:10:49,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:50,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-24 01:10:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632373484] [2024-11-24 01:10:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632373484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:50,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:50,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:10:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095490776] [2024-11-24 01:10:50,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:50,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:10:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:50,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:10:50,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:10:50,118 INFO L87 Difference]: Start difference. First operand 1372 states and 1739 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:10:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:51,112 INFO L93 Difference]: Finished difference Result 1372 states and 1737 transitions. [2024-11-24 01:10:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:10:51,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 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 94 [2024-11-24 01:10:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:51,116 INFO L225 Difference]: With dead ends: 1372 [2024-11-24 01:10:51,116 INFO L226 Difference]: Without dead ends: 1372 [2024-11-24 01:10:51,117 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-24 01:10:51,118 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 1 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:51,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2929 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-24 01:10:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-11-24 01:10:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2024-11-24 01:10:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1127 states have (on average 1.5279503105590062) internal successors, (1722), 1363 states have internal predecessors, (1722), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-24 01:10:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1737 transitions. [2024-11-24 01:10:51,151 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1737 transitions. Word has length 94 [2024-11-24 01:10:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:51,152 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1737 transitions. [2024-11-24 01:10:51,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:10:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1737 transitions. [2024-11-24 01:10:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 01:10:51,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:51,153 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-24 01:10:51,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-24 01:10:51,153 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:51,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash -833908986, now seen corresponding path program 1 times [2024-11-24 01:10:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:51,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561067609] [2024-11-24 01:10:51,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:51,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561067609] [2024-11-24 01:10:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561067609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603240669] [2024-11-24 01:10:51,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:51,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:51,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:51,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:51,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:10:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:52,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-24 01:10:52,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:52,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:10:52,430 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-24 01:10:52,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-24 01:10:52,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:10:52,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 01:10:52,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:10:52,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:10:52,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 01:10:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:52,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:53,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_638 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_638) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-24 01:10:53,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603240669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:53,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:10:53,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-24 01:10:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810961359] [2024-11-24 01:10:53,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:53,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:10:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:53,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:10:53,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-24 01:10:53,025 INFO L87 Difference]: Start difference. First operand 1372 states and 1737 transitions. Second operand has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:10:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:55,652 INFO L93 Difference]: Finished difference Result 1379 states and 1743 transitions. [2024-11-24 01:10:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:10:55,652 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2024-11-24 01:10:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:55,656 INFO L225 Difference]: With dead ends: 1379 [2024-11-24 01:10:55,656 INFO L226 Difference]: Without dead ends: 1379 [2024-11-24 01:10:55,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2024-11-24 01:10:55,657 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 710 mSDsluCounter, 4867 mSDsCounter, 0 mSdLazyCounter, 3358 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:55,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 5369 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3358 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-24 01:10:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-24 01:10:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2024-11-24 01:10:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1131 states have (on average 1.5251989389920424) internal successors, (1725), 1366 states have internal predecessors, (1725), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:10:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1737 transitions. [2024-11-24 01:10:55,684 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1737 transitions. Word has length 95 [2024-11-24 01:10:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:55,684 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1737 transitions. [2024-11-24 01:10:55,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:10:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1737 transitions. [2024-11-24 01:10:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 01:10:55,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:55,691 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-24 01:10:55,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 01:10:55,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:55,896 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:10:55,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:55,896 INFO L85 PathProgramCache]: Analyzing trace with hash -833908985, now seen corresponding path program 1 times [2024-11-24 01:10:55,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:55,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530693643] [2024-11-24 01:10:55,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:55,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530693643] [2024-11-24 01:10:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530693643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953223503] [2024-11-24 01:10:56,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:56,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:56,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:56,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:56,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:10:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:57,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-24 01:10:57,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:57,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:10:57,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:10:57,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:10:57,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 01:10:57,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:10:57,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 01:10:57,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 01:10:57,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:10:57,615 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:10:57,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:10:57,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:10:57,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 01:10:57,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:10:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:10:57,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:57,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_783 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-24 01:10:57,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953223503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:57,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:10:57,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-24 01:10:57,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853364537] [2024-11-24 01:10:57,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:57,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 01:10:57,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:57,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 01:10:57,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-24 01:10:57,848 INFO L87 Difference]: Start difference. First operand 1376 states and 1737 transitions. Second operand has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:00,942 INFO L93 Difference]: Finished difference Result 1378 states and 1741 transitions. [2024-11-24 01:11:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 01:11:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2024-11-24 01:11:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:00,946 INFO L225 Difference]: With dead ends: 1378 [2024-11-24 01:11:00,946 INFO L226 Difference]: Without dead ends: 1378 [2024-11-24 01:11:00,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 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-24 01:11:00,948 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 704 mSDsluCounter, 4476 mSDsCounter, 0 mSdLazyCounter, 4587 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 4981 SdHoareTripleChecker+Invalid, 4607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:00,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 4981 Invalid, 4607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4587 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-24 01:11:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-24 01:11:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1366. [2024-11-24 01:11:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1123 states have (on average 1.5262689225289403) internal successors, (1714), 1358 states have internal predecessors, (1714), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:11:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1724 transitions. [2024-11-24 01:11:00,985 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1724 transitions. Word has length 95 [2024-11-24 01:11:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:00,985 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1724 transitions. [2024-11-24 01:11:00,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1724 transitions. [2024-11-24 01:11:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-24 01:11:00,987 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:00,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:00,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 01:11:01,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:01,188 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:01,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1421785605, now seen corresponding path program 1 times [2024-11-24 01:11:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:01,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002289496] [2024-11-24 01:11:01,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:01,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:01,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002289496] [2024-11-24 01:11:01,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002289496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:01,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 01:11:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861513115] [2024-11-24 01:11:01,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:01,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:11:01,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:01,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:11:01,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:11:01,815 INFO L87 Difference]: Start difference. First operand 1366 states and 1724 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:03,404 INFO L93 Difference]: Finished difference Result 1385 states and 1749 transitions. [2024-11-24 01:11:03,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:11:03,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 1 states have call successors, (1), 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 97 [2024-11-24 01:11:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:03,408 INFO L225 Difference]: With dead ends: 1385 [2024-11-24 01:11:03,408 INFO L226 Difference]: Without dead ends: 1385 [2024-11-24 01:11:03,409 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-24 01:11:03,409 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 738 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 3938 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:03,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 3938 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-24 01:11:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-24 01:11:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1381. [2024-11-24 01:11:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1137 states have (on average 1.5224274406332454) internal successors, (1731), 1371 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1743 transitions. [2024-11-24 01:11:03,429 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1743 transitions. Word has length 97 [2024-11-24 01:11:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:03,429 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1743 transitions. [2024-11-24 01:11:03,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1743 transitions. [2024-11-24 01:11:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-24 01:11:03,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:03,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:03,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-24 01:11:03,431 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:03,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1421785606, now seen corresponding path program 1 times [2024-11-24 01:11:03,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029557388] [2024-11-24 01:11:03,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:04,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:04,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029557388] [2024-11-24 01:11:04,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029557388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:04,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:04,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:11:04,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981832013] [2024-11-24 01:11:04,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:04,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 01:11:04,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:04,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 01:11:04,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-24 01:11:04,231 INFO L87 Difference]: Start difference. First operand 1381 states and 1743 transitions. Second operand has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:05,974 INFO L93 Difference]: Finished difference Result 1384 states and 1747 transitions. [2024-11-24 01:11:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:11:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (1), 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 97 [2024-11-24 01:11:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:05,977 INFO L225 Difference]: With dead ends: 1384 [2024-11-24 01:11:05,977 INFO L226 Difference]: Without dead ends: 1384 [2024-11-24 01:11:05,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-24 01:11:05,978 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 714 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:05,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 3001 Invalid, 2615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-24 01:11:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-24 01:11:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2024-11-24 01:11:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1137 states have (on average 1.5206684256816183) internal successors, (1729), 1371 states have internal predecessors, (1729), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1741 transitions. [2024-11-24 01:11:05,996 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1741 transitions. Word has length 97 [2024-11-24 01:11:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:05,997 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1741 transitions. [2024-11-24 01:11:05,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1741 transitions. [2024-11-24 01:11:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-24 01:11:05,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:05,998 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-24 01:11:05,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-24 01:11:05,999 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -891119356, now seen corresponding path program 1 times [2024-11-24 01:11:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947654144] [2024-11-24 01:11:05,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:06,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:06,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947654144] [2024-11-24 01:11:06,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947654144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:06,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552341979] [2024-11-24 01:11:06,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:06,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:06,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:06,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:11:06,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:11:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:07,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-24 01:11:07,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:07,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:11:07,219 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-24 01:11:07,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-24 01:11:07,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:11:07,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 01:11:07,579 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:07,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:11:07,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:07,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:11:07,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 01:11:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:07,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:11:07,786 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-24 01:11:07,870 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (Array Int Int)) (v_ArrVal_1064 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1064)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:11:07,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552341979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:07,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:11:07,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-24 01:11:07,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351216551] [2024-11-24 01:11:07,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:11:07,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-24 01:11:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:07,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-24 01:11:07,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=428, Unknown=6, NotChecked=86, Total=600 [2024-11-24 01:11:07,874 INFO L87 Difference]: Start difference. First operand 1381 states and 1741 transitions. Second operand has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:10,839 INFO L93 Difference]: Finished difference Result 1383 states and 1745 transitions. [2024-11-24 01:11:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:11:10,839 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2024-11-24 01:11:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:10,842 INFO L225 Difference]: With dead ends: 1383 [2024-11-24 01:11:10,842 INFO L226 Difference]: Without dead ends: 1383 [2024-11-24 01:11:10,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=550, Unknown=6, NotChecked=98, Total=756 [2024-11-24 01:11:10,843 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 693 mSDsluCounter, 6353 mSDsCounter, 0 mSdLazyCounter, 4281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 6854 SdHoareTripleChecker+Invalid, 4294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:10,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 6854 Invalid, 4294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4281 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-24 01:11:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-24 01:11:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2024-11-24 01:11:10,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1137 states have (on average 1.5189094107299912) internal successors, (1727), 1370 states have internal predecessors, (1727), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1739 transitions. [2024-11-24 01:11:10,855 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1739 transitions. Word has length 98 [2024-11-24 01:11:10,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:10,855 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 1739 transitions. [2024-11-24 01:11:10,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1739 transitions. [2024-11-24 01:11:10,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-24 01:11:10,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:10,857 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-24 01:11:10,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 01:11:11,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:11,057 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:11,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash -891119355, now seen corresponding path program 1 times [2024-11-24 01:11:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:11,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084615049] [2024-11-24 01:11:11,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:11,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:11,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084615049] [2024-11-24 01:11:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084615049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521935798] [2024-11-24 01:11:11,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:11,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:11,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:11,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:11:12,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 01:11:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:12,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-24 01:11:12,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:12,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:11:12,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 01:11:12,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:11:12,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:11:12,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:11:12,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 01:11:12,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 01:11:12,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:11:12,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:12,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:11:12,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:11:12,769 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:12,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:11:12,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:11:12,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 01:11:12,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:11:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:12,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:11:12,964 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1220 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-24 01:11:13,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1226) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1225))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1226) .cse1 v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-24 01:11:13,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521935798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:13,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:11:13,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2024-11-24 01:11:13,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79910911] [2024-11-24 01:11:13,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:11:13,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-24 01:11:13,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:13,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-24 01:11:13,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=306, Unknown=15, NotChecked=74, Total=462 [2024-11-24 01:11:13,031 INFO L87 Difference]: Start difference. First operand 1380 states and 1739 transitions. Second operand has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:16,033 INFO L93 Difference]: Finished difference Result 1382 states and 1743 transitions. [2024-11-24 01:11:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:11:16,036 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2024-11-24 01:11:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:16,039 INFO L225 Difference]: With dead ends: 1382 [2024-11-24 01:11:16,039 INFO L226 Difference]: Without dead ends: 1382 [2024-11-24 01:11:16,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=488, Unknown=15, NotChecked=94, Total=702 [2024-11-24 01:11:16,040 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 698 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 4400 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 5078 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:16,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 5078 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4400 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-24 01:11:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-24 01:11:16,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1364. [2024-11-24 01:11:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1123 states have (on average 1.522707034728406) internal successors, (1710), 1356 states have internal predecessors, (1710), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:11:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1720 transitions. [2024-11-24 01:11:16,062 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1720 transitions. Word has length 98 [2024-11-24 01:11:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:16,062 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1720 transitions. [2024-11-24 01:11:16,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1720 transitions. [2024-11-24 01:11:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-24 01:11:16,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:16,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:16,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-24 01:11:16,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:16,269 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:16,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -551865140, now seen corresponding path program 1 times [2024-11-24 01:11:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:16,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302411643] [2024-11-24 01:11:16,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302411643] [2024-11-24 01:11:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302411643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 01:11:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025902018] [2024-11-24 01:11:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:16,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 01:11:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:16,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 01:11:16,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-24 01:11:16,890 INFO L87 Difference]: Start difference. First operand 1364 states and 1720 transitions. Second operand has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:18,473 INFO L93 Difference]: Finished difference Result 1389 states and 1751 transitions. [2024-11-24 01:11:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:11:18,473 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-24 01:11:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:18,476 INFO L225 Difference]: With dead ends: 1389 [2024-11-24 01:11:18,476 INFO L226 Difference]: Without dead ends: 1389 [2024-11-24 01:11:18,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-24 01:11:18,477 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 741 mSDsluCounter, 3431 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 3932 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:18,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 3932 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-24 01:11:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-24 01:11:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1385. [2024-11-24 01:11:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1143 states have (on average 1.5161854768153982) internal successors, (1733), 1375 states have internal predecessors, (1733), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1745 transitions. [2024-11-24 01:11:18,493 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1745 transitions. Word has length 100 [2024-11-24 01:11:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:18,494 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1745 transitions. [2024-11-24 01:11:18,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1745 transitions. [2024-11-24 01:11:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-24 01:11:18,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:18,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:18,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-24 01:11:18,495 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:18,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash -551865139, now seen corresponding path program 1 times [2024-11-24 01:11:18,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:18,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916175313] [2024-11-24 01:11:18,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:19,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916175313] [2024-11-24 01:11:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916175313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 01:11:19,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911500124] [2024-11-24 01:11:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:11:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:19,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:11:19,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:11:19,434 INFO L87 Difference]: Start difference. First operand 1385 states and 1745 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:21,662 INFO L93 Difference]: Finished difference Result 1388 states and 1749 transitions. [2024-11-24 01:11:21,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:11:21,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-24 01:11:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:21,668 INFO L225 Difference]: With dead ends: 1388 [2024-11-24 01:11:21,670 INFO L226 Difference]: Without dead ends: 1388 [2024-11-24 01:11:21,670 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-24 01:11:21,670 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 716 mSDsluCounter, 3333 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3838 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:21,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3838 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-24 01:11:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-24 01:11:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1385. [2024-11-24 01:11:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1143 states have (on average 1.5144356955380578) internal successors, (1731), 1375 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1743 transitions. [2024-11-24 01:11:21,687 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1743 transitions. Word has length 100 [2024-11-24 01:11:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:21,687 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1743 transitions. [2024-11-24 01:11:21,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1743 transitions. [2024-11-24 01:11:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-24 01:11:21,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:21,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:21,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-24 01:11:21,688 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:21,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash -143228563, now seen corresponding path program 1 times [2024-11-24 01:11:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:21,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019664183] [2024-11-24 01:11:21,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:22,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019664183] [2024-11-24 01:11:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019664183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577764122] [2024-11-24 01:11:22,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:22,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:22,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:22,378 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:11:22,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 01:11:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:22,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-24 01:11:22,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:22,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:11:22,988 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:11:22,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:11:23,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-24 01:11:23,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-24 01:11:23,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 16 treesize of output 8 [2024-11-24 01:11:23,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-24 01:11:23,293 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-24 01:11:23,293 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 38 treesize of output 41 [2024-11-24 01:11:23,314 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-24 01:11:23,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 34 [2024-11-24 01:11:23,336 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 35 treesize of output 29 [2024-11-24 01:11:23,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:11:23,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 66 [2024-11-24 01:11:23,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:11:23,562 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 41 treesize of output 31 [2024-11-24 01:11:23,605 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 17 treesize of output 9 [2024-11-24 01:11:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:23,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:11:23,630 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2024-11-24 01:11:23,630 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 28 treesize of output 27 [2024-11-24 01:11:23,867 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2024-11-24 01:11:23,867 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 821 treesize of output 707 [2024-11-24 01:11:23,876 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 193 treesize of output 145 [2024-11-24 01:11:23,881 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 134 treesize of output 110 [2024-11-24 01:11:24,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577764122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:24,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:11:24,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-11-24 01:11:24,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913896128] [2024-11-24 01:11:24,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:11:24,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-24 01:11:24,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:24,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-24 01:11:24,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=950, Unknown=1, NotChecked=0, Total=1056 [2024-11-24 01:11:24,053 INFO L87 Difference]: Start difference. First operand 1385 states and 1743 transitions. Second operand has 28 states, 25 states have (on average 7.64) internal successors, (191), 26 states have internal predecessors, (191), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:27,818 INFO L93 Difference]: Finished difference Result 1683 states and 2116 transitions. [2024-11-24 01:11:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-24 01:11:27,818 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 7.64) internal successors, (191), 26 states have internal predecessors, (191), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2024-11-24 01:11:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:27,822 INFO L225 Difference]: With dead ends: 1683 [2024-11-24 01:11:27,823 INFO L226 Difference]: Without dead ends: 1683 [2024-11-24 01:11:27,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=259, Invalid=1810, Unknown=1, NotChecked=0, Total=2070 [2024-11-24 01:11:27,824 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1572 mSDsluCounter, 8734 mSDsCounter, 0 mSdLazyCounter, 5552 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 9247 SdHoareTripleChecker+Invalid, 5588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 5552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:27,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 9247 Invalid, 5588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 5552 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-24 01:11:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-24 01:11:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1384. [2024-11-24 01:11:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1143 states have (on average 1.5126859142607174) internal successors, (1729), 1374 states have internal predecessors, (1729), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1741 transitions. [2024-11-24 01:11:27,844 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1741 transitions. Word has length 101 [2024-11-24 01:11:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:27,844 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1741 transitions. [2024-11-24 01:11:27,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 7.64) internal successors, (191), 26 states have internal predecessors, (191), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1741 transitions. [2024-11-24 01:11:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-24 01:11:27,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:27,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, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:27,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 01:11:28,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:28,046 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:28,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash -143228562, now seen corresponding path program 1 times [2024-11-24 01:11:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:28,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154082538] [2024-11-24 01:11:28,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154082538] [2024-11-24 01:11:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154082538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940903999] [2024-11-24 01:11:29,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:29,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:29,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:29,106 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:11:29,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 01:11:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:29,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-24 01:11:29,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:29,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:11:29,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 01:11:29,522 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:11:29,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:11:29,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:11:29,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:11:29,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 01:11:29,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:11:29,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:29,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:11:29,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:11:29,861 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:29,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:11:29,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:11:29,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:29,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:11:29,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-24 01:11:30,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 01:11:30,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-24 01:11:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:30,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:11:30,401 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1702))) (or (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1703))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))) (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1702))) (or (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1705 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))))))) is different from false [2024-11-24 01:11:30,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1711))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1710) .cse5 v_ArrVal_1702))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1703))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1711))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1710) .cse8 v_ArrVal_1702))) (or (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1705 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))))) is different from false [2024-11-24 01:11:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940903999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:30,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:11:30,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-24 01:11:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390552922] [2024-11-24 01:11:30,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:11:30,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-24 01:11:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:30,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-24 01:11:30,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=652, Unknown=10, NotChecked=106, Total=870 [2024-11-24 01:11:30,519 INFO L87 Difference]: Start difference. First operand 1384 states and 1741 transitions. Second operand has 23 states, 20 states have (on average 8.05) internal successors, (161), 23 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:35,101 INFO L93 Difference]: Finished difference Result 1386 states and 1745 transitions. [2024-11-24 01:11:35,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:11:35,101 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.05) internal successors, (161), 23 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2024-11-24 01:11:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:35,104 INFO L225 Difference]: With dead ends: 1386 [2024-11-24 01:11:35,105 INFO L226 Difference]: Without dead ends: 1386 [2024-11-24 01:11:35,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=953, Unknown=10, NotChecked=130, Total=1260 [2024-11-24 01:11:35,106 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 701 mSDsluCounter, 6013 mSDsCounter, 0 mSdLazyCounter, 6193 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 6516 SdHoareTripleChecker+Invalid, 6209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 6193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:35,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 6516 Invalid, 6209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 6193 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-24 01:11:35,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-24 01:11:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1362. [2024-11-24 01:11:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1123 states have (on average 1.5191451469278718) internal successors, (1706), 1354 states have internal predecessors, (1706), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:11:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1716 transitions. [2024-11-24 01:11:35,124 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1716 transitions. Word has length 101 [2024-11-24 01:11:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:35,125 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1716 transitions. [2024-11-24 01:11:35,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.05) internal successors, (161), 23 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1716 transitions. [2024-11-24 01:11:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 01:11:35,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:35,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:35,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-24 01:11:35,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:35,327 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:35,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash 521079756, now seen corresponding path program 1 times [2024-11-24 01:11:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:35,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507231685] [2024-11-24 01:11:35,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:35,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:35,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507231685] [2024-11-24 01:11:35,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507231685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:35,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:35,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 01:11:35,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930788169] [2024-11-24 01:11:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:35,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 01:11:35,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:35,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 01:11:35,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:11:35,875 INFO L87 Difference]: Start difference. First operand 1362 states and 1716 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:37,435 INFO L93 Difference]: Finished difference Result 1393 states and 1753 transitions. [2024-11-24 01:11:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 01:11:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-24 01:11:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:37,438 INFO L225 Difference]: With dead ends: 1393 [2024-11-24 01:11:37,438 INFO L226 Difference]: Without dead ends: 1393 [2024-11-24 01:11:37,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-24 01:11:37,439 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 741 mSDsluCounter, 3895 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 4398 SdHoareTripleChecker+Invalid, 2742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:37,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 4398 Invalid, 2742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-24 01:11:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-11-24 01:11:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1389. [2024-11-24 01:11:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1149 states have (on average 1.5100087032201914) internal successors, (1735), 1379 states have internal predecessors, (1735), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1747 transitions. [2024-11-24 01:11:37,465 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1747 transitions. Word has length 103 [2024-11-24 01:11:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:37,465 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1747 transitions. [2024-11-24 01:11:37,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1747 transitions. [2024-11-24 01:11:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 01:11:37,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:37,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:37,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-24 01:11:37,467 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:37,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash 521079757, now seen corresponding path program 1 times [2024-11-24 01:11:37,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750997340] [2024-11-24 01:11:37,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:38,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-24 01:11:38,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:38,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750997340] [2024-11-24 01:11:38,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750997340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:38,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:38,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 01:11:38,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713993978] [2024-11-24 01:11:38,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:38,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 01:11:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:38,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 01:11:38,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:11:38,482 INFO L87 Difference]: Start difference. First operand 1389 states and 1747 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:40,457 INFO L93 Difference]: Finished difference Result 1392 states and 1751 transitions. [2024-11-24 01:11:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 01:11:40,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-24 01:11:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:40,461 INFO L225 Difference]: With dead ends: 1392 [2024-11-24 01:11:40,461 INFO L226 Difference]: Without dead ends: 1392 [2024-11-24 01:11:40,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:11:40,462 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 716 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 3014 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:40,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3381 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3014 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-24 01:11:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-24 01:11:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1389. [2024-11-24 01:11:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1149 states have (on average 1.5082680591818973) internal successors, (1733), 1379 states have internal predecessors, (1733), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1745 transitions. [2024-11-24 01:11:40,485 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1745 transitions. Word has length 103 [2024-11-24 01:11:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:40,485 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1745 transitions. [2024-11-24 01:11:40,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1745 transitions. [2024-11-24 01:11:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-24 01:11:40,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:40,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:40,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-24 01:11:40,487 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:40,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2018938997, now seen corresponding path program 1 times [2024-11-24 01:11:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996092529] [2024-11-24 01:11:40,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:41,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996092529] [2024-11-24 01:11:41,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996092529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464686967] [2024-11-24 01:11:41,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:41,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:41,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:41,284 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:11:41,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 01:11:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:41,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-24 01:11:41,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:41,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:11:41,758 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-24 01:11:41,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-24 01:11:41,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:11:41,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 01:11:42,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:42,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:11:42,214 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:42,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:11:42,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:42,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:11:42,380 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:42,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:11:42,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 01:11:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:42,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:11:42,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2045 (Array Int Int)) (v_ArrVal_2042 (Array Int Int)) (v_ArrVal_2041 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2045))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2040)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2041)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2042)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:11:42,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464686967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:42,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:11:42,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-24 01:11:42,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032489410] [2024-11-24 01:11:42,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:11:42,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-24 01:11:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:42,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-24 01:11:42,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=772, Unknown=84, NotChecked=60, Total=1056 [2024-11-24 01:11:42,875 INFO L87 Difference]: Start difference. First operand 1389 states and 1745 transitions. Second operand has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:46,364 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2024-11-24 01:11:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:11:46,364 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-24 01:11:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:46,367 INFO L225 Difference]: With dead ends: 1391 [2024-11-24 01:11:46,367 INFO L226 Difference]: Without dead ends: 1391 [2024-11-24 01:11:46,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=943, Unknown=87, NotChecked=66, Total=1260 [2024-11-24 01:11:46,367 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 683 mSDsluCounter, 8250 mSDsCounter, 0 mSdLazyCounter, 5516 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 8749 SdHoareTripleChecker+Invalid, 5528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:46,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 8749 Invalid, 5528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5516 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-24 01:11:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2024-11-24 01:11:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1388. [2024-11-24 01:11:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1149 states have (on average 1.5065274151436032) internal successors, (1731), 1378 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1743 transitions. [2024-11-24 01:11:46,381 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1743 transitions. Word has length 104 [2024-11-24 01:11:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:46,381 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1743 transitions. [2024-11-24 01:11:46,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1743 transitions. [2024-11-24 01:11:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-24 01:11:46,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:46,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:46,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-24 01:11:46,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-24 01:11:46,587 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:46,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:46,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2018938996, now seen corresponding path program 1 times [2024-11-24 01:11:46,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:46,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543726004] [2024-11-24 01:11:46,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:47,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:47,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543726004] [2024-11-24 01:11:47,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543726004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:47,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156585580] [2024-11-24 01:11:47,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:47,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:47,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:47,715 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:11:47,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-24 01:11:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:48,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-24 01:11:48,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:48,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:11:48,174 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:11:48,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:11:48,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 01:11:48,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:11:48,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:11:48,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 01:11:48,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:11:48,437 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:48,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:11:48,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:11:48,538 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:48,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:11:48,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:11:48,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:48,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:11:48,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-24 01:11:48,749 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:11:48,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 01:11:48,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-24 01:11:48,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 30 treesize of output 12 [2024-11-24 01:11:48,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 01:11:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:48,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:11:48,898 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2226 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-24 01:11:48,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2226 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-24 01:11:49,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2222 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_2222))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_2223))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store .cse0 .cse2 v_ArrVal_2225) (select (select (store .cse3 .cse2 v_ArrVal_2224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2226))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) (forall ((v_ArrVal_2222 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_2222))) (or (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_2223))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2224))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store .cse5 .cse6 v_ArrVal_2225) .cse7 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-24 01:11:49,365 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2232))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2233) .cse5 v_ArrVal_2222))) (or (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_2223))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_ArrVal_2225) (select (select (store .cse2 .cse1 v_ArrVal_2224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2226))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) 0)))))) (forall ((v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2232))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2233) .cse12 v_ArrVal_2222))) (or (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (let ((.cse10 (store .cse11 .cse12 v_ArrVal_2223))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2224))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store .cse6 .cse7 v_ArrVal_2225) .cse8 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_2227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) 0)))))))) is different from false [2024-11-24 01:11:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156585580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:49,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:11:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-11-24 01:11:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359705928] [2024-11-24 01:11:49,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:11:49,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-24 01:11:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:49,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-24 01:11:49,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=757, Unknown=9, NotChecked=236, Total=1122 [2024-11-24 01:11:49,372 INFO L87 Difference]: Start difference. First operand 1388 states and 1743 transitions. Second operand has 25 states, 22 states have (on average 7.590909090909091) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:52,574 INFO L93 Difference]: Finished difference Result 1390 states and 1747 transitions. [2024-11-24 01:11:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:11:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.590909090909091) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-24 01:11:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:52,578 INFO L225 Difference]: With dead ends: 1390 [2024-11-24 01:11:52,580 INFO L226 Difference]: Without dead ends: 1390 [2024-11-24 01:11:52,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=197, Invalid=1142, Unknown=9, NotChecked=292, Total=1640 [2024-11-24 01:11:52,582 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 699 mSDsluCounter, 4481 mSDsCounter, 0 mSdLazyCounter, 4568 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 4983 SdHoareTripleChecker+Invalid, 4587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:52,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 4983 Invalid, 4587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4568 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-24 01:11:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-24 01:11:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1360. [2024-11-24 01:11:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1123 states have (on average 1.5155832591273375) internal successors, (1702), 1352 states have internal predecessors, (1702), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:11:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1712 transitions. [2024-11-24 01:11:52,597 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1712 transitions. Word has length 104 [2024-11-24 01:11:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:52,598 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1712 transitions. [2024-11-24 01:11:52,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.590909090909091) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:11:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1712 transitions. [2024-11-24 01:11:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-24 01:11:52,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:52,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:52,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-24 01:11:52,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:52,800 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:52,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1492774642, now seen corresponding path program 1 times [2024-11-24 01:11:52,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:52,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713771310] [2024-11-24 01:11:52,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:52,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:53,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-24 01:11:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:53,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713771310] [2024-11-24 01:11:53,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713771310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:53,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:53,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 01:11:53,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937124413] [2024-11-24 01:11:53,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:53,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:11:53,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:53,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:11:53,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:11:53,556 INFO L87 Difference]: Start difference. First operand 1360 states and 1712 transitions. Second operand has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:54,839 INFO L93 Difference]: Finished difference Result 1399 states and 1757 transitions. [2024-11-24 01:11:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 01:11:54,840 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-24 01:11:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:54,843 INFO L225 Difference]: With dead ends: 1399 [2024-11-24 01:11:54,843 INFO L226 Difference]: Without dead ends: 1399 [2024-11-24 01:11:54,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-24 01:11:54,844 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 721 mSDsluCounter, 2910 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 3412 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:54,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 3412 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 01:11:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2024-11-24 01:11:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1395. [2024-11-24 01:11:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1157 states have (on average 1.5030250648228176) internal successors, (1739), 1385 states have internal predecessors, (1739), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1751 transitions. [2024-11-24 01:11:54,860 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1751 transitions. Word has length 107 [2024-11-24 01:11:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:54,860 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1751 transitions. [2024-11-24 01:11:54,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1751 transitions. [2024-11-24 01:11:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-24 01:11:54,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:54,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:54,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-24 01:11:54,862 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:54,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:54,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1492774641, now seen corresponding path program 1 times [2024-11-24 01:11:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:54,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626291815] [2024-11-24 01:11:54,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:54,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:56,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:56,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626291815] [2024-11-24 01:11:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626291815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:56,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:56,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-24 01:11:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403547990] [2024-11-24 01:11:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:56,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 01:11:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:56,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 01:11:56,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-24 01:11:56,230 INFO L87 Difference]: Start difference. First operand 1395 states and 1751 transitions. Second operand has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:58,657 INFO L93 Difference]: Finished difference Result 1398 states and 1755 transitions. [2024-11-24 01:11:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:11:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-24 01:11:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:58,661 INFO L225 Difference]: With dead ends: 1398 [2024-11-24 01:11:58,661 INFO L226 Difference]: Without dead ends: 1398 [2024-11-24 01:11:58,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-24 01:11:58,662 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 717 mSDsluCounter, 3710 mSDsCounter, 0 mSdLazyCounter, 3782 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 3797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:58,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 4210 Invalid, 3797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3782 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-24 01:11:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-11-24 01:11:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1395. [2024-11-24 01:11:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1157 states have (on average 1.501296456352636) internal successors, (1737), 1385 states have internal predecessors, (1737), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:11:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1749 transitions. [2024-11-24 01:11:58,681 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1749 transitions. Word has length 107 [2024-11-24 01:11:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:58,681 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1749 transitions. [2024-11-24 01:11:58,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:11:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1749 transitions. [2024-11-24 01:11:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-24 01:11:58,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:58,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:58,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-24 01:11:58,683 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:11:58,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1338344115, now seen corresponding path program 1 times [2024-11-24 01:11:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:58,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478365743] [2024-11-24 01:11:58,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:59,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:59,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478365743] [2024-11-24 01:11:59,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478365743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:59,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919415824] [2024-11-24 01:11:59,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:59,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:11:59,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:59,668 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:11:59,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-24 01:11:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:12:00,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-24 01:12:00,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:12:00,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:12:00,292 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-24 01:12:00,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-24 01:12:00,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:12:00,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:12:00,421 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 19 treesize of output 7 [2024-11-24 01:12:00,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 01:12:00,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:12:00,696 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 47 treesize of output 31 [2024-11-24 01:12:00,933 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-24 01:12:00,933 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 57 treesize of output 48 [2024-11-24 01:12:01,103 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:12:01,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:12:01,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:12:01,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:12:01,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:12:01,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 01:12:01,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 01:12:01,480 INFO L349 Elim1Store]: treesize reduction 88, result has 19.3 percent of original size [2024-11-24 01:12:01,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2024-11-24 01:12:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:12:01,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:12:01,596 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2599 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2599) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-24 01:12:01,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2599 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2599) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-24 01:12:01,728 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2598 (Array Int Int)) (v_ArrVal_2597 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2597))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2598)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2599)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:12:01,815 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2598 (Array Int Int)) (v_ArrVal_2597 (Array Int Int)) (v_ArrVal_2596 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2596))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2597)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2598)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2599)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:12:01,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2598 (Array Int Int)) (v_ArrVal_2597 (Array Int Int)) (v_ArrVal_2596 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2596))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2597)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2598)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2599)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:12:02,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919415824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:12:02,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:12:02,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2024-11-24 01:12:02,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719470168] [2024-11-24 01:12:02,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:12:02,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-24 01:12:02,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:12:02,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-24 01:12:02,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=902, Unknown=66, NotChecked=340, Total=1482 [2024-11-24 01:12:02,059 INFO L87 Difference]: Start difference. First operand 1395 states and 1749 transitions. Second operand has 30 states, 27 states have (on average 7.62962962962963) internal successors, (206), 30 states have internal predecessors, (206), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:12:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:12:06,356 INFO L93 Difference]: Finished difference Result 1702 states and 2133 transitions. [2024-11-24 01:12:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-24 01:12:06,359 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 7.62962962962963) internal successors, (206), 30 states have internal predecessors, (206), 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 108 [2024-11-24 01:12:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:12:06,365 INFO L225 Difference]: With dead ends: 1702 [2024-11-24 01:12:06,365 INFO L226 Difference]: Without dead ends: 1702 [2024-11-24 01:12:06,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=228, Invalid=1207, Unknown=67, NotChecked=390, Total=1892 [2024-11-24 01:12:06,367 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 1515 mSDsluCounter, 7227 mSDsCounter, 0 mSdLazyCounter, 4714 mSolverCounterSat, 28 mSolverCounterUnsat, 109 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 7741 SdHoareTripleChecker+Invalid, 4851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4714 IncrementalHoareTripleChecker+Invalid, 109 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:12:06,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 7741 Invalid, 4851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4714 Invalid, 109 Unknown, 0 Unchecked, 4.0s Time] [2024-11-24 01:12:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2024-11-24 01:12:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1394. [2024-11-24 01:12:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1157 states have (on average 1.4995678478824546) internal successors, (1735), 1384 states have internal predecessors, (1735), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:12:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1747 transitions. [2024-11-24 01:12:06,386 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1747 transitions. Word has length 108 [2024-11-24 01:12:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:12:06,387 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1747 transitions. [2024-11-24 01:12:06,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 7.62962962962963) internal successors, (206), 30 states have internal predecessors, (206), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:12:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1747 transitions. [2024-11-24 01:12:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-24 01:12:06,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:12:06,388 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-24 01:12:06,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-24 01:12:06,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-24 01:12:06,589 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:12:06,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:12:06,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1338344114, now seen corresponding path program 1 times [2024-11-24 01:12:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:12:06,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538870468] [2024-11-24 01:12:06,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:12:06,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:12:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:12:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:12:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:12:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538870468] [2024-11-24 01:12:07,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538870468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:12:07,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915488159] [2024-11-24 01:12:07,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:12:07,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:12:07,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:12:07,818 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:12:07,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-24 01:12:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:12:08,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-24 01:12:08,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:12:08,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:12:08,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 01:12:08,302 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-24 01:12:08,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-24 01:12:08,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 01:12:08,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:12:08,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-24 01:12:08,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:12:08,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:12:08,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 01:12:08,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:12:08,829 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:12:08,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 73 treesize of output 66 [2024-11-24 01:12:08,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:12:08,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:12:08,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 01:12:08,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:12:09,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:12:09,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 01:12:09,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:12:09,164 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:12:09,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 01:12:09,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:12:09,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-24 01:12:09,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:12:09,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:12:09,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-24 01:12:09,291 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-24 01:12:09,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-24 01:12:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:12:09,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:12:10,551 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2795))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2797))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2794) .cse0 v_ArrVal_2796) .cse1 v_ArrVal_2799) (select (select (store .cse2 .cse1 v_ArrVal_2798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2801))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2802 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2795))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2797))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2798))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2794) .cse5 v_ArrVal_2796) .cse6 v_ArrVal_2799) .cse7 v_ArrVal_2801) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2802) (select (select (store .cse8 .cse7 v_ArrVal_2800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-24 01:12:10,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2795))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2797))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2794) .cse1 v_ArrVal_2796) .cse2 v_ArrVal_2799) (select (select (store .cse3 .cse2 v_ArrVal_2798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2801))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2802 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2795))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2797))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2798))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2794) .cse6 v_ArrVal_2796) .cse7 v_ArrVal_2799) .cse8 v_ArrVal_2801) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2802) (select (select (store .cse9 .cse8 v_ArrVal_2800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-24 01:12:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915488159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:12:19,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:12:19,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 28 [2024-11-24 01:12:19,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309636791] [2024-11-24 01:12:19,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:12:19,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-24 01:12:19,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:12:19,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-24 01:12:19,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1253, Unknown=46, NotChecked=150, Total=1640 [2024-11-24 01:12:19,165 INFO L87 Difference]: Start difference. First operand 1394 states and 1747 transitions. Second operand has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:12:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:12:52,891 INFO L93 Difference]: Finished difference Result 1396 states and 1751 transitions. [2024-11-24 01:12:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-24 01:12:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 states have internal predecessors, (174), 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 108 [2024-11-24 01:12:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:12:52,894 INFO L225 Difference]: With dead ends: 1396 [2024-11-24 01:12:52,894 INFO L226 Difference]: Without dead ends: 1396 [2024-11-24 01:12:52,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=219, Invalid=1465, Unknown=46, NotChecked=162, Total=1892 [2024-11-24 01:12:52,895 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 675 mSDsluCounter, 5215 mSDsCounter, 0 mSdLazyCounter, 5372 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 5713 SdHoareTripleChecker+Invalid, 5389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:12:52,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 5713 Invalid, 5389 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [17 Valid, 5372 Invalid, 0 Unknown, 0 Unchecked, 32.8s Time] [2024-11-24 01:12:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-24 01:12:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1358. [2024-11-24 01:12:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1123 states have (on average 1.5120213713268031) internal successors, (1698), 1350 states have internal predecessors, (1698), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:12:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1708 transitions. [2024-11-24 01:12:52,906 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1708 transitions. Word has length 108 [2024-11-24 01:12:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:12:52,906 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1708 transitions. [2024-11-24 01:12:52,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:12:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1708 transitions. [2024-11-24 01:12:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-24 01:12:52,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:12:52,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:12:52,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-24 01:12:53,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-24 01:12:53,108 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:12:53,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:12:53,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1157305735, now seen corresponding path program 1 times [2024-11-24 01:12:53,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:12:53,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815571018] [2024-11-24 01:12:53,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:12:53,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:12:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:12:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:12:53,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:12:53,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815571018] [2024-11-24 01:12:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815571018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:12:53,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:12:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:12:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855372457] [2024-11-24 01:12:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:12:53,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:12:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:12:53,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:12:53,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:12:53,737 INFO L87 Difference]: Start difference. First operand 1358 states and 1708 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:12:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:12:59,798 INFO L93 Difference]: Finished difference Result 1357 states and 1706 transitions. [2024-11-24 01:12:59,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:12:59,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-24 01:12:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:12:59,800 INFO L225 Difference]: With dead ends: 1357 [2024-11-24 01:12:59,800 INFO L226 Difference]: Without dead ends: 1357 [2024-11-24 01:12:59,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:12:59,801 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 2 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:12:59,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2927 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-24 01:12:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2024-11-24 01:12:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2024-11-24 01:12:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1123 states have (on average 1.510240427426536) internal successors, (1696), 1349 states have internal predecessors, (1696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:12:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1706 transitions. [2024-11-24 01:12:59,818 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1706 transitions. Word has length 110 [2024-11-24 01:12:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:12:59,818 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1706 transitions. [2024-11-24 01:12:59,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:12:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1706 transitions. [2024-11-24 01:12:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-24 01:12:59,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:12:59,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:12:59,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-24 01:12:59,820 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:12:59,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:12:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1157305734, now seen corresponding path program 1 times [2024-11-24 01:12:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:12:59,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192099966] [2024-11-24 01:12:59,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:12:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:12:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:13:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:13:04,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:13:04,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192099966] [2024-11-24 01:13:04,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192099966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:13:04,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:13:04,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 01:13:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090229977] [2024-11-24 01:13:04,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:13:04,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:13:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:13:04,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:13:04,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:13:04,081 INFO L87 Difference]: Start difference. First operand 1357 states and 1706 transitions. Second operand has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:13:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:13:38,323 INFO L93 Difference]: Finished difference Result 1401 states and 1755 transitions. [2024-11-24 01:13:38,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-24 01:13:38,324 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-24 01:13:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:13:38,326 INFO L225 Difference]: With dead ends: 1401 [2024-11-24 01:13:38,326 INFO L226 Difference]: Without dead ends: 1401 [2024-11-24 01:13:38,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-24 01:13:38,326 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 716 mSDsluCounter, 5201 mSDsCounter, 0 mSdLazyCounter, 5381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 5700 SdHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:13:38,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 5700 Invalid, 5395 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 5381 Invalid, 0 Unknown, 0 Unchecked, 32.6s Time] [2024-11-24 01:13:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2024-11-24 01:13:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1398. [2024-11-24 01:13:38,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1163 states have (on average 1.4935511607910577) internal successors, (1737), 1388 states have internal predecessors, (1737), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-24 01:13:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1749 transitions. [2024-11-24 01:13:38,341 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1749 transitions. Word has length 110 [2024-11-24 01:13:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:13:38,341 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1749 transitions. [2024-11-24 01:13:38,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:13:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1749 transitions. [2024-11-24 01:13:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-24 01:13:38,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:13:38,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:13:38,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-24 01:13:38,342 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:13:38,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:13:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash -427449893, now seen corresponding path program 1 times [2024-11-24 01:13:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:13:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375242523] [2024-11-24 01:13:38,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:13:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:13:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:13:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:13:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:13:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375242523] [2024-11-24 01:13:42,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375242523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:13:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393083846] [2024-11-24 01:13:42,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:13:42,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:13:42,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:13:42,511 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:13:42,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-24 01:13:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:13:42,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-24 01:13:42,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:13:42,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:13:43,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 01:13:43,963 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-24 01:13:43,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-24 01:13:44,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:13:44,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:13:45,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-24 01:13:45,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 01:13:46,261 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:13:46,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 01:13:46,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:13:47,127 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:13:47,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 01:13:47,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:13:47,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:13:47,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 01:13:47,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:13:48,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:13:48,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 01:13:48,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:13:48,975 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:13:48,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 01:13:48,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 01:13:49,755 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-24 01:13:49,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-24 01:13:49,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-24 01:13:50,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:13:50,196 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 88 treesize of output 79 [2024-11-24 01:13:50,249 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 52 treesize of output 16 [2024-11-24 01:13:50,831 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 44 treesize of output 20 [2024-11-24 01:13:50,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 35 treesize of output 13 [2024-11-24 01:13:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:13:50,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:13:55,177 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3205 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3203 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3206 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem60#1.offset_11| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3201))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3202) .cse5 v_ArrVal_3203))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3204))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ 43 (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem60#1.offset_11| v_ArrVal_3208)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3205) (select (select (store .cse3 .cse1 v_ArrVal_3206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< |v_ULTIMATE.start_main_#t~mem60#1.offset_11| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem60#1.offset_11|) (< v_ArrVal_3208 0)))))))) is different from false [2024-11-24 01:13:56,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3205 Int) (v_ArrVal_3200 (Array Int Int)) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3203 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3206 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem60#1.offset_11| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3200))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3201))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3199) .cse7 v_ArrVal_3202) .cse5 v_ArrVal_3203))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem60#1.offset_11|) (< |v_ULTIMATE.start_main_#t~mem60#1.offset_11| 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3204))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_main_#t~mem60#1.offset_11| v_ArrVal_3208)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3205) (select (select (store .cse3 .cse2 v_ArrVal_3206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (< v_ArrVal_3208 0)))))))))) is different from false [2024-11-24 01:13:56,393 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3205 Int) (|v_ULTIMATE.start_main_#t~mem60#1.offset_11| Int) (v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int)) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3203 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3197)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3200))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3201))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3198) .cse6 v_ArrVal_3199) .cse7 v_ArrVal_3202) .cse5 v_ArrVal_3203))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem60#1.offset_11|) (< |v_ULTIMATE.start_main_#t~mem60#1.offset_11| 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3204))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 43 (select (select (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_main_#t~mem60#1.offset_11| v_ArrVal_3208)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3205) (select (select (store .cse3 .cse2 v_ArrVal_3206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (< v_ArrVal_3208 0)))))))))) is different from false [2024-11-24 01:13:56,537 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3205 Int) (|v_ULTIMATE.start_main_#t~mem60#1.offset_11| Int) (v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int)) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3203 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3197))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3200))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3201))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3198) .cse7 v_ArrVal_3199) .cse8 v_ArrVal_3202) .cse5 v_ArrVal_3203))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3204))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem60#1.offset_11| v_ArrVal_3208)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3205) (select (select (store .cse3 .cse1 v_ArrVal_3206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< |v_ULTIMATE.start_main_#t~mem60#1.offset_11| 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem60#1.offset_11|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (< v_ArrVal_3208 0)))))))))))) is different from false [2024-11-24 01:13:57,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3205 Int) (|v_ULTIMATE.start_main_#t~mem60#1.offset_11| Int) (v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int)) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3213 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3214 (Array Int Int)) (v_ArrVal_3203 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3214)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3197))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3200))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3201))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3213) .cse6 v_ArrVal_3198) .cse7 v_ArrVal_3199) .cse8 v_ArrVal_3202) .cse5 v_ArrVal_3203))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3204))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem60#1.offset_11| v_ArrVal_3208)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3205) (select (select (store .cse3 .cse1 v_ArrVal_3206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< |v_ULTIMATE.start_main_#t~mem60#1.offset_11| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem60#1.offset_11|) (< v_ArrVal_3208 0)))))))))))) is different from false [2024-11-24 01:13:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393083846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:13:57,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:13:57,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2024-11-24 01:13:57,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516949678] [2024-11-24 01:13:57,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:13:57,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-24 01:13:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:13:57,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-24 01:13:57,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1457, Unknown=19, NotChecked=410, Total=2070 [2024-11-24 01:13:57,023 INFO L87 Difference]: Start difference. First operand 1398 states and 1749 transitions. Second operand has 32 states, 29 states have (on average 6.206896551724138) internal successors, (180), 31 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:14:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:14:35,895 INFO L93 Difference]: Finished difference Result 1400 states and 1753 transitions. [2024-11-24 01:14:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-24 01:14:35,896 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 6.206896551724138) internal successors, (180), 31 states have internal predecessors, (180), 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 111 [2024-11-24 01:14:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:14:35,897 INFO L225 Difference]: With dead ends: 1400 [2024-11-24 01:14:35,897 INFO L226 Difference]: Without dead ends: 1400 [2024-11-24 01:14:35,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=340, Invalid=2523, Unknown=19, NotChecked=540, Total=3422 [2024-11-24 01:14:35,898 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 684 mSDsluCounter, 5626 mSDsCounter, 0 mSdLazyCounter, 5734 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 6123 SdHoareTripleChecker+Invalid, 5754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:14:35,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 6123 Invalid, 5754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 5734 Invalid, 0 Unknown, 0 Unchecked, 35.2s Time] [2024-11-24 01:14:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-11-24 01:14:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1356. [2024-11-24 01:14:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1123 states have (on average 1.508459483526269) internal successors, (1694), 1348 states have internal predecessors, (1694), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:14:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1704 transitions. [2024-11-24 01:14:35,915 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1704 transitions. Word has length 111 [2024-11-24 01:14:35,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:14:35,915 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1704 transitions. [2024-11-24 01:14:35,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 6.206896551724138) internal successors, (180), 31 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:14:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1704 transitions. [2024-11-24 01:14:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-24 01:14:35,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:14:35,916 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] [2024-11-24 01:14:35,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-24 01:14:36,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:14:36,117 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:14:36,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:14:36,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1591988139, now seen corresponding path program 1 times [2024-11-24 01:14:36,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:14:36,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472183090] [2024-11-24 01:14:36,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:14:36,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:14:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:14:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:14:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:14:38,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472183090] [2024-11-24 01:14:38,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472183090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:14:38,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:14:38,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 01:14:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458648203] [2024-11-24 01:14:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:14:38,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:14:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:14:38,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:14:38,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:14:38,636 INFO L87 Difference]: Start difference. First operand 1356 states and 1704 transitions. Second operand has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:14:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:14:52,716 INFO L93 Difference]: Finished difference Result 1355 states and 1702 transitions. [2024-11-24 01:14:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:14:52,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 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 113 [2024-11-24 01:14:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:14:52,718 INFO L225 Difference]: With dead ends: 1355 [2024-11-24 01:14:52,718 INFO L226 Difference]: Without dead ends: 1355 [2024-11-24 01:14:52,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-24 01:14:52,719 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 2125 mSDsluCounter, 2914 mSDsCounter, 0 mSdLazyCounter, 2125 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2126 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:14:52,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2126 Valid, 3414 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2125 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-11-24 01:14:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2024-11-24 01:14:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2024-11-24 01:14:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1123 states have (on average 1.5066785396260018) internal successors, (1692), 1347 states have internal predecessors, (1692), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:14:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1702 transitions. [2024-11-24 01:14:52,734 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1702 transitions. Word has length 113 [2024-11-24 01:14:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:14:52,735 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1702 transitions. [2024-11-24 01:14:52,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:14:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1702 transitions. [2024-11-24 01:14:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-24 01:14:52,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:14:52,736 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] [2024-11-24 01:14:52,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-24 01:14:52,736 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:14:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:14:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1591988138, now seen corresponding path program 1 times [2024-11-24 01:14:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:14:52,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787312123] [2024-11-24 01:14:52,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:14:52,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:14:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:14:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:14:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:14:56,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787312123] [2024-11-24 01:14:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787312123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:14:56,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:14:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 01:14:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403389281] [2024-11-24 01:14:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:14:56,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:14:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:14:56,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:14:56,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:14:56,682 INFO L87 Difference]: Start difference. First operand 1355 states and 1702 transitions. Second operand has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:16,060 INFO L93 Difference]: Finished difference Result 1354 states and 1700 transitions. [2024-11-24 01:15:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 01:15:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 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 113 [2024-11-24 01:15:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:16,062 INFO L225 Difference]: With dead ends: 1354 [2024-11-24 01:15:16,062 INFO L226 Difference]: Without dead ends: 1354 [2024-11-24 01:15:16,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:15:16,062 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 1465 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 2865 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 3486 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:16,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 3486 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2865 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2024-11-24 01:15:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-11-24 01:15:16,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2024-11-24 01:15:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1123 states have (on average 1.5048975957257347) internal successors, (1690), 1346 states have internal predecessors, (1690), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:15:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1700 transitions. [2024-11-24 01:15:16,076 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1700 transitions. Word has length 113 [2024-11-24 01:15:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:16,076 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1700 transitions. [2024-11-24 01:15:16,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1700 transitions. [2024-11-24 01:15:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-24 01:15:16,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:16,077 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] [2024-11-24 01:15:16,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-24 01:15:16,077 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:15:16,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:16,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1889068403, now seen corresponding path program 1 times [2024-11-24 01:15:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:16,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143780337] [2024-11-24 01:15:16,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:15:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:16,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143780337] [2024-11-24 01:15:16,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143780337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:16,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:16,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:15:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080211786] [2024-11-24 01:15:16,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:16,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:15:16,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:16,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:15:16,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:15:16,367 INFO L87 Difference]: Start difference. First operand 1354 states and 1700 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:20,999 INFO L93 Difference]: Finished difference Result 1353 states and 1698 transitions. [2024-11-24 01:15:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:15:21,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 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 116 [2024-11-24 01:15:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:21,002 INFO L225 Difference]: With dead ends: 1353 [2024-11-24 01:15:21,002 INFO L226 Difference]: Without dead ends: 1353 [2024-11-24 01:15:21,002 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-24 01:15:21,003 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 5 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:21,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2417 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-24 01:15:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-24 01:15:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-11-24 01:15:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1123 states have (on average 1.5031166518254675) internal successors, (1688), 1345 states have internal predecessors, (1688), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:15:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1698 transitions. [2024-11-24 01:15:21,023 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1698 transitions. Word has length 116 [2024-11-24 01:15:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:21,023 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1698 transitions. [2024-11-24 01:15:21,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1698 transitions. [2024-11-24 01:15:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-24 01:15:21,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:21,025 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] [2024-11-24 01:15:21,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-24 01:15:21,025 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:15:21,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1889068402, now seen corresponding path program 1 times [2024-11-24 01:15:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74410784] [2024-11-24 01:15:21,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:21,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:15:21,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:21,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74410784] [2024-11-24 01:15:21,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74410784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:21,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:21,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:15:21,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584664156] [2024-11-24 01:15:21,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:21,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:15:21,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:21,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:15:21,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:15:21,651 INFO L87 Difference]: Start difference. First operand 1353 states and 1698 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:26,614 INFO L93 Difference]: Finished difference Result 1352 states and 1696 transitions. [2024-11-24 01:15:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:15:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 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 116 [2024-11-24 01:15:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:26,616 INFO L225 Difference]: With dead ends: 1352 [2024-11-24 01:15:26,616 INFO L226 Difference]: Without dead ends: 1352 [2024-11-24 01:15:26,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:15:26,617 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 4 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:26,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2375 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-24 01:15:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-24 01:15:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2024-11-24 01:15:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1123 states have (on average 1.5013357079252003) internal successors, (1686), 1344 states have internal predecessors, (1686), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-24 01:15:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1696 transitions. [2024-11-24 01:15:26,630 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1696 transitions. Word has length 116 [2024-11-24 01:15:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:26,630 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1696 transitions. [2024-11-24 01:15:26,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:15:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1696 transitions. [2024-11-24 01:15:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-24 01:15:26,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:26,631 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-24 01:15:26,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-24 01:15:26,631 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:15:26,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1568422361, now seen corresponding path program 1 times [2024-11-24 01:15:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587198651] [2024-11-24 01:15:26,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:15:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587198651] [2024-11-24 01:15:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587198651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:30,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:30,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 01:15:30,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480137147] [2024-11-24 01:15:30,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:30,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:15:30,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:30,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:15:30,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:15:30,505 INFO L87 Difference]: Start difference. First operand 1352 states and 1696 transitions. Second operand has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 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-24 01:15:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:15:50,973 INFO L93 Difference]: Finished difference Result 1435 states and 1795 transitions. [2024-11-24 01:15:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-24 01:15:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 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-24 01:15:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:15:50,975 INFO L225 Difference]: With dead ends: 1435 [2024-11-24 01:15:50,976 INFO L226 Difference]: Without dead ends: 1435 [2024-11-24 01:15:50,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-24 01:15:50,977 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 788 mSDsluCounter, 3950 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 4447 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:15:50,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 4447 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2024-11-24 01:15:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-11-24 01:15:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1407. [2024-11-24 01:15:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1177 states have (on average 1.4791843670348344) internal successors, (1741), 1397 states have internal predecessors, (1741), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-24 01:15:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1757 transitions. [2024-11-24 01:15:50,999 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1757 transitions. Word has length 117 [2024-11-24 01:15:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:15:50,999 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1757 transitions. [2024-11-24 01:15:51,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 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-24 01:15:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1757 transitions. [2024-11-24 01:15:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-24 01:15:51,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:15:51,001 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-24 01:15:51,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-24 01:15:51,001 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:15:51,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:15:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1568422362, now seen corresponding path program 1 times [2024-11-24 01:15:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:15:51,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822143061] [2024-11-24 01:15:51,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:15:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:15:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:15:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:15:55,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:15:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822143061] [2024-11-24 01:15:55,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822143061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:15:55,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:15:55,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 01:15:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431129350] [2024-11-24 01:15:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:15:55,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:15:55,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:15:55,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:15:55,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:15:55,966 INFO L87 Difference]: Start difference. First operand 1407 states and 1757 transitions. Second operand has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 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-24 01:16:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:27,639 INFO L93 Difference]: Finished difference Result 1434 states and 1793 transitions. [2024-11-24 01:16:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-24 01:16:27,639 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 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-24 01:16:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:27,641 INFO L225 Difference]: With dead ends: 1434 [2024-11-24 01:16:27,641 INFO L226 Difference]: Without dead ends: 1434 [2024-11-24 01:16:27,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-24 01:16:27,641 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 764 mSDsluCounter, 5881 mSDsCounter, 0 mSdLazyCounter, 4633 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 6376 SdHoareTripleChecker+Invalid, 4652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:27,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 6376 Invalid, 4652 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 4633 Invalid, 0 Unknown, 0 Unchecked, 29.5s Time] [2024-11-24 01:16:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2024-11-24 01:16:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1407. [2024-11-24 01:16:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1175 states have (on average 1.48) internal successors, (1739), 1397 states have internal predecessors, (1739), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-24 01:16:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1755 transitions. [2024-11-24 01:16:27,659 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1755 transitions. Word has length 117 [2024-11-24 01:16:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:27,660 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1755 transitions. [2024-11-24 01:16:27,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 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-24 01:16:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1755 transitions. [2024-11-24 01:16:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-24 01:16:27,661 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:27,661 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-24 01:16:27,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-24 01:16:27,662 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:16:27,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1788763304, now seen corresponding path program 1 times [2024-11-24 01:16:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:16:27,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644360589] [2024-11-24 01:16:27,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:27,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:16:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:16:32,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:16:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644360589] [2024-11-24 01:16:32,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644360589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223193532] [2024-11-24 01:16:32,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:32,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:16:32,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:16:32,682 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:16:32,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-24 01:16:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:33,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-24 01:16:33,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:16:33,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:16:34,144 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:16:34,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:16:34,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:16:34,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:16:35,129 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:35,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 01:16:35,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:16:35,530 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:35,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 01:16:35,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:16:35,936 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:35,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 01:16:35,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:16:36,371 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:36,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 01:16:36,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:16:36,803 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:16:36,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 01:16:36,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:16:37,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:16:37,662 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-24 01:16:37,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 63 [2024-11-24 01:16:37,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-24 01:16:38,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:16:38,521 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-24 01:16:38,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-24 01:16:38,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-24 01:16:38,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-24 01:16:39,087 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-24 01:16:39,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-24 01:16:39,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-24 01:16:39,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:16:43,906 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4031 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4029 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (= (select |c_#valid| (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 (store (select |c_#memory_$Pointer$#1.base| .cse2) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-24 01:16:44,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4031 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4029 Int) (v_ArrVal_4028 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4028)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select |c_#valid| (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|)))) (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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))) is different from false [2024-11-24 01:16:44,056 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-24 01:16:44,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4031 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4029 Int) (v_ArrVal_4028 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4028)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-24 01:16:44,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4031 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4029 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4028 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_4028))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse5 (store (select |c_#memory_$Pointer$#1.base| .cse5) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-24 01:16:48,392 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4031 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4029 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4028 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4024))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4023)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4028))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#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~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-24 01:16:52,150 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4031 (Array Int Int)) (v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4029 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4028 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4022)) (.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_4024))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4021) .cse8 v_ArrVal_4023)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4028))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (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~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-24 01:16:52,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4031 (Array Int Int)) (v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4029 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4028 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4022))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_4024))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4021) .cse9 v_ArrVal_4023)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4028))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#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~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-24 01:16:52,362 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4020 (Array Int Int)) (v_ArrVal_4031 (Array Int Int)) (v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4029 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4028 (Array Int Int)) (v_ArrVal_4019 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4020)) (.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_4022))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_4024))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4019) .cse8 v_ArrVal_4021) .cse9 v_ArrVal_4023)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4028))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (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~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-24 01:16:52,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4020 (Array Int Int)) (v_ArrVal_4031 (Array Int Int)) (v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4029 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4028 (Array Int Int)) (v_ArrVal_4019 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4020))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4022))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_4024))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4019) .cse9 v_ArrVal_4021) .cse10 v_ArrVal_4023)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4028))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#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~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-24 01:16:52,556 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4029 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4020 (Array Int Int)) (v_ArrVal_4031 (Array Int Int)) (v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4028 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4019 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4017)) (.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_4020))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4022))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_4024))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4018) .cse8 v_ArrVal_4019) .cse9 v_ArrVal_4021) .cse10 v_ArrVal_4023)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4028))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#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~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-24 01:16:52,633 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4029 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4020 (Array Int Int)) (v_ArrVal_4031 (Array Int Int)) (v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4028 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4019 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4017))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4020))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4022))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_4024))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4018) .cse9 v_ArrVal_4019) .cse10 v_ArrVal_4021) .cse11 v_ArrVal_4023)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4028))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (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~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-24 01:16:53,011 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4029 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4020 (Array Int Int)) (v_ArrVal_4031 (Array Int Int)) (v_ArrVal_4021 (Array Int Int)) (v_ArrVal_4022 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4036 (Array Int Int)) (v_ArrVal_4037 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4028 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4019 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4037)) (.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_4017))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4020))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4022))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_4024))) (let ((.cse7 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4036) .cse8 v_ArrVal_4018) .cse9 v_ArrVal_4019) .cse10 v_ArrVal_4021) .cse11 v_ArrVal_4023)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4028))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#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~malloc61#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~mem62#1.offset_10| 40) v_ArrVal_4029)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))))) is different from false [2024-11-24 01:16:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223193532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:16:53,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:16:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 34 [2024-11-24 01:16:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526210373] [2024-11-24 01:16:53,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:16:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-24 01:16:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:16:53,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-24 01:16:53,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1194, Unknown=38, NotChecked=972, Total=2352 [2024-11-24 01:16:53,023 INFO L87 Difference]: Start difference. First operand 1407 states and 1755 transitions. Second operand has 35 states, 32 states have (on average 5.90625) internal successors, (189), 35 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:17:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:17:27,149 INFO L93 Difference]: Finished difference Result 1431 states and 1789 transitions. [2024-11-24 01:17:27,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-24 01:17:27,150 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 5.90625) internal successors, (189), 35 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-24 01:17:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:17:27,152 INFO L225 Difference]: With dead ends: 1431 [2024-11-24 01:17:27,152 INFO L226 Difference]: Without dead ends: 1431 [2024-11-24 01:17:27,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=276, Invalid=2284, Unknown=38, NotChecked=1308, Total=3906 [2024-11-24 01:17:27,154 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 787 mSDsluCounter, 6916 mSDsCounter, 0 mSdLazyCounter, 4704 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 7413 SdHoareTripleChecker+Invalid, 4734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4704 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:17:27,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 7413 Invalid, 4734 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 4704 Invalid, 2 Unknown, 0 Unchecked, 30.9s Time] [2024-11-24 01:17:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-11-24 01:17:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1406. [2024-11-24 01:17:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1175 states have (on average 1.4782978723404254) internal successors, (1737), 1396 states have internal predecessors, (1737), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-24 01:17:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1753 transitions. [2024-11-24 01:17:27,171 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1753 transitions. Word has length 118 [2024-11-24 01:17:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:17:27,172 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 1753 transitions. [2024-11-24 01:17:27,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 5.90625) internal successors, (189), 35 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 01:17:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1753 transitions. [2024-11-24 01:17:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-24 01:17:27,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:17:27,173 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-24 01:17:27,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-24 01:17:27,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-24 01:17:27,374 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-24 01:17:27,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:17:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1788763303, now seen corresponding path program 1 times [2024-11-24 01:17:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:17:27,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267974936] [2024-11-24 01:17:27,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:17:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:17:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:17:33,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:17:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267974936] [2024-11-24 01:17:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267974936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:17:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311780133] [2024-11-24 01:17:33,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:17:33,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:17:33,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:17:33,048 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:17:33,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d821492-e40f-4e33-b09f-d34fba642ad7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-24 01:17:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:17:33,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-24 01:17:33,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:17:33,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:17:35,718 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:17:35,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:17:35,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 01:17:37,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:37,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 01:17:37,785 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:37,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 01:17:38,268 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:38,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 01:17:38,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:38,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 01:17:39,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 01:17:39,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 01:17:39,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-24 01:17:39,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 01:17:40,376 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-24 01:17:40,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-11-24 01:17:40,392 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 60 treesize of output 44 [2024-11-24 01:17:41,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:17:41,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:17:41,542 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-24 01:17:41,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 82 [2024-11-24 01:17:41,632 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-24 01:17:41,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 50 [2024-11-24 01:17:42,589 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-24 01:17:42,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-11-24 01:17:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:17:42,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:17:43,935 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse6 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (and (forall ((v_ArrVal_4260 (Array Int Int))) (or (forall ((v_ArrVal_4261 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4260)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store .cse5 .cse6 v_ArrVal_4261)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 384) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4260 .cse6)) v_ArrVal_4260)))) (forall ((v_ArrVal_4260 (Array Int Int))) (or (forall ((v_ArrVal_4261 Int)) (<= 0 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4260))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store .cse5 .cse6 v_ArrVal_4261)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4260 .cse6)) v_ArrVal_4260)))))) is different from false [2024-11-24 01:17:44,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| .cse4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse0) (forall ((v_ArrVal_4260 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (not (= v_ArrVal_4260 (store .cse1 .cse2 (select v_ArrVal_4260 .cse2)))) (forall ((v_ArrVal_4261 Int)) (<= 0 (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_4260))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 .cse2 v_ArrVal_4261)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse0) (forall ((v_ArrVal_4260 (Array Int Int))) (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4261 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_4260)) (.cse10 (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 .cse11 v_ArrVal_4261)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (<= (+ 384 (select (select .cse7 .cse8) .cse9)) (select |c_#length| (select (select .cse10 .cse8) .cse9)))))) (not (= v_ArrVal_4260 (store .cse1 .cse11 (select v_ArrVal_4260 .cse11))))))))))))) is different from false [2024-11-24 01:17:45,289 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 942 treesize of output 791 [2024-11-24 01:17:58,302 WARN L286 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 327 DAG size of output: 169 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-24 01:17:58,302 INFO L349 Elim1Store]: treesize reduction 3138, result has 45.9 percent of original size [2024-11-24 01:17:58,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 17 new quantified variables, introduced 66 case distinctions, treesize of input 5731712 treesize of output 5365869 [2024-11-24 01:18:00,364 INFO L224 Elim1Store]: Index analysis took 371 ms [2024-11-24 01:19:52,754 WARN L286 SmtUtils]: Spent 1.87m on a formula simplification. DAG size of input: 877 DAG size of output: 293 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-24 01:19:52,755 INFO L349 Elim1Store]: treesize reduction 3995, result has 20.2 percent of original size [2024-11-24 01:19:52,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 9 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 19 new quantified variables, introduced 115 case distinctions, treesize of input 106784 treesize of output 103092