./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/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_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/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_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:44:02,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:44:03,023 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-23 23:44:03,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:44:03,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:44:03,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:44:03,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:44:03,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:44:03,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:44:03,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:44:03,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:44:03,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:44:03,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:44:03,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:44:03,061 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:44:03,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:44:03,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:44:03,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:44:03,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:44:03,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:44:03,061 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 23:44:03,061 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 23:44:03,062 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 23:44:03,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:44:03,062 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:44:03,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:44:03,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:44:03,062 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:44:03,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:44:03,062 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:44:03,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:44:03,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:44:03,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:44:03,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:44:03,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:44:03,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:44:03,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:44:03,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:44:03,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:44:03,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:44:03,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:44:03,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:44:03,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:44:03,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:44:03,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:44:03,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:44:03,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:44:03,064 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_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-23 23:44:03,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:44:03,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:44:03,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:44:03,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:44:03,453 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:44:03,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2024-11-23 23:44:07,203 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/data/10b095897/e9fd71d08bd342f6a8a08916a5619ceb/FLAG1bed23f96 [2024-11-23 23:44:07,620 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:44:07,621 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2024-11-23 23:44:07,652 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/data/10b095897/e9fd71d08bd342f6a8a08916a5619ceb/FLAG1bed23f96 [2024-11-23 23:44:07,674 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/data/10b095897/e9fd71d08bd342f6a8a08916a5619ceb [2024-11-23 23:44:07,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:44:07,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:44:07,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:44:07,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:44:07,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:44:07,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:44:07" (1/1) ... [2024-11-23 23:44:07,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c310d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:07, skipping insertion in model container [2024-11-23 23:44:07,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:44:07" (1/1) ... [2024-11-23 23:44:07,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:44:08,266 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-23 23:44:08,312 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-23 23:44:08,318 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-23 23:44:08,324 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 23:44:08,334 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-23 23:44:08,386 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-23 23:44:08,389 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-23 23:44:08,394 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-23 23:44:08,402 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-23 23:44:08,428 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-23 23:44:08,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:44:08,466 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:44:08,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:44:08,786 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:44:08,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08 WrapperNode [2024-11-23 23:44:08,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:44:08,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:44:08,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:44:08,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:44:08,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:08,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:08,950 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1529 [2024-11-23 23:44:08,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:44:08,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:44:08,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:44:08,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:44:08,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:08,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,213 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-23 23:44:09,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:44:09,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:44:09,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:44:09,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:44:09,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (1/1) ... [2024-11-23 23:44:09,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:44:09,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:44:09,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:44:09,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:44:09,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 23:44:09,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 23:44:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 23:44:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 23:44:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-23 23:44:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-23 23:44:09,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-23 23:44:09,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-23 23:44:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 23:44:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:44:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 23:44:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 23:44:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 23:44:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 23:44:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:44:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:44:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 23:44:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:44:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:44:09,899 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:44:09,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:44:09,905 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-23 23:44:09,968 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-23 23:44:14,058 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2024-11-23 23:44:14,058 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:44:14,112 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:44:14,112 INFO L312 CfgBuilder]: Removed 34 assume(true) statements. [2024-11-23 23:44:14,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:44:14 BoogieIcfgContainer [2024-11-23 23:44:14,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:44:14,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:44:14,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:44:14,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:44:14,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:44:07" (1/3) ... [2024-11-23 23:44:14,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff7cec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:44:14, skipping insertion in model container [2024-11-23 23:44:14,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:44:08" (2/3) ... [2024-11-23 23:44:14,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff7cec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:44:14, skipping insertion in model container [2024-11-23 23:44:14,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:44:14" (3/3) ... [2024-11-23 23:44:14,127 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-1.i [2024-11-23 23:44:14,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:44:14,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test4-1.i that has 3 procedures, 1438 locations, 1 initial locations, 36 loop locations, and 628 error locations. [2024-11-23 23:44:14,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:44:14,290 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;@56c93cd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:44:14,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-23 23:44:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 1433 states, 803 states have (on average 2.075965130759651) internal successors, (1667), 1425 states have internal predecessors, (1667), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-23 23:44:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 23:44:14,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:14,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 23:44:14,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:14,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1482281, now seen corresponding path program 1 times [2024-11-23 23:44:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:14,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025739252] [2024-11-23 23:44:14,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:14,566 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-23 23:44:14,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:14,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025739252] [2024-11-23 23:44:14,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025739252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:14,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:14,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:44:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069592912] [2024-11-23 23:44:14,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:14,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:44:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:14,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:44:14,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:44:14,619 INFO L87 Difference]: Start difference. First operand has 1433 states, 803 states have (on average 2.075965130759651) internal successors, (1667), 1425 states have internal predecessors, (1667), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:16,224 INFO L93 Difference]: Finished difference Result 1439 states and 1619 transitions. [2024-11-23 23:44:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:44:16,228 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-23 23:44:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:16,254 INFO L225 Difference]: With dead ends: 1439 [2024-11-23 23:44:16,255 INFO L226 Difference]: Without dead ends: 1435 [2024-11-23 23:44:16,257 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-23 23:44:16,261 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 27 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:16,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2552 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-23 23:44:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-11-23 23:44:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1425. [2024-11-23 23:44:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 806 states have (on average 1.9826302729528535) internal successors, (1598), 1417 states have internal predecessors, (1598), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-23 23:44:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1610 transitions. [2024-11-23 23:44:16,442 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1610 transitions. Word has length 4 [2024-11-23 23:44:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:16,443 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1610 transitions. [2024-11-23 23:44:16,443 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-23 23:44:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1610 transitions. [2024-11-23 23:44:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:44:16,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:16,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:16,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:44:16,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:16,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1137182981, now seen corresponding path program 1 times [2024-11-23 23:44:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459152089] [2024-11-23 23:44:16,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:16,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:16,641 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-23 23:44:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459152089] [2024-11-23 23:44:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459152089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:16,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:44:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344751991] [2024-11-23 23:44:16,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:16,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:44:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:16,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:44:16,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:44:16,648 INFO L87 Difference]: Start difference. First operand 1425 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:17,489 INFO L93 Difference]: Finished difference Result 2326 states and 2655 transitions. [2024-11-23 23:44:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:44:17,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-23 23:44:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:17,502 INFO L225 Difference]: With dead ends: 2326 [2024-11-23 23:44:17,503 INFO L226 Difference]: Without dead ends: 2324 [2024-11-23 23:44:17,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:44:17,504 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 1058 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:17,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 4419 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-23 23:44:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2024-11-23 23:44:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1965. [2024-11-23 23:44:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1346 states have (on average 1.9576523031203565) internal successors, (2635), 1954 states have internal predecessors, (2635), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2653 transitions. [2024-11-23 23:44:17,577 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2653 transitions. Word has length 7 [2024-11-23 23:44:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:17,578 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2653 transitions. [2024-11-23 23:44:17,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2653 transitions. [2024-11-23 23:44:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:44:17,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:17,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:17,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:44:17,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:17,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1134636893, now seen corresponding path program 1 times [2024-11-23 23:44:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170238727] [2024-11-23 23:44:17,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:17,746 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-23 23:44:17,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:17,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170238727] [2024-11-23 23:44:17,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170238727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:17,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:17,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:44:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708216267] [2024-11-23 23:44:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:17,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:44:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:17,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:44:17,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:44:17,748 INFO L87 Difference]: Start difference. First operand 1965 states and 2653 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:19,160 INFO L93 Difference]: Finished difference Result 1871 states and 2509 transitions. [2024-11-23 23:44:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:44:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-23 23:44:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:19,172 INFO L225 Difference]: With dead ends: 1871 [2024-11-23 23:44:19,173 INFO L226 Difference]: Without dead ends: 1871 [2024-11-23 23:44:19,173 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-23 23:44:19,175 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1354 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:19,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 889 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-23 23:44:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2024-11-23 23:44:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1871. [2024-11-23 23:44:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1346 states have (on average 1.8506686478454681) internal successors, (2491), 1860 states have internal predecessors, (2491), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2509 transitions. [2024-11-23 23:44:19,295 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2509 transitions. Word has length 7 [2024-11-23 23:44:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:19,296 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2509 transitions. [2024-11-23 23:44:19,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2509 transitions. [2024-11-23 23:44:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:44:19,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:19,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:19,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:44:19,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:19,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1134636894, now seen corresponding path program 1 times [2024-11-23 23:44:19,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:19,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60865599] [2024-11-23 23:44:19,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:19,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:19,534 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-23 23:44:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60865599] [2024-11-23 23:44:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60865599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:19,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:19,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:44:19,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108590466] [2024-11-23 23:44:19,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:19,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:44:19,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:19,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:44:19,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:44:19,539 INFO L87 Difference]: Start difference. First operand 1871 states and 2509 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:21,265 INFO L93 Difference]: Finished difference Result 2503 states and 3362 transitions. [2024-11-23 23:44:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:44:21,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-23 23:44:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:21,278 INFO L225 Difference]: With dead ends: 2503 [2024-11-23 23:44:21,278 INFO L226 Difference]: Without dead ends: 2503 [2024-11-23 23:44:21,279 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-23 23:44:21,280 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 821 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:21,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1965 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-23 23:44:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-11-23 23:44:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2347. [2024-11-23 23:44:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1832 states have (on average 1.8116812227074235) internal successors, (3319), 2336 states have internal predecessors, (3319), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3337 transitions. [2024-11-23 23:44:21,359 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3337 transitions. Word has length 7 [2024-11-23 23:44:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:21,359 INFO L471 AbstractCegarLoop]: Abstraction has 2347 states and 3337 transitions. [2024-11-23 23:44:21,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3337 transitions. [2024-11-23 23:44:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 23:44:21,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:21,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:21,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:44:21,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:21,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash -567156950, now seen corresponding path program 1 times [2024-11-23 23:44:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:21,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109574235] [2024-11-23 23:44:21,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:21,476 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-23 23:44:21,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:21,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109574235] [2024-11-23 23:44:21,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109574235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:21,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:21,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:44:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95760186] [2024-11-23 23:44:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:44:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:21,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:44:21,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:44:21,478 INFO L87 Difference]: Start difference. First operand 2347 states and 3337 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:23,182 INFO L93 Difference]: Finished difference Result 2422 states and 3443 transitions. [2024-11-23 23:44:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:44:23,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-23 23:44:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:23,194 INFO L225 Difference]: With dead ends: 2422 [2024-11-23 23:44:23,194 INFO L226 Difference]: Without dead ends: 2422 [2024-11-23 23:44:23,194 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-23 23:44:23,195 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 1622 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:23,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 1577 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-23 23:44:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2024-11-23 23:44:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2324. [2024-11-23 23:44:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1832 states have (on average 1.7865720524017468) internal successors, (3273), 2313 states have internal predecessors, (3273), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3291 transitions. [2024-11-23 23:44:23,261 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3291 transitions. Word has length 13 [2024-11-23 23:44:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:23,261 INFO L471 AbstractCegarLoop]: Abstraction has 2324 states and 3291 transitions. [2024-11-23 23:44:23,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3291 transitions. [2024-11-23 23:44:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 23:44:23,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:23,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:23,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:44:23,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:23,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash -567156949, now seen corresponding path program 1 times [2024-11-23 23:44:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:23,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62917027] [2024-11-23 23:44:23,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:23,433 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-23 23:44:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62917027] [2024-11-23 23:44:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62917027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:23,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:44:23,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700083198] [2024-11-23 23:44:23,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:44:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:23,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:44:23,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:44:23,437 INFO L87 Difference]: Start difference. First operand 2324 states and 3291 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:23,489 INFO L93 Difference]: Finished difference Result 2186 states and 3085 transitions. [2024-11-23 23:44:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:44:23,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-23 23:44:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:23,501 INFO L225 Difference]: With dead ends: 2186 [2024-11-23 23:44:23,502 INFO L226 Difference]: Without dead ends: 2186 [2024-11-23 23:44:23,503 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-23 23:44:23,506 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 61 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2639 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:23,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2639 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:44:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2024-11-23 23:44:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2186. [2024-11-23 23:44:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1706 states have (on average 1.7977725674091443) internal successors, (3067), 2175 states have internal predecessors, (3067), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3085 transitions. [2024-11-23 23:44:23,592 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3085 transitions. Word has length 13 [2024-11-23 23:44:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:23,592 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 3085 transitions. [2024-11-23 23:44:23,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3085 transitions. [2024-11-23 23:44:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 23:44:23,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:23,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:23,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 23:44:23,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:23,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash 423295012, now seen corresponding path program 1 times [2024-11-23 23:44:23,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:23,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987234882] [2024-11-23 23:44:23,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:23,748 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-23 23:44:23,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:23,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987234882] [2024-11-23 23:44:23,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987234882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:23,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:23,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:44:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843831561] [2024-11-23 23:44:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:23,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:44:23,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:23,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:44:23,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:44:23,752 INFO L87 Difference]: Start difference. First operand 2186 states and 3085 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:23,850 INFO L93 Difference]: Finished difference Result 2157 states and 3035 transitions. [2024-11-23 23:44:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:44:23,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-23 23:44:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:23,862 INFO L225 Difference]: With dead ends: 2157 [2024-11-23 23:44:23,862 INFO L226 Difference]: Without dead ends: 2157 [2024-11-23 23:44:23,862 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-23 23:44:23,864 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 41 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:23,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3905 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:44:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2024-11-23 23:44:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2151. [2024-11-23 23:44:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 1678 states have (on average 1.794398092967819) internal successors, (3011), 2140 states have internal predecessors, (3011), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3029 transitions. [2024-11-23 23:44:23,921 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3029 transitions. Word has length 15 [2024-11-23 23:44:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:23,923 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3029 transitions. [2024-11-23 23:44:23,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3029 transitions. [2024-11-23 23:44:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-23 23:44:23,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:23,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:23,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:44:23,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:23,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash 912325906, now seen corresponding path program 1 times [2024-11-23 23:44:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:23,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264578040] [2024-11-23 23:44:23,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:24,320 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-23 23:44:24,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:24,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264578040] [2024-11-23 23:44:24,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264578040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:24,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:24,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:44:24,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16243069] [2024-11-23 23:44:24,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:24,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:44:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:24,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:44:24,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:44:24,325 INFO L87 Difference]: Start difference. First operand 2151 states and 3029 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:26,289 INFO L93 Difference]: Finished difference Result 2401 states and 3198 transitions. [2024-11-23 23:44:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:44:26,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-23 23:44:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:26,300 INFO L225 Difference]: With dead ends: 2401 [2024-11-23 23:44:26,300 INFO L226 Difference]: Without dead ends: 2401 [2024-11-23 23:44:26,301 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-23 23:44:26,302 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 826 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:26,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 2632 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-23 23:44:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2024-11-23 23:44:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2147. [2024-11-23 23:44:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1678 states have (on average 1.7896305125148988) internal successors, (3003), 2136 states have internal predecessors, (3003), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3021 transitions. [2024-11-23 23:44:26,356 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3021 transitions. Word has length 29 [2024-11-23 23:44:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:26,359 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 3021 transitions. [2024-11-23 23:44:26,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3021 transitions. [2024-11-23 23:44:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-23 23:44:26,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:26,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:26,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 23:44:26,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:26,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:26,367 INFO L85 PathProgramCache]: Analyzing trace with hash -673514776, now seen corresponding path program 1 times [2024-11-23 23:44:26,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:26,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069245782] [2024-11-23 23:44:26,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:44:26,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:26,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069245782] [2024-11-23 23:44:26,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069245782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:26,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:26,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:44:26,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377760790] [2024-11-23 23:44:26,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:26,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:44:26,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:26,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:44:26,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:44:26,611 INFO L87 Difference]: Start difference. First operand 2147 states and 3021 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:26,707 INFO L93 Difference]: Finished difference Result 2147 states and 3013 transitions. [2024-11-23 23:44:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:44:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-23 23:44:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:26,718 INFO L225 Difference]: With dead ends: 2147 [2024-11-23 23:44:26,719 INFO L226 Difference]: Without dead ends: 2147 [2024-11-23 23:44:26,719 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-23 23:44:26,721 INFO L435 NwaCegarLoop]: 1306 mSDtfsCounter, 21 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3887 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:26,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3887 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:44:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2024-11-23 23:44:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2147. [2024-11-23 23:44:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1678 states have (on average 1.7848629320619784) internal successors, (2995), 2136 states have internal predecessors, (2995), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3013 transitions. [2024-11-23 23:44:26,790 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3013 transitions. Word has length 63 [2024-11-23 23:44:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:26,792 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 3013 transitions. [2024-11-23 23:44:26,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3013 transitions. [2024-11-23 23:44:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-23 23:44:26,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:26,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:26,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:44:26,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:26,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -354565324, now seen corresponding path program 1 times [2024-11-23 23:44:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934061336] [2024-11-23 23:44:26,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:44:27,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:27,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934061336] [2024-11-23 23:44:27,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934061336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:27,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:27,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:44:27,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480098840] [2024-11-23 23:44:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:27,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:44:27,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:27,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:44:27,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:44:27,047 INFO L87 Difference]: Start difference. First operand 2147 states and 3013 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:27,115 INFO L93 Difference]: Finished difference Result 1916 states and 2610 transitions. [2024-11-23 23:44:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:44:27,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-23 23:44:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:27,126 INFO L225 Difference]: With dead ends: 1916 [2024-11-23 23:44:27,126 INFO L226 Difference]: Without dead ends: 1916 [2024-11-23 23:44:27,126 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-23 23:44:27,128 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 54 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:27,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2614 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:44:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-23 23:44:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2024-11-23 23:44:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1447 states have (on average 1.7912923289564617) internal successors, (2592), 1905 states have internal predecessors, (2592), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2610 transitions. [2024-11-23 23:44:27,177 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2610 transitions. Word has length 71 [2024-11-23 23:44:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:27,178 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2610 transitions. [2024-11-23 23:44:27,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2610 transitions. [2024-11-23 23:44:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-23 23:44:27,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:27,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:27,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 23:44:27,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:27,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:27,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1640032229, now seen corresponding path program 1 times [2024-11-23 23:44:27,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:27,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178184562] [2024-11-23 23:44:27,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:27,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:28,040 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-23 23:44:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178184562] [2024-11-23 23:44:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178184562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:44:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794078111] [2024-11-23 23:44:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:28,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:44:28,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:28,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:44:28,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:44:28,044 INFO L87 Difference]: Start difference. First operand 1916 states and 2610 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:30,136 INFO L93 Difference]: Finished difference Result 1832 states and 2485 transitions. [2024-11-23 23:44:30,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:44:30,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-23 23:44:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:30,146 INFO L225 Difference]: With dead ends: 1832 [2024-11-23 23:44:30,146 INFO L226 Difference]: Without dead ends: 1832 [2024-11-23 23:44:30,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:44:30,149 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1157 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:30,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1131 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-23 23:44:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-23 23:44:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1559. [2024-11-23 23:44:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1174 states have (on average 1.6890971039182283) internal successors, (1983), 1548 states have internal predecessors, (1983), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2001 transitions. [2024-11-23 23:44:30,192 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2001 transitions. Word has length 74 [2024-11-23 23:44:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:30,194 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2001 transitions. [2024-11-23 23:44:30,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2001 transitions. [2024-11-23 23:44:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-23 23:44:30,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:30,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:30,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 23:44:30,198 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:30,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1277110201, now seen corresponding path program 1 times [2024-11-23 23:44:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:30,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994523080] [2024-11-23 23:44:30,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:30,740 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-23 23:44:30,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994523080] [2024-11-23 23:44:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994523080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:30,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:44:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436865670] [2024-11-23 23:44:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:44:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:30,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:44:30,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:44:30,743 INFO L87 Difference]: Start difference. First operand 1559 states and 2001 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:32,454 INFO L93 Difference]: Finished difference Result 1558 states and 1999 transitions. [2024-11-23 23:44:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:44:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-23 23:44:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:32,468 INFO L225 Difference]: With dead ends: 1558 [2024-11-23 23:44:32,469 INFO L226 Difference]: Without dead ends: 1558 [2024-11-23 23:44:32,469 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-23 23:44:32,470 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 2 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:32,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3472 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-23 23:44:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2024-11-23 23:44:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2024-11-23 23:44:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1174 states have (on average 1.6873935264054514) internal successors, (1981), 1547 states have internal predecessors, (1981), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1999 transitions. [2024-11-23 23:44:32,545 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1999 transitions. Word has length 79 [2024-11-23 23:44:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:32,545 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 1999 transitions. [2024-11-23 23:44:32,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1999 transitions. [2024-11-23 23:44:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-23 23:44:32,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:32,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:32,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 23:44:32,549 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:32,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1277110200, now seen corresponding path program 1 times [2024-11-23 23:44:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:32,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461816124] [2024-11-23 23:44:32,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:32,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:44:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461816124] [2024-11-23 23:44:33,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461816124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:33,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:44:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557298583] [2024-11-23 23:44:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:33,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:44:33,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:33,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:44:33,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:44:33,430 INFO L87 Difference]: Start difference. First operand 1558 states and 1999 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:35,103 INFO L93 Difference]: Finished difference Result 1557 states and 1997 transitions. [2024-11-23 23:44:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:44:35,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-23 23:44:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:35,110 INFO L225 Difference]: With dead ends: 1557 [2024-11-23 23:44:35,110 INFO L226 Difference]: Without dead ends: 1557 [2024-11-23 23:44:35,110 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-23 23:44:35,111 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 1 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3487 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:35,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3487 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-23 23:44:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2024-11-23 23:44:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2024-11-23 23:44:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1172 states have (on average 1.6885665529010239) internal successors, (1979), 1546 states have internal predecessors, (1979), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1997 transitions. [2024-11-23 23:44:35,145 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1997 transitions. Word has length 79 [2024-11-23 23:44:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:35,145 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 1997 transitions. [2024-11-23 23:44:35,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:44:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1997 transitions. [2024-11-23 23:44:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-23 23:44:35,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:35,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:35,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 23:44:35,147 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:35,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1471579886, now seen corresponding path program 1 times [2024-11-23 23:44:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:35,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423309262] [2024-11-23 23:44:35,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:35,586 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-23 23:44:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423309262] [2024-11-23 23:44:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423309262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:35,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:44:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495937757] [2024-11-23 23:44:35,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:35,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:44:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:35,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:44:35,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:44:35,589 INFO L87 Difference]: Start difference. First operand 1557 states and 1997 transitions. Second operand has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:44:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:37,668 INFO L93 Difference]: Finished difference Result 1575 states and 2027 transitions. [2024-11-23 23:44:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:44:37,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-11-23 23:44:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:37,676 INFO L225 Difference]: With dead ends: 1575 [2024-11-23 23:44:37,677 INFO L226 Difference]: Without dead ends: 1575 [2024-11-23 23:44:37,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:44:37,677 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 6 mSDsluCounter, 4253 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5475 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:37,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5475 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-23 23:44:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-23 23:44:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1566. [2024-11-23 23:44:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1180 states have (on average 1.6864406779661016) internal successors, (1990), 1553 states have internal predecessors, (1990), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:44:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2017 transitions. [2024-11-23 23:44:37,743 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2017 transitions. Word has length 87 [2024-11-23 23:44:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:37,744 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2017 transitions. [2024-11-23 23:44:37,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:44:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2017 transitions. [2024-11-23 23:44:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-23 23:44:37,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:37,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:37,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 23:44:37,749 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:37,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:37,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1471579887, now seen corresponding path program 1 times [2024-11-23 23:44:37,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:37,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503709950] [2024-11-23 23:44:37,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:38,622 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-23 23:44:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503709950] [2024-11-23 23:44:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503709950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:38,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:44:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624156069] [2024-11-23 23:44:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:38,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:44:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:38,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:44:38,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:44:38,628 INFO L87 Difference]: Start difference. First operand 1566 states and 2017 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:44:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:40,815 INFO L93 Difference]: Finished difference Result 1566 states and 2015 transitions. [2024-11-23 23:44:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:44:40,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-11-23 23:44:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:40,821 INFO L225 Difference]: With dead ends: 1566 [2024-11-23 23:44:40,822 INFO L226 Difference]: Without dead ends: 1566 [2024-11-23 23:44:40,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:44:40,823 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 1 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4503 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:40,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4503 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-23 23:44:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-23 23:44:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-23 23:44:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1180 states have (on average 1.6847457627118645) internal successors, (1988), 1553 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:44:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2015 transitions. [2024-11-23 23:44:40,857 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2015 transitions. Word has length 87 [2024-11-23 23:44:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:40,857 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2015 transitions. [2024-11-23 23:44:40,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:44:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2015 transitions. [2024-11-23 23:44:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-23 23:44:40,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:40,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:40,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 23:44:40,859 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:40,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1463572569, now seen corresponding path program 1 times [2024-11-23 23:44:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111444428] [2024-11-23 23:44:40,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:41,631 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-23 23:44:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111444428] [2024-11-23 23:44:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111444428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165051153] [2024-11-23 23:44:41,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:41,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:44:41,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:44:41,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:44:41,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:44:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:41,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-23 23:44:41,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:44:42,020 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-23 23:44:42,225 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:44:42,225 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-23 23:44:42,241 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-23 23:44:42,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:42,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:42,387 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-23 23:44:42,392 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-23 23:44:42,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:44:42,473 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-23 23:44:42,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-23 23:44:42,496 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-23 23:44:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165051153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:42,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:44:42,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-23 23:44:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652576530] [2024-11-23 23:44:42,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:44:42,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 23:44:42,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:42,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 23:44:42,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-23 23:44:42,506 INFO L87 Difference]: Start difference. First operand 1566 states and 2015 transitions. Second operand has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:44:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:46,045 INFO L93 Difference]: Finished difference Result 1565 states and 2013 transitions. [2024-11-23 23:44:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:44:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-23 23:44:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:46,052 INFO L225 Difference]: With dead ends: 1565 [2024-11-23 23:44:46,053 INFO L226 Difference]: Without dead ends: 1565 [2024-11-23 23:44:46,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-23 23:44:46,054 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1150 mSDsluCounter, 5117 mSDsCounter, 0 mSdLazyCounter, 4011 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 5867 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:46,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 5867 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4011 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-23 23:44:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-11-23 23:44:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2024-11-23 23:44:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1180 states have (on average 1.6830508474576271) internal successors, (1986), 1552 states have internal predecessors, (1986), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:44:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2013 transitions. [2024-11-23 23:44:46,096 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2013 transitions. Word has length 88 [2024-11-23 23:44:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:46,096 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2013 transitions. [2024-11-23 23:44:46,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:44:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2013 transitions. [2024-11-23 23:44:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-23 23:44:46,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:46,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:46,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 23:44:46,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-23 23:44:46,300 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1463572568, now seen corresponding path program 1 times [2024-11-23 23:44:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:46,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5635305] [2024-11-23 23:44:46,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:46,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:47,486 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-23 23:44:47,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5635305] [2024-11-23 23:44:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5635305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112669740] [2024-11-23 23:44:47,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:47,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:44:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:44:47,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:44:47,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:44:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:47,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-23 23:44:47,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:44:47,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-23 23:44:48,008 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:44:48,009 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-23 23:44:48,052 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-23 23:44:48,059 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-23 23:44:48,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:48,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-23 23:44:48,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-23 23:44:48,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-23 23:44:48,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-23 23:44:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:44:48,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:44:48,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:44:48,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-23 23:44:48,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112669740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:48,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:44:48,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-23 23:44:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170407418] [2024-11-23 23:44:48,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:44:48,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:44:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:48,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:44:48,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=393, Unknown=6, NotChecked=0, Total=462 [2024-11-23 23:44:48,991 INFO L87 Difference]: Start difference. First operand 1565 states and 2013 transitions. Second operand has 19 states, 16 states have (on average 8.5625) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:44:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:56,203 INFO L93 Difference]: Finished difference Result 1564 states and 2011 transitions. [2024-11-23 23:44:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:44:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.5625) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2024-11-23 23:44:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:56,210 INFO L225 Difference]: With dead ends: 1564 [2024-11-23 23:44:56,210 INFO L226 Difference]: Without dead ends: 1564 [2024-11-23 23:44:56,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=544, Unknown=6, NotChecked=0, Total=650 [2024-11-23 23:44:56,211 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1146 mSDsluCounter, 8943 mSDsCounter, 0 mSdLazyCounter, 8771 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 9692 SdHoareTripleChecker+Invalid, 8796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 8771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:56,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 9692 Invalid, 8796 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 8771 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-23 23:44:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-23 23:44:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1555. [2024-11-23 23:44:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1172 states have (on average 1.6851535836177474) internal successors, (1975), 1544 states have internal predecessors, (1975), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1993 transitions. [2024-11-23 23:44:56,242 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1993 transitions. Word has length 88 [2024-11-23 23:44:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:56,243 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 1993 transitions. [2024-11-23 23:44:56,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.5625) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:44:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1993 transitions. [2024-11-23 23:44:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-23 23:44:56,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:56,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:44:56,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 23:44:56,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-23 23:44:56,446 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:56,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1105810242, now seen corresponding path program 1 times [2024-11-23 23:44:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:56,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346947797] [2024-11-23 23:44:56,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:57,247 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-23 23:44:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346947797] [2024-11-23 23:44:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346947797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:57,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-23 23:44:57,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14604452] [2024-11-23 23:44:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:57,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 23:44:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:57,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 23:44:57,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-23 23:44:57,250 INFO L87 Difference]: Start difference. First operand 1555 states and 1993 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:00,655 INFO L93 Difference]: Finished difference Result 1571 states and 2019 transitions. [2024-11-23 23:45:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 23:45:00,655 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-23 23:45:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:00,659 INFO L225 Difference]: With dead ends: 1571 [2024-11-23 23:45:00,660 INFO L226 Difference]: Without dead ends: 1571 [2024-11-23 23:45:00,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-23 23:45:00,661 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1175 mSDsluCounter, 5812 mSDsCounter, 0 mSdLazyCounter, 4500 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 6561 SdHoareTripleChecker+Invalid, 4520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:00,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 6561 Invalid, 4520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4500 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-23 23:45:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2024-11-23 23:45:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1570. [2024-11-23 23:45:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1186 states have (on average 1.6795952782462058) internal successors, (1992), 1557 states have internal predecessors, (1992), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:45:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2019 transitions. [2024-11-23 23:45:00,696 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2019 transitions. Word has length 90 [2024-11-23 23:45:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:00,697 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2019 transitions. [2024-11-23 23:45:00,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2019 transitions. [2024-11-23 23:45:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-23 23:45:00,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:00,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:45:00,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 23:45:00,701 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:00,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1105810243, now seen corresponding path program 1 times [2024-11-23 23:45:00,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:00,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510911417] [2024-11-23 23:45:00,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:00,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:01,772 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-23 23:45:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:01,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510911417] [2024-11-23 23:45:01,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510911417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:45:01,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:45:01,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-23 23:45:01,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96403145] [2024-11-23 23:45:01,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:45:01,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:45:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:01,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:45:01,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:45:01,776 INFO L87 Difference]: Start difference. First operand 1570 states and 2019 transitions. Second operand has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:05,269 INFO L93 Difference]: Finished difference Result 1570 states and 2017 transitions. [2024-11-23 23:45:05,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:45:05,269 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-23 23:45:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:05,273 INFO L225 Difference]: With dead ends: 1570 [2024-11-23 23:45:05,273 INFO L226 Difference]: Without dead ends: 1570 [2024-11-23 23:45:05,274 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-23 23:45:05,274 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1154 mSDsluCounter, 3827 mSDsCounter, 0 mSdLazyCounter, 4035 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4583 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:05,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 4583 Invalid, 4054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4035 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-23 23:45:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-11-23 23:45:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-11-23 23:45:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1186 states have (on average 1.6779089376053964) internal successors, (1990), 1557 states have internal predecessors, (1990), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:45:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2017 transitions. [2024-11-23 23:45:05,301 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2017 transitions. Word has length 90 [2024-11-23 23:45:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:05,301 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2017 transitions. [2024-11-23 23:45:05,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2017 transitions. [2024-11-23 23:45:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-23 23:45:05,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:05,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:45:05,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-23 23:45:05,304 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:05,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1218202601, now seen corresponding path program 1 times [2024-11-23 23:45:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:05,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552526951] [2024-11-23 23:45:05,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:06,121 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-23 23:45:06,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552526951] [2024-11-23 23:45:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552526951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954421841] [2024-11-23 23:45:06,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:06,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:45:06,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:45:06,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:45:06,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:45:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:06,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-23 23:45:06,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:45:06,503 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-23 23:45:06,673 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:45:06,673 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-23 23:45:06,686 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-23 23:45:06,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:06,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:06,853 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:06,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:06,873 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-23 23:45:06,877 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-23 23:45:06,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:45:06,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-23 23:45:06,905 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-23 23:45:06,967 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-23 23:45:06,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-23 23:45:07,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954421841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:07,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:45:07,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-23 23:45:07,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025913060] [2024-11-23 23:45:07,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:45:07,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-23 23:45:07,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:07,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 23:45:07,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=8, NotChecked=62, Total=342 [2024-11-23 23:45:07,029 INFO L87 Difference]: Start difference. First operand 1570 states and 2017 transitions. Second operand has 16 states, 14 states have (on average 9.285714285714286) internal successors, (130), 15 states have internal predecessors, (130), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:10,193 INFO L93 Difference]: Finished difference Result 1569 states and 2015 transitions. [2024-11-23 23:45:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:45:10,194 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.285714285714286) internal successors, (130), 15 states have internal predecessors, (130), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-23 23:45:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:10,196 INFO L225 Difference]: With dead ends: 1569 [2024-11-23 23:45:10,196 INFO L226 Difference]: Without dead ends: 1569 [2024-11-23 23:45:10,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=8, NotChecked=90, Total=650 [2024-11-23 23:45:10,197 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1144 mSDsluCounter, 6540 mSDsCounter, 0 mSdLazyCounter, 4997 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 7289 SdHoareTripleChecker+Invalid, 5017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:10,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 7289 Invalid, 5017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4997 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-23 23:45:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-23 23:45:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2024-11-23 23:45:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1186 states have (on average 1.6762225969645868) internal successors, (1988), 1556 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:45:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2015 transitions. [2024-11-23 23:45:10,216 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2015 transitions. Word has length 91 [2024-11-23 23:45:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:10,216 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2015 transitions. [2024-11-23 23:45:10,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.285714285714286) internal successors, (130), 15 states have internal predecessors, (130), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2015 transitions. [2024-11-23 23:45:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-23 23:45:10,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:10,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:45:10,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 23:45:10,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:45:10,419 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:10,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1218202602, now seen corresponding path program 1 times [2024-11-23 23:45:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:10,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914805617] [2024-11-23 23:45:10,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:10,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:11,534 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-23 23:45:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914805617] [2024-11-23 23:45:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914805617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:11,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092870561] [2024-11-23 23:45:11,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:11,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:45:11,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:45:11,538 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:45:11,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:45:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:11,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-23 23:45:11,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:45:11,881 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-23 23:45:12,078 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:45:12,078 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-23 23:45:12,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-23 23:45:12,128 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-23 23:45:12,133 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-23 23:45:12,277 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-23 23:45:12,284 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-23 23:45:12,455 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:12,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:12,462 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-23 23:45:12,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:12,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-23 23:45:12,638 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-23 23:45:12,668 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-23 23:45:12,674 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-23 23:45:12,704 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-23 23:45:12,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:45:12,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-23 23:45:13,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-23 23:45:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092870561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:13,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:45:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-23 23:45:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391609667] [2024-11-23 23:45:13,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:45:13,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-23 23:45:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:13,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-23 23:45:13,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=426, Unknown=12, NotChecked=86, Total=600 [2024-11-23 23:45:13,029 INFO L87 Difference]: Start difference. First operand 1569 states and 2015 transitions. Second operand has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:45:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:19,451 INFO L93 Difference]: Finished difference Result 1576 states and 2021 transitions. [2024-11-23 23:45:19,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 23:45:19,453 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2024-11-23 23:45:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:19,457 INFO L225 Difference]: With dead ends: 1576 [2024-11-23 23:45:19,457 INFO L226 Difference]: Without dead ends: 1576 [2024-11-23 23:45:19,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=631, Unknown=13, NotChecked=106, Total=870 [2024-11-23 23:45:19,458 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1146 mSDsluCounter, 6087 mSDsCounter, 0 mSdLazyCounter, 6727 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 6749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:19,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 6841 Invalid, 6749 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 6727 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-23 23:45:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-23 23:45:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1558. [2024-11-23 23:45:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1176 states have (on average 1.6802721088435375) internal successors, (1976), 1546 states have internal predecessors, (1976), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:45:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1994 transitions. [2024-11-23 23:45:19,483 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1994 transitions. Word has length 91 [2024-11-23 23:45:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:19,486 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 1994 transitions. [2024-11-23 23:45:19,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:45:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1994 transitions. [2024-11-23 23:45:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-23 23:45:19,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:19,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:45:19,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 23:45:19,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-23 23:45:19,688 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:19,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash 794382741, now seen corresponding path program 1 times [2024-11-23 23:45:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256930058] [2024-11-23 23:45:19,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:20,512 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-23 23:45:20,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:20,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256930058] [2024-11-23 23:45:20,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256930058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:45:20,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:45:20,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-23 23:45:20,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143102106] [2024-11-23 23:45:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:45:20,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 23:45:20,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:20,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 23:45:20,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-23 23:45:20,516 INFO L87 Difference]: Start difference. First operand 1558 states and 1994 transitions. Second operand has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:23,731 INFO L93 Difference]: Finished difference Result 1583 states and 2029 transitions. [2024-11-23 23:45:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:45:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-23 23:45:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:23,739 INFO L225 Difference]: With dead ends: 1583 [2024-11-23 23:45:23,739 INFO L226 Difference]: Without dead ends: 1583 [2024-11-23 23:45:23,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-23 23:45:23,741 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 1162 mSDsluCounter, 5083 mSDsCounter, 0 mSdLazyCounter, 4034 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 5831 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:23,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 5831 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4034 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-23 23:45:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-11-23 23:45:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1579. [2024-11-23 23:45:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1196 states have (on average 1.6714046822742474) internal successors, (1999), 1565 states have internal predecessors, (1999), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:45:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2019 transitions. [2024-11-23 23:45:23,768 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2019 transitions. Word has length 93 [2024-11-23 23:45:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:23,769 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2019 transitions. [2024-11-23 23:45:23,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2019 transitions. [2024-11-23 23:45:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-23 23:45:23,770 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:23,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:45:23,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-23 23:45:23,771 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:23,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:23,771 INFO L85 PathProgramCache]: Analyzing trace with hash 794382742, now seen corresponding path program 1 times [2024-11-23 23:45:23,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:23,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382634087] [2024-11-23 23:45:23,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:45:24,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:24,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382634087] [2024-11-23 23:45:24,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382634087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:45:24,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:45:24,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-23 23:45:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055852958] [2024-11-23 23:45:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:45:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-23 23:45:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:24,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 23:45:24,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-23 23:45:24,846 INFO L87 Difference]: Start difference. First operand 1579 states and 2019 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:28,163 INFO L93 Difference]: Finished difference Result 1582 states and 2027 transitions. [2024-11-23 23:45:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 23:45:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-23 23:45:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:28,168 INFO L225 Difference]: With dead ends: 1582 [2024-11-23 23:45:28,168 INFO L226 Difference]: Without dead ends: 1582 [2024-11-23 23:45:28,168 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-23 23:45:28,169 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1172 mSDsluCounter, 3678 mSDsCounter, 0 mSdLazyCounter, 4212 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 4231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:28,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 4433 Invalid, 4231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4212 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-23 23:45:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2024-11-23 23:45:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1579. [2024-11-23 23:45:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1196 states have (on average 1.669732441471572) internal successors, (1997), 1565 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:45:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2017 transitions. [2024-11-23 23:45:28,193 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2017 transitions. Word has length 93 [2024-11-23 23:45:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:28,193 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2017 transitions. [2024-11-23 23:45:28,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2017 transitions. [2024-11-23 23:45:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-23 23:45:28,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:28,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:45:28,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-23 23:45:28,195 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:28,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -999341170, now seen corresponding path program 1 times [2024-11-23 23:45:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:28,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232580059] [2024-11-23 23:45:28,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:29,180 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-23 23:45:29,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:29,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232580059] [2024-11-23 23:45:29,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232580059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:29,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579465524] [2024-11-23 23:45:29,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:29,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:45:29,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:45:29,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:45:29,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:45:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:29,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-23 23:45:29,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:45:29,544 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-23 23:45:29,687 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:45:29,687 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-23 23:45:29,698 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-23 23:45:29,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:29,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:29,908 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:29,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:29,972 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:29,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:29,995 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-23 23:45:30,000 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-23 23:45:30,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:45:30,022 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-23 23:45:30,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-23 23:45:30,216 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-23 23:45:30,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-23 23:45:30,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579465524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:30,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:45:30,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2024-11-23 23:45:30,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239343046] [2024-11-23 23:45:30,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:45:30,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:45:30,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:30,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:45:30,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=376, Unknown=24, NotChecked=82, Total=552 [2024-11-23 23:45:30,301 INFO L87 Difference]: Start difference. First operand 1579 states and 2017 transitions. Second operand has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:45:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:35,256 INFO L93 Difference]: Finished difference Result 1581 states and 2025 transitions. [2024-11-23 23:45:35,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:45:35,257 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-11-23 23:45:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:35,262 INFO L225 Difference]: With dead ends: 1581 [2024-11-23 23:45:35,262 INFO L226 Difference]: Without dead ends: 1581 [2024-11-23 23:45:35,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=716, Unknown=24, NotChecked=114, Total=992 [2024-11-23 23:45:35,263 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 1142 mSDsluCounter, 9444 mSDsCounter, 0 mSdLazyCounter, 7004 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 10192 SdHoareTripleChecker+Invalid, 7024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:35,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 10192 Invalid, 7024 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 7004 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-23 23:45:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-23 23:45:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1578. [2024-11-23 23:45:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1196 states have (on average 1.6680602006688963) internal successors, (1995), 1564 states have internal predecessors, (1995), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:45:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2015 transitions. [2024-11-23 23:45:35,292 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2015 transitions. Word has length 94 [2024-11-23 23:45:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:35,293 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2015 transitions. [2024-11-23 23:45:35,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:45:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2015 transitions. [2024-11-23 23:45:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-23 23:45:35,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:35,294 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-23 23:45:35,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-23 23:45:35,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-23 23:45:35,499 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:35,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:35,499 INFO L85 PathProgramCache]: Analyzing trace with hash -999341169, now seen corresponding path program 1 times [2024-11-23 23:45:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:35,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524538069] [2024-11-23 23:45:35,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:35,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:36,573 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-23 23:45:36,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:36,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524538069] [2024-11-23 23:45:36,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524538069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:36,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491225255] [2024-11-23 23:45:36,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:36,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:45:36,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:45:36,576 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:45:36,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:45:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:36,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-23 23:45:36,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:45:36,929 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-23 23:45:37,079 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-23 23:45:37,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:45:37,093 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-23 23:45:37,103 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-23 23:45:37,110 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-23 23:45:37,176 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-23 23:45:37,182 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-23 23:45:37,330 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:37,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:37,339 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-23 23:45:37,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:37,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:37,458 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-23 23:45:37,536 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:37,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:37,543 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-23 23:45:37,573 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-23 23:45:37,581 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-23 23:45:37,582 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-23 23:45:37,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:45:37,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-23 23:45:37,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-23 23:45:37,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-23 23:45:37,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse0 v_ArrVal_1453) (select (select (store .cse1 .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1452))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1453) .cse4 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-23 23:45:37,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491225255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:37,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:45:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-23 23:45:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748766510] [2024-11-23 23:45:37,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:45:37,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 23:45:37,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:37,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 23:45:37,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=348, Unknown=12, NotChecked=164, Total=600 [2024-11-23 23:45:37,963 INFO L87 Difference]: Start difference. First operand 1578 states and 2015 transitions. Second operand has 18 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:45:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:45,111 INFO L93 Difference]: Finished difference Result 1580 states and 2023 transitions. [2024-11-23 23:45:45,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:45:45,112 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-11-23 23:45:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:45,115 INFO L225 Difference]: With dead ends: 1580 [2024-11-23 23:45:45,115 INFO L226 Difference]: Without dead ends: 1580 [2024-11-23 23:45:45,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=584, Unknown=12, NotChecked=212, Total=930 [2024-11-23 23:45:45,116 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1142 mSDsluCounter, 7706 mSDsCounter, 0 mSdLazyCounter, 8733 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 8459 SdHoareTripleChecker+Invalid, 8754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 8733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:45,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 8459 Invalid, 8754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 8733 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-23 23:45:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-23 23:45:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1556. [2024-11-23 23:45:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1176 states have (on average 1.6768707482993197) internal successors, (1972), 1544 states have internal predecessors, (1972), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:45:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1990 transitions. [2024-11-23 23:45:45,136 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1990 transitions. Word has length 94 [2024-11-23 23:45:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:45,137 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1990 transitions. [2024-11-23 23:45:45,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:45:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1990 transitions. [2024-11-23 23:45:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-23 23:45:45,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:45,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:45:45,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 23:45:45,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-23 23:45:45,340 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:45,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 187066761, now seen corresponding path program 1 times [2024-11-23 23:45:45,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:45,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897567520] [2024-11-23 23:45:45,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:45,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:46,041 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-23 23:45:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:46,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897567520] [2024-11-23 23:45:46,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897567520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:45:46,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:45:46,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-23 23:45:46,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076689781] [2024-11-23 23:45:46,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:45:46,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-23 23:45:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:46,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 23:45:46,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:45:46,044 INFO L87 Difference]: Start difference. First operand 1556 states and 1990 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:48,712 INFO L93 Difference]: Finished difference Result 1587 states and 2031 transitions. [2024-11-23 23:45:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:45:48,712 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-23 23:45:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:48,714 INFO L225 Difference]: With dead ends: 1587 [2024-11-23 23:45:48,714 INFO L226 Difference]: Without dead ends: 1587 [2024-11-23 23:45:48,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-23 23:45:48,715 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1175 mSDsluCounter, 5110 mSDsCounter, 0 mSdLazyCounter, 4043 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 5857 SdHoareTripleChecker+Invalid, 4063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:48,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 5857 Invalid, 4063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4043 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-23 23:45:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-11-23 23:45:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1583. [2024-11-23 23:45:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1202 states have (on average 1.6647254575707155) internal successors, (2001), 1569 states have internal predecessors, (2001), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:45:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2021 transitions. [2024-11-23 23:45:48,734 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2021 transitions. Word has length 96 [2024-11-23 23:45:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:48,735 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2021 transitions. [2024-11-23 23:45:48,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2021 transitions. [2024-11-23 23:45:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-23 23:45:48,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:48,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:45:48,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-23 23:45:48,737 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:48,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 187066762, now seen corresponding path program 1 times [2024-11-23 23:45:48,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:48,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383293527] [2024-11-23 23:45:48,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:48,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:49,847 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-23 23:45:49,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383293527] [2024-11-23 23:45:49,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383293527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:45:49,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:45:49,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-23 23:45:49,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599151611] [2024-11-23 23:45:49,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:45:49,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 23:45:49,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:49,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 23:45:49,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:45:49,852 INFO L87 Difference]: Start difference. First operand 1583 states and 2021 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:52,883 INFO L93 Difference]: Finished difference Result 1586 states and 2029 transitions. [2024-11-23 23:45:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:45:52,883 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-23 23:45:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:52,885 INFO L225 Difference]: With dead ends: 1586 [2024-11-23 23:45:52,885 INFO L226 Difference]: Without dead ends: 1586 [2024-11-23 23:45:52,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:45:52,886 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1156 mSDsluCounter, 3833 mSDsCounter, 0 mSdLazyCounter, 4041 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 4587 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:52,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 4587 Invalid, 4060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4041 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-23 23:45:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-23 23:45:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1583. [2024-11-23 23:45:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1202 states have (on average 1.6630615640599002) internal successors, (1999), 1569 states have internal predecessors, (1999), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:45:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2019 transitions. [2024-11-23 23:45:52,905 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2019 transitions. Word has length 96 [2024-11-23 23:45:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:52,906 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2019 transitions. [2024-11-23 23:45:52,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2019 transitions. [2024-11-23 23:45:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-23 23:45:52,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45: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] [2024-11-23 23:45:52,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-23 23:45:52,907 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:52,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1341130992, now seen corresponding path program 1 times [2024-11-23 23:45:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802280171] [2024-11-23 23:45:52,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:53,621 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-23 23:45:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802280171] [2024-11-23 23:45:53,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802280171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337557250] [2024-11-23 23:45:53,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:53,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:45:53,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:45:53,625 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:45:53,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:45:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:53,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-23 23:45:53,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:45:54,000 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-23 23:45:54,163 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:45:54,163 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-23 23:45:54,175 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-23 23:45:54,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:54,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:54,369 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:54,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:54,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:54,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-23 23:45:54,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:54,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:54,501 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-23 23:45:54,505 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-23 23:45:54,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:45:54,518 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-23 23:45:54,526 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-23 23:45:54,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-23 23:45:54,672 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-23 23:45:54,733 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-23 23:45:54,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-23 23:45:54,744 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1763))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-23 23:45:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337557250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:54,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:45:54,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2024-11-23 23:45:54,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455039311] [2024-11-23 23:45:54,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:45:54,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-23 23:45:54,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:54,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-23 23:45:54,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=461, Unknown=21, NotChecked=240, Total=812 [2024-11-23 23:45:54,750 INFO L87 Difference]: Start difference. First operand 1583 states and 2019 transitions. Second operand has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:45:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:58,394 INFO L93 Difference]: Finished difference Result 1585 states and 2027 transitions. [2024-11-23 23:45:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:45:58,395 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-23 23:45:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:58,397 INFO L225 Difference]: With dead ends: 1585 [2024-11-23 23:45:58,397 INFO L226 Difference]: Without dead ends: 1585 [2024-11-23 23:45:58,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=886, Unknown=21, NotChecked=330, Total=1406 [2024-11-23 23:45:58,400 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1140 mSDsluCounter, 6560 mSDsCounter, 0 mSdLazyCounter, 5020 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 7307 SdHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:58,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 7307 Invalid, 5046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5020 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-23 23:45:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-23 23:45:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1582. [2024-11-23 23:45:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1202 states have (on average 1.661397670549085) internal successors, (1997), 1568 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:45:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2017 transitions. [2024-11-23 23:45:58,433 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2017 transitions. Word has length 97 [2024-11-23 23:45:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:58,434 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2017 transitions. [2024-11-23 23:45:58,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:45:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2017 transitions. [2024-11-23 23:45:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-23 23:45:58,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:58,435 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-23 23:45:58,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-23 23:45:58,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-23 23:45:58,637 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:58,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1341130993, now seen corresponding path program 1 times [2024-11-23 23:45:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:58,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031940943] [2024-11-23 23:45:58,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:00,085 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-23 23:46:00,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:46:00,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031940943] [2024-11-23 23:46:00,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031940943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:46:00,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817440107] [2024-11-23 23:46:00,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:46:00,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:46:00,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:46:00,088 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:46:00,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 23:46:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:00,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-23 23:46:00,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:46:00,476 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-23 23:46:00,634 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-23 23:46:00,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:46:00,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 23:46:00,655 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-23 23:46:00,660 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-23 23:46:00,729 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-23 23:46:00,734 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-23 23:46:00,914 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:00,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-23 23:46:00,921 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-23 23:46:01,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:01,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-23 23:46:01,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-23 23:46:01,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:01,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-23 23:46:01,128 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-23 23:46:01,204 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:01,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:46:01,209 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-23 23:46:01,231 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-23 23:46:01,237 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-23 23:46:01,245 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-23 23:46:01,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:46:01,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-23 23:46:01,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-23 23:46:01,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-23 23:46:01,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-23 23:46:01,504 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse0 v_ArrVal_1927) (select (select (store .cse1 .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1926))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse3 v_ArrVal_1927) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-23 23:46:01,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1926))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse4 v_ArrVal_1927) .cse5 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-23 23:46:01,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1926))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1924) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-23 23:46:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817440107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:46:01,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:46:01,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-23 23:46:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837413059] [2024-11-23 23:46:01,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:46:01,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-23 23:46:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:46:01,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-23 23:46:01,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=394, Unknown=7, NotChecked=322, Total=812 [2024-11-23 23:46:01,748 INFO L87 Difference]: Start difference. First operand 1582 states and 2017 transitions. Second operand has 20 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:46:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:46:09,663 INFO L93 Difference]: Finished difference Result 1584 states and 2025 transitions. [2024-11-23 23:46:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:46:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2024-11-23 23:46:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:46:09,666 INFO L225 Difference]: With dead ends: 1584 [2024-11-23 23:46:09,666 INFO L226 Difference]: Without dead ends: 1584 [2024-11-23 23:46:09,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=690, Unknown=7, NotChecked=420, Total=1260 [2024-11-23 23:46:09,667 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1141 mSDsluCounter, 8407 mSDsCounter, 0 mSdLazyCounter, 9234 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 9159 SdHoareTripleChecker+Invalid, 9256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:46:09,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 9159 Invalid, 9256 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 9234 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-23 23:46:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-23 23:46:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1554. [2024-11-23 23:46:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1176 states have (on average 1.6734693877551021) internal successors, (1968), 1542 states have internal predecessors, (1968), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:46:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1986 transitions. [2024-11-23 23:46:09,690 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1986 transitions. Word has length 97 [2024-11-23 23:46:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:46:09,690 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 1986 transitions. [2024-11-23 23:46:09,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:46:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1986 transitions. [2024-11-23 23:46:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-23 23:46:09,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:46:09,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:46:09,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-23 23:46:09,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-23 23:46:09,893 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:46:09,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:46:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash -662564405, now seen corresponding path program 1 times [2024-11-23 23:46:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:46:09,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035667503] [2024-11-23 23:46:09,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:46:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:46:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:46:10,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:46:10,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035667503] [2024-11-23 23:46:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035667503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:46:10,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:46:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-23 23:46:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386092103] [2024-11-23 23:46:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:46:10,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 23:46:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:46:10,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 23:46:10,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-23 23:46:10,804 INFO L87 Difference]: Start difference. First operand 1554 states and 1986 transitions. Second operand has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:46:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:46:13,965 INFO L93 Difference]: Finished difference Result 1593 states and 2035 transitions. [2024-11-23 23:46:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 23:46:13,966 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-23 23:46:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:46:13,968 INFO L225 Difference]: With dead ends: 1593 [2024-11-23 23:46:13,968 INFO L226 Difference]: Without dead ends: 1593 [2024-11-23 23:46:13,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-23 23:46:13,969 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1160 mSDsluCounter, 5067 mSDsCounter, 0 mSdLazyCounter, 4040 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 5819 SdHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:46:13,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 5819 Invalid, 4062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4040 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-23 23:46:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2024-11-23 23:46:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1589. [2024-11-23 23:46:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1210 states have (on average 1.6570247933884297) internal successors, (2005), 1575 states have internal predecessors, (2005), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:46:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2025 transitions. [2024-11-23 23:46:13,986 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2025 transitions. Word has length 100 [2024-11-23 23:46:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:46:13,987 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2025 transitions. [2024-11-23 23:46:13,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:46:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2025 transitions. [2024-11-23 23:46:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-23 23:46:13,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:46:13,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:46:13,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-23 23:46:13,989 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:46:13,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:46:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash -662564404, now seen corresponding path program 1 times [2024-11-23 23:46:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:46:13,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705266938] [2024-11-23 23:46:13,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:46:13,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:46:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:15,731 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-23 23:46:15,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:46:15,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705266938] [2024-11-23 23:46:15,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705266938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:46:15,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:46:15,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-23 23:46:15,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681300107] [2024-11-23 23:46:15,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:46:15,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 23:46:15,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:46:15,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 23:46:15,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:46:15,733 INFO L87 Difference]: Start difference. First operand 1589 states and 2025 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:46:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:46:22,779 INFO L93 Difference]: Finished difference Result 1592 states and 2033 transitions. [2024-11-23 23:46:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:46:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-23 23:46:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:46:22,781 INFO L225 Difference]: With dead ends: 1592 [2024-11-23 23:46:22,781 INFO L226 Difference]: Without dead ends: 1592 [2024-11-23 23:46:22,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-23 23:46:22,781 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1156 mSDsluCounter, 6382 mSDsCounter, 0 mSdLazyCounter, 7637 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 7129 SdHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:46:22,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 7129 Invalid, 7660 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 7637 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-23 23:46:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-23 23:46:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1589. [2024-11-23 23:46:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1210 states have (on average 1.6553719008264463) internal successors, (2003), 1575 states have internal predecessors, (2003), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:46:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2023 transitions. [2024-11-23 23:46:22,803 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2023 transitions. Word has length 100 [2024-11-23 23:46:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:46:22,803 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2023 transitions. [2024-11-23 23:46:22,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:46:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2023 transitions. [2024-11-23 23:46:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-23 23:46:22,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:46:22,804 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-23 23:46:22,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-23 23:46:22,805 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:46:22,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:46:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1460643250, now seen corresponding path program 1 times [2024-11-23 23:46:22,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:46:22,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880150848] [2024-11-23 23:46:22,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:46:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:46:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:23,999 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-23 23:46:23,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:46:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880150848] [2024-11-23 23:46:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880150848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:46:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82487595] [2024-11-23 23:46:24,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:46:24,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:46:24,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:46:24,003 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:46:24,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 23:46:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:24,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-23 23:46:24,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:46:24,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-23 23:46:24,558 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:46:24,558 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-23 23:46:24,565 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-23 23:46:24,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:24,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:46:24,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:24,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 42 treesize of output 41 [2024-11-23 23:46:24,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:24,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-23 23:46:24,875 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:24,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:46:24,946 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:24,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:46:24,961 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-23 23:46:24,984 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 23:46:24,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-23 23:46:24,988 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-23 23:46:24,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:46:26,021 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-23 23:46:26,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-23 23:46:26,052 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2271))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2264)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2265)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2266)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2267)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-23 23:46:26,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82487595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:46:26,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:46:26,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2024-11-23 23:46:26,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003371031] [2024-11-23 23:46:26,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:46:26,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-23 23:46:26,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:46:26,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-23 23:46:26,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=934, Unknown=44, NotChecked=64, Total=1190 [2024-11-23 23:46:26,057 INFO L87 Difference]: Start difference. First operand 1589 states and 2023 transitions. Second operand has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:46:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:46:30,967 INFO L93 Difference]: Finished difference Result 1591 states and 2031 transitions. [2024-11-23 23:46:30,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-23 23:46:30,968 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2024-11-23 23:46:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:46:30,970 INFO L225 Difference]: With dead ends: 1591 [2024-11-23 23:46:30,970 INFO L226 Difference]: Without dead ends: 1591 [2024-11-23 23:46:30,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=270, Invalid=1582, Unknown=44, NotChecked=84, Total=1980 [2024-11-23 23:46:30,972 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1143 mSDsluCounter, 8016 mSDsCounter, 0 mSdLazyCounter, 6016 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 8762 SdHoareTripleChecker+Invalid, 6039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:46:30,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 8762 Invalid, 6039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6016 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-23 23:46:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2024-11-23 23:46:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1588. [2024-11-23 23:46:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1210 states have (on average 1.6537190082644628) internal successors, (2001), 1574 states have internal predecessors, (2001), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:46:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2021 transitions. [2024-11-23 23:46:30,996 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2021 transitions. Word has length 101 [2024-11-23 23:46:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:46:30,997 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 2021 transitions. [2024-11-23 23:46:30,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:46:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2021 transitions. [2024-11-23 23:46:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-23 23:46:30,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:46:30,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, 1, 1, 1] [2024-11-23 23:46:31,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-23 23:46:31,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:46:31,199 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:46:31,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:46:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1460643251, now seen corresponding path program 1 times [2024-11-23 23:46:31,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:46:31,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563489239] [2024-11-23 23:46:31,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:46:31,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:46:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:32,891 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-23 23:46:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:46:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563489239] [2024-11-23 23:46:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563489239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:46:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443480899] [2024-11-23 23:46:32,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:46:32,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:46:32,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:46:32,894 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:46:32,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-23 23:46:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:33,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-23 23:46:33,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:46:33,306 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-23 23:46:33,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:46:33,477 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-23 23:46:33,487 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-23 23:46:33,534 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-23 23:46:33,539 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-23 23:46:33,685 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-23 23:46:33,693 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-23 23:46:33,904 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:33,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:46:33,911 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-23 23:46:34,074 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:34,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:46:34,080 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-23 23:46:34,207 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:34,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:46:34,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-23 23:46:34,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:34,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-23 23:46:34,354 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-23 23:46:34,484 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:46:34,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:46:34,492 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-23 23:46:34,525 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-23 23:46:34,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-23 23:46:34,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:46:34,620 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-23 23:46:34,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-23 23:46:34,634 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:46:34,635 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-23 23:46:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:46:34,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:46:37,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2449))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2450))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2448) .cse1 v_ArrVal_2451) .cse2 v_ArrVal_2453) (select (select (store .cse3 .cse2 v_ArrVal_2452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2455))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2456 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2449))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2450))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2452))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2448) .cse6 v_ArrVal_2451) .cse7 v_ArrVal_2453) .cse8 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2456) (select (select (store .cse9 .cse8 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-23 23:46:37,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:46:37,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-23 23:46:37,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_23))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_17))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_26))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_25) .cse0 v_prenex_18) .cse1 v_prenex_24) .cse2 v_prenex_21) (select (select (store .cse3 .cse2 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_19))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2456 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2462))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2449))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2450))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2452))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2461) .cse7 v_ArrVal_2448) .cse8 v_ArrVal_2451) .cse9 v_ArrVal_2453) .cse10 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2456) (select (select (store .cse11 .cse10 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|))))) is different from false [2024-11-23 23:46:37,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443480899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:46:37,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:46:37,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-23 23:46:37,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714581632] [2024-11-23 23:46:37,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:46:37,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-23 23:46:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:46:37,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-23 23:46:37,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1498, Unknown=44, NotChecked=162, Total=1892 [2024-11-23 23:46:37,875 INFO L87 Difference]: Start difference. First operand 1588 states and 2021 transitions. Second operand has 32 states, 29 states have (on average 5.620689655172414) internal successors, (163), 30 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:46:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:46:51,546 INFO L93 Difference]: Finished difference Result 1590 states and 2029 transitions. [2024-11-23 23:46:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-23 23:46:51,547 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.620689655172414) internal successors, (163), 30 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2024-11-23 23:46:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:46:51,550 INFO L225 Difference]: With dead ends: 1590 [2024-11-23 23:46:51,550 INFO L226 Difference]: Without dead ends: 1590 [2024-11-23 23:46:51,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=324, Invalid=2292, Unknown=44, NotChecked=202, Total=2862 [2024-11-23 23:46:51,552 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1147 mSDsluCounter, 8746 mSDsCounter, 0 mSdLazyCounter, 10137 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 9491 SdHoareTripleChecker+Invalid, 10166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 10137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:46:51,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 9491 Invalid, 10166 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 10137 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-23 23:46:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-23 23:46:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1552. [2024-11-23 23:46:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1176 states have (on average 1.6700680272108843) internal successors, (1964), 1540 states have internal predecessors, (1964), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:46:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1982 transitions. [2024-11-23 23:46:51,588 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1982 transitions. Word has length 101 [2024-11-23 23:46:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:46:51,588 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 1982 transitions. [2024-11-23 23:46:51,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.620689655172414) internal successors, (163), 30 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 23:46:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1982 transitions. [2024-11-23 23:46:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-23 23:46:51,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:46:51,590 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-23 23:46:51,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-23 23:46:51,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:46:51,791 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:46:51,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:46:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1214148546, now seen corresponding path program 1 times [2024-11-23 23:46:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:46:51,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710860281] [2024-11-23 23:46:51,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:46:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:46:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:52,748 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-23 23:46:52,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:46:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710860281] [2024-11-23 23:46:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710860281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:46:52,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:46:52,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-23 23:46:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685825308] [2024-11-23 23:46:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:46:52,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 23:46:52,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:46:52,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 23:46:52,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-23 23:46:52,750 INFO L87 Difference]: Start difference. First operand 1552 states and 1982 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:46:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:46:57,434 INFO L93 Difference]: Finished difference Result 1597 states and 2037 transitions. [2024-11-23 23:46:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:46:57,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-23 23:46:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:46:57,437 INFO L225 Difference]: With dead ends: 1597 [2024-11-23 23:46:57,437 INFO L226 Difference]: Without dead ends: 1597 [2024-11-23 23:46:57,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-23 23:46:57,438 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1178 mSDsluCounter, 5847 mSDsCounter, 0 mSdLazyCounter, 4512 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 6598 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:46:57,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 6598 Invalid, 4532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4512 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-23 23:46:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2024-11-23 23:46:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1593. [2024-11-23 23:46:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1216 states have (on average 1.6504934210526316) internal successors, (2007), 1579 states have internal predecessors, (2007), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:46:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2027 transitions. [2024-11-23 23:46:57,461 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2027 transitions. Word has length 103 [2024-11-23 23:46:57,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:46:57,462 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2027 transitions. [2024-11-23 23:46:57,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:46:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2027 transitions. [2024-11-23 23:46:57,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-23 23:46:57,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:46:57,463 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-23 23:46:57,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-23 23:46:57,464 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:46:57,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:46:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1214148547, now seen corresponding path program 1 times [2024-11-23 23:46:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:46:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764833151] [2024-11-23 23:46:57,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:46:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:46:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:46:59,266 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-23 23:46:59,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:46:59,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764833151] [2024-11-23 23:46:59,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764833151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:46:59,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:46:59,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-23 23:46:59,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963818867] [2024-11-23 23:46:59,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:46:59,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:46:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:46:59,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:46:59,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:46:59,268 INFO L87 Difference]: Start difference. First operand 1593 states and 2027 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:47:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:06,641 INFO L93 Difference]: Finished difference Result 1596 states and 2035 transitions. [2024-11-23 23:47:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-23 23:47:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-23 23:47:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:06,643 INFO L225 Difference]: With dead ends: 1596 [2024-11-23 23:47:06,644 INFO L226 Difference]: Without dead ends: 1596 [2024-11-23 23:47:06,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-23 23:47:06,644 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1157 mSDsluCounter, 5647 mSDsCounter, 0 mSdLazyCounter, 5922 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 6393 SdHoareTripleChecker+Invalid, 5944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:06,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 6393 Invalid, 5944 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5922 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-23 23:47:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-23 23:47:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1593. [2024-11-23 23:47:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1216 states have (on average 1.6488486842105263) internal successors, (2005), 1579 states have internal predecessors, (2005), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:47:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2025 transitions. [2024-11-23 23:47:06,660 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2025 transitions. Word has length 103 [2024-11-23 23:47:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:06,661 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2025 transitions. [2024-11-23 23:47:06,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:47:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2025 transitions. [2024-11-23 23:47:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-23 23:47:06,661 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:06,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] [2024-11-23 23:47:06,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-23 23:47:06,662 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:47:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:06,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1710030459, now seen corresponding path program 1 times [2024-11-23 23:47:06,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:06,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912614634] [2024-11-23 23:47:06,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:47:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912614634] [2024-11-23 23:47:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912614634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:07,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:07,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:47:07,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661545768] [2024-11-23 23:47:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:07,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:47:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:07,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:47:07,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:47:07,121 INFO L87 Difference]: Start difference. First operand 1593 states and 2025 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:47:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:08,772 INFO L93 Difference]: Finished difference Result 1592 states and 2023 transitions. [2024-11-23 23:47:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:47:08,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2024-11-23 23:47:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:08,775 INFO L225 Difference]: With dead ends: 1592 [2024-11-23 23:47:08,776 INFO L226 Difference]: Without dead ends: 1592 [2024-11-23 23:47:08,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:47:08,777 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 2 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3711 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:08,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3711 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-23 23:47:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-23 23:47:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2024-11-23 23:47:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1216 states have (on average 1.647203947368421) internal successors, (2003), 1578 states have internal predecessors, (2003), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:47:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2023 transitions. [2024-11-23 23:47:08,796 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2023 transitions. Word has length 104 [2024-11-23 23:47:08,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:08,796 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2023 transitions. [2024-11-23 23:47:08,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:47:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2023 transitions. [2024-11-23 23:47:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-23 23:47:08,797 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:08,797 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-23 23:47:08,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-23 23:47:08,797 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:47:08,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1710030460, now seen corresponding path program 1 times [2024-11-23 23:47:08,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:08,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537936234] [2024-11-23 23:47:08,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:47:10,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:10,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537936234] [2024-11-23 23:47:10,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537936234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:10,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701536762] [2024-11-23 23:47:10,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:10,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:10,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:10,552 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:10,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 23:47:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:10,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-23 23:47:10,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:11,004 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-23 23:47:11,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:47:11,179 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-23 23:47:11,187 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-23 23:47:11,196 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-23 23:47:11,205 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-23 23:47:11,307 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-23 23:47:11,313 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-23 23:47:11,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:47:11,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 73 treesize of output 66 [2024-11-23 23:47:11,640 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-23 23:47:11,814 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:47:11,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:47:11,825 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-23 23:47:11,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:47:11,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:47:11,968 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-23 23:47:12,100 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:47:12,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:47:12,106 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-23 23:47:12,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:47:12,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:47:12,242 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-23 23:47:12,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:47:12,339 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-23 23:47:12,351 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:47:12,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 23:47:12,385 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:47:12,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:47:12,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-23 23:47:12,424 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-23 23:47:12,431 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-23 23:47:12,438 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-23 23:47:12,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:47:12,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2918 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-23 23:47:14,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2911))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2913))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2912) .cse0 v_ArrVal_2914) .cse1 v_ArrVal_2916) (select (select (store .cse2 .cse1 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2918))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2917 Int) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2911))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2913))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2915))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2912) .cse5 v_ArrVal_2914) .cse6 v_ArrVal_2916) .cse7 v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2917) (select (select (store .cse8 .cse7 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-23 23:47:14,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2911))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2913))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2912) .cse1 v_ArrVal_2914) .cse2 v_ArrVal_2916) (select (select (store .cse3 .cse2 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2918))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2917 Int) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2911))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2913))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2915))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2912) .cse6 v_ArrVal_2914) .cse7 v_ArrVal_2916) .cse8 v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2917) (select (select (store .cse9 .cse8 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-23 23:47:49,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:47:49,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1180 treesize of output 1198 [2024-11-23 23:47:54,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2924 (Array Int Int)) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2909 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2925 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2924))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2910))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2911))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2913))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2925) .cse0 v_ArrVal_2909) .cse1 v_ArrVal_2912) .cse2 v_ArrVal_2914) .cse3 v_ArrVal_2916) (select (select (store .cse4 .cse3 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_2918))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((v_ArrVal_2917 Int) (v_prenex_32 Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2919 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_32) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_27))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_prenex_31))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_prenex_30))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_prenex_28))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_prenex_36))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ 43 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_37) .cse9 v_prenex_33) .cse10 v_prenex_29) .cse11 v_prenex_38) .cse12 v_prenex_35) .cse13 v_prenex_34) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| v_prenex_32 v_ArrVal_2917) (select (select (store .cse14 .cse13 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-23 23:47:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701536762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:54,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:47:54,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2024-11-23 23:47:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890848139] [2024-11-23 23:47:54,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:47:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-23 23:47:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:54,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-23 23:47:54,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1100, Unknown=57, NotChecked=292, Total=1640 [2024-11-23 23:47:54,182 INFO L87 Difference]: Start difference. First operand 1592 states and 2023 transitions. Second operand has 27 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:48:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:51,598 INFO L93 Difference]: Finished difference Result 1594 states and 2031 transitions. [2024-11-23 23:48:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-23 23:48:51,599 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2024-11-23 23:48:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:51,601 INFO L225 Difference]: With dead ends: 1594 [2024-11-23 23:48:51,601 INFO L226 Difference]: Without dead ends: 1594 [2024-11-23 23:48:51,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 44.3s TimeCoverageRelationStatistics Valid=330, Invalid=1885, Unknown=57, NotChecked=380, Total=2652 [2024-11-23 23:48:51,602 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1141 mSDsluCounter, 6050 mSDsCounter, 0 mSdLazyCounter, 6788 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 6794 SdHoareTripleChecker+Invalid, 6812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:51,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 6794 Invalid, 6812 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 6788 Invalid, 0 Unknown, 0 Unchecked, 54.5s Time] [2024-11-23 23:48:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-11-23 23:48:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1550. [2024-11-23 23:48:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1176 states have (on average 1.6666666666666667) internal successors, (1960), 1538 states have internal predecessors, (1960), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:48:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1978 transitions. [2024-11-23 23:48:51,626 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1978 transitions. Word has length 104 [2024-11-23 23:48:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:51,627 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 1978 transitions. [2024-11-23 23:48:51,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:48:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1978 transitions. [2024-11-23 23:48:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-23 23:48:51,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:51,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:48:51,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-23 23:48:51,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-23 23:48:51,829 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:48:51,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1514580590, now seen corresponding path program 1 times [2024-11-23 23:48:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:51,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769237555] [2024-11-23 23:48:51,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:54,805 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-23 23:48:54,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769237555] [2024-11-23 23:48:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769237555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:54,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:48:54,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-23 23:48:54,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39467274] [2024-11-23 23:48:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:54,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-23 23:48:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:54,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-23 23:48:54,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-23 23:48:54,807 INFO L87 Difference]: Start difference. First operand 1550 states and 1978 transitions. Second operand has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:49:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:49:46,389 INFO L93 Difference]: Finished difference Result 1635 states and 2087 transitions. [2024-11-23 23:49:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:49:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-23 23:49:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:49:46,393 INFO L225 Difference]: With dead ends: 1635 [2024-11-23 23:49:46,394 INFO L226 Difference]: Without dead ends: 1635 [2024-11-23 23:49:46,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-23 23:49:46,395 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 1188 mSDsluCounter, 8067 mSDsCounter, 0 mSdLazyCounter, 6131 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 8824 SdHoareTripleChecker+Invalid, 6153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:49:46,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 8824 Invalid, 6153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 6131 Invalid, 0 Unknown, 0 Unchecked, 49.9s Time] [2024-11-23 23:49:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-23 23:49:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1597. [2024-11-23 23:49:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1222 states have (on average 1.6440261865793782) internal successors, (2009), 1583 states have internal predecessors, (2009), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:49:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2029 transitions. [2024-11-23 23:49:46,413 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2029 transitions. Word has length 106 [2024-11-23 23:49:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:49:46,413 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2029 transitions. [2024-11-23 23:49:46,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:49:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2029 transitions. [2024-11-23 23:49:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-23 23:49:46,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:49:46,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:49:46,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-23 23:49:46,415 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:49:46,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:49:46,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1514580589, now seen corresponding path program 1 times [2024-11-23 23:49:46,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:49:46,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633029769] [2024-11-23 23:49:46,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:46,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:49:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:50,464 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-23 23:49:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:49:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633029769] [2024-11-23 23:49:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633029769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:49:50,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:49:50,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-23 23:49:50,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867668546] [2024-11-23 23:49:50,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:49:50,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-23 23:49:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:49:50,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 23:49:50,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:49:50,467 INFO L87 Difference]: Start difference. First operand 1597 states and 2029 transitions. Second operand has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:50:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:52,358 INFO L93 Difference]: Finished difference Result 1634 states and 2085 transitions. [2024-11-23 23:50:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:50:52,359 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-23 23:50:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:50:52,361 INFO L225 Difference]: With dead ends: 1634 [2024-11-23 23:50:52,361 INFO L226 Difference]: Without dead ends: 1634 [2024-11-23 23:50:52,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-23 23:50:52,363 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1207 mSDsluCounter, 8405 mSDsCounter, 0 mSdLazyCounter, 6953 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 9158 SdHoareTripleChecker+Invalid, 6976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:50:52,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 9158 Invalid, 6976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6953 Invalid, 0 Unknown, 0 Unchecked, 60.0s Time] [2024-11-23 23:50:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-23 23:50:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1597. [2024-11-23 23:50:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1222 states have (on average 1.6423895253682488) internal successors, (2007), 1583 states have internal predecessors, (2007), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:50:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2027 transitions. [2024-11-23 23:50:52,391 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2027 transitions. Word has length 106 [2024-11-23 23:50:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:50:52,391 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2027 transitions. [2024-11-23 23:50:52,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:50:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2027 transitions. [2024-11-23 23:50:52,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-23 23:50:52,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:50:52,393 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-23 23:50:52,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-23 23:50:52,393 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:50:52,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:52,393 INFO L85 PathProgramCache]: Analyzing trace with hash 910958649, now seen corresponding path program 1 times [2024-11-23 23:50:52,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:50:52,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052030449] [2024-11-23 23:50:52,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:52,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:50:56,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:50:56,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052030449] [2024-11-23 23:50:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052030449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:50:56,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:50:56,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-23 23:50:56,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623165026] [2024-11-23 23:50:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:50:56,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 23:50:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:50:56,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 23:50:56,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:50:56,821 INFO L87 Difference]: Start difference. First operand 1597 states and 2027 transitions. Second operand has 13 states, 12 states have (on average 8.75) internal successors, (105), 13 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:51:37,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:51:37,991 INFO L93 Difference]: Finished difference Result 1596 states and 2025 transitions. [2024-11-23 23:51:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:51:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.75) internal successors, (105), 13 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-23 23:51:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:51:37,993 INFO L225 Difference]: With dead ends: 1596 [2024-11-23 23:51:37,993 INFO L226 Difference]: Without dead ends: 1596 [2024-11-23 23:51:37,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-23 23:51:37,994 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 3424 mSDsluCounter, 5803 mSDsCounter, 0 mSdLazyCounter, 4469 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 6557 SdHoareTripleChecker+Invalid, 4503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:51:37,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 6557 Invalid, 4503 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 4469 Invalid, 0 Unknown, 0 Unchecked, 39.5s Time] [2024-11-23 23:51:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-23 23:51:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2024-11-23 23:51:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1222 states have (on average 1.6407528641571194) internal successors, (2005), 1582 states have internal predecessors, (2005), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:51:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2025 transitions. [2024-11-23 23:51:38,007 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2025 transitions. Word has length 107 [2024-11-23 23:51:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:51:38,007 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2025 transitions. [2024-11-23 23:51:38,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.75) internal successors, (105), 13 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:51:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2025 transitions. [2024-11-23 23:51:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-23 23:51:38,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:51:38,008 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-23 23:51:38,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-23 23:51:38,009 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:51:38,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:51:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash 910958650, now seen corresponding path program 1 times [2024-11-23 23:51:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:51:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786671578] [2024-11-23 23:51:38,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:51:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:51:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:51:42,468 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-23 23:51:42,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:51:42,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786671578] [2024-11-23 23:51:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786671578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:51:42,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998599180] [2024-11-23 23:51:42,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:51:42,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:51:42,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:51:42,475 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:51:42,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 23:51:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:51:42,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-23 23:51:43,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:51:43,026 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-23 23:51:44,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:51:44,309 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-23 23:51:44,347 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-23 23:51:44,370 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-23 23:51:44,957 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:51:44,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:51:44,978 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-23 23:51:45,549 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:51:45,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-23 23:51:45,570 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-23 23:51:46,131 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:51:46,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:51:46,152 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-23 23:51:46,707 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:51:46,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-23 23:51:46,726 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-23 23:51:47,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:51:47,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:51:47,340 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-23 23:51:47,966 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:51:47,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:51:48,011 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-23 23:51:49,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:51:49,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:51:49,139 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-23 23:51:49,259 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-23 23:51:49,276 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-23 23:51:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:51:49,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:51:50,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3412 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-23 23:51:50,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3412 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-23 23:51:50,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:51:50,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 84 [2024-11-23 23:51:50,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3410) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem56#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3409))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-23 23:51:50,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3410) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3409))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-23 23:51:51,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3408))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3407) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3408))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3407) .cse6 v_ArrVal_3410) (select (select (store .cse7 .cse6 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) is different from false [2024-11-23 23:51:51,167 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3408))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3407) .cse1 v_prenex_40) (select (select (store .cse2 .cse1 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3407) .cse4 v_ArrVal_3410) (select (select (store .cse5 .cse4 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3412))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3408))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_3409))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8))))))) is different from false [2024-11-23 23:51:51,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3406))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3408)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3406))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3408))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3405) .cse5 v_ArrVal_3407) .cse6 v_prenex_40) (select (select (store .cse7 .cse6 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3406))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3408))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3405) .cse9 v_ArrVal_3407) .cse10 v_ArrVal_3410) (select (select (store .cse11 .cse10 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) is different from false [2024-11-23 23:51:56,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3406))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3408)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3409))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3406))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3408))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3405) .cse6 v_ArrVal_3407) .cse7 v_ArrVal_3410) (select (select (store .cse8 .cse7 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3412))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3406))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3408))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3405) .cse10 v_ArrVal_3407) .cse11 v_prenex_40) (select (select (store .cse12 .cse11 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-23 23:51:58,451 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3404))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3406)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3408)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3404))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3406))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3408))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3403) .cse6 v_ArrVal_3405) .cse7 v_ArrVal_3407) .cse8 v_ArrVal_3410) (select (select (store .cse9 .cse8 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3404))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3406))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3408))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3403) .cse12 v_ArrVal_3405) .cse13 v_ArrVal_3407) .cse14 v_prenex_40) (select (select (store .cse15 .cse14 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-23 23:52:02,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3404))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3406))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3408))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3403) .cse1 v_ArrVal_3405) .cse2 v_ArrVal_3407) .cse3 v_prenex_40) (select (select (store .cse4 .cse3 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3404))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3406)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3408)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= (select (select (let ((.cse8 (store .cse9 .cse10 v_ArrVal_3409))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) .cse10)))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3404))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3406))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3408))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3403) .cse13 v_ArrVal_3405) .cse14 v_ArrVal_3407) .cse15 v_ArrVal_3410) (select (select (store .cse16 .cse15 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3412))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1))))) is different from false [2024-11-23 23:52:07,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3401))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3404))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3406))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3408))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3402) .cse0 v_ArrVal_3403) .cse1 v_ArrVal_3405) .cse2 v_ArrVal_3407) .cse3 v_ArrVal_3410) (select (select (store .cse4 .cse3 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3412))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3401))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3404)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3406)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3408)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3409))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3401))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_3404))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_3406))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_3408))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3402) .cse15 v_ArrVal_3403) .cse16 v_ArrVal_3405) .cse17 v_ArrVal_3407) .cse18 v_prenex_40) (select (select (store .cse19 .cse18 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) is different from false [2024-11-23 23:52:11,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3401))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3404))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3406))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3402) .cse1 v_ArrVal_3403) .cse2 v_ArrVal_3405) .cse3 v_ArrVal_3407) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3401))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3404)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3406)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3408)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3409))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) .cse12)))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3401))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3404))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3406))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3408))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3402) .cse16 v_ArrVal_3403) .cse17 v_ArrVal_3405) .cse18 v_ArrVal_3407) .cse19 v_ArrVal_3410) (select (select (store .cse20 .cse19 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3412))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1))))) is different from false [2024-11-23 23:52:16,555 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3417 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3418 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3417))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3401))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3404))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3406))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3418) .cse0 v_ArrVal_3402) .cse1 v_ArrVal_3403) .cse2 v_ArrVal_3405) .cse3 v_ArrVal_3407) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3417 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3418 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3417))) (let ((.cse11 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse19 (store .cse20 .cse11 v_ArrVal_3401))) (let ((.cse12 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_3404))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3406))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3408))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3418) .cse11 v_ArrVal_3402) .cse12 v_ArrVal_3403) .cse13 v_ArrVal_3405) .cse14 v_ArrVal_3407) .cse15 v_ArrVal_3410) (select (select (store .cse16 .cse15 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3412))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3417 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3417))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3401)))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3404)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3406)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3408)))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= .cse21 (select (select (let ((.cse22 (store .cse23 .cse21 v_ArrVal_3409))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))) is different from false [2024-11-23 23:52:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998599180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:16,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:52:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 25 [2024-11-23 23:52:16,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944698882] [2024-11-23 23:52:16,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:16,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-23 23:52:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:16,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-23 23:52:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=687, Unknown=13, NotChecked=832, Total=1640 [2024-11-23 23:52:16,644 INFO L87 Difference]: Start difference. First operand 1596 states and 2025 transitions. Second operand has 26 states, 24 states have (on average 6.625) internal successors, (159), 26 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:53:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:53:58,209 INFO L93 Difference]: Finished difference Result 1620 states and 2061 transitions. [2024-11-23 23:53:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-23 23:53:58,210 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.625) internal successors, (159), 26 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-23 23:53:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:53:58,212 INFO L225 Difference]: With dead ends: 1620 [2024-11-23 23:53:58,212 INFO L226 Difference]: Without dead ends: 1620 [2024-11-23 23:53:58,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=208, Invalid=1391, Unknown=13, NotChecked=1144, Total=2756 [2024-11-23 23:53:58,213 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1195 mSDsluCounter, 8058 mSDsCounter, 0 mSdLazyCounter, 7308 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 8802 SdHoareTripleChecker+Invalid, 7342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 7308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:53:58,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 8802 Invalid, 7342 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 7308 Invalid, 0 Unknown, 0 Unchecked, 97.4s Time] [2024-11-23 23:53:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-11-23 23:53:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1548. [2024-11-23 23:53:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1176 states have (on average 1.663265306122449) internal successors, (1956), 1536 states have internal predecessors, (1956), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:53:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1974 transitions. [2024-11-23 23:53:58,234 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1974 transitions. Word has length 107 [2024-11-23 23:53:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:53:58,234 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 1974 transitions. [2024-11-23 23:53:58,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.625) internal successors, (159), 26 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:53:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1974 transitions. [2024-11-23 23:53:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-23 23:53:58,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:53:58,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:53:58,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-23 23:53:58,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6723965-4a6e-401a-9625-07cdffb9dc15/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-23 23:53:58,436 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:53:58,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:53:58,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2056727382, now seen corresponding path program 1 times [2024-11-23 23:53:58,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:53:58,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079905317] [2024-11-23 23:53:58,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:53:58,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:53:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:53:58,830 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-23 23:53:58,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:53:58,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079905317] [2024-11-23 23:53:58,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079905317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:53:58,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:53:58,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:53:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786086714] [2024-11-23 23:53:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:53:58,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:53:58,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:53:58,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:53:58,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:53:58,832 INFO L87 Difference]: Start difference. First operand 1548 states and 1974 transitions. Second operand has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:54:13,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:54:13,372 INFO L93 Difference]: Finished difference Result 1547 states and 1972 transitions. [2024-11-23 23:54:13,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:54:13,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-23 23:54:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:54:13,375 INFO L225 Difference]: With dead ends: 1547 [2024-11-23 23:54:13,375 INFO L226 Difference]: Without dead ends: 1547 [2024-11-23 23:54:13,375 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-23 23:54:13,375 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 5 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:54:13,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3691 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2024-11-23 23:54:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-11-23 23:54:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2024-11-23 23:54:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1176 states have (on average 1.66156462585034) internal successors, (1954), 1535 states have internal predecessors, (1954), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:54:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1972 transitions. [2024-11-23 23:54:13,396 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1972 transitions. Word has length 109 [2024-11-23 23:54:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:54:13,396 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 1972 transitions. [2024-11-23 23:54:13,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:54:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1972 transitions. [2024-11-23 23:54:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-23 23:54:13,397 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:54:13,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:54:13,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-23 23:54:13,397 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:54:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:54:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2056727383, now seen corresponding path program 1 times [2024-11-23 23:54:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:54:13,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109818246] [2024-11-23 23:54:13,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:54:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:54:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:54:18,973 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-23 23:54:18,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:54:18,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109818246] [2024-11-23 23:54:18,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109818246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:54:18,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:54:18,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-23 23:54:18,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728565558] [2024-11-23 23:54:18,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:54:18,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 23:54:18,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:54:18,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 23:54:18,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:54:18,976 INFO L87 Difference]: Start difference. First operand 1547 states and 1972 transitions. Second operand has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:55:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:55:44,842 INFO L93 Difference]: Finished difference Result 1629 states and 2075 transitions. [2024-11-23 23:55:44,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:55:44,843 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-23 23:55:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:55:44,845 INFO L225 Difference]: With dead ends: 1629 [2024-11-23 23:55:44,845 INFO L226 Difference]: Without dead ends: 1629 [2024-11-23 23:55:44,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-23 23:55:44,846 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1211 mSDsluCounter, 8912 mSDsCounter, 0 mSdLazyCounter, 7476 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 9657 SdHoareTripleChecker+Invalid, 7501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.8s IncrementalHoareTripleChecker+Time [2024-11-23 23:55:44,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 9657 Invalid, 7501 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7476 Invalid, 0 Unknown, 0 Unchecked, 82.8s Time] [2024-11-23 23:55:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-23 23:55:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1600. [2024-11-23 23:55:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1228 states have (on average 1.6343648208469055) internal successors, (2007), 1586 states have internal predecessors, (2007), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:55:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2027 transitions. [2024-11-23 23:55:44,863 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2027 transitions. Word has length 109 [2024-11-23 23:55:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:55:44,863 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2027 transitions. [2024-11-23 23:55:44,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:55:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2027 transitions. [2024-11-23 23:55:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-23 23:55:44,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:55:44,864 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-23 23:55:44,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-23 23:55:44,865 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:55:44,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:55:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1528558768, now seen corresponding path program 1 times [2024-11-23 23:55:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:55:44,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318479467] [2024-11-23 23:55:44,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:55:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:55:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:55:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:55:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:55:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318479467] [2024-11-23 23:55:45,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318479467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:55:45,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:55:45,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:55:45,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971875822] [2024-11-23 23:55:45,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:55:45,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:55:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:55:45,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:55:45,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:55:45,486 INFO L87 Difference]: Start difference. First operand 1600 states and 2027 transitions. Second operand has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:55:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:55:58,674 INFO L93 Difference]: Finished difference Result 1599 states and 2025 transitions. [2024-11-23 23:55:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:55:58,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-23 23:55:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:55:58,676 INFO L225 Difference]: With dead ends: 1599 [2024-11-23 23:55:58,676 INFO L226 Difference]: Without dead ends: 1599 [2024-11-23 23:55:58,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:55:58,677 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 4 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:55:58,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3701 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2024-11-23 23:55:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-11-23 23:55:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1546. [2024-11-23 23:55:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1176 states have (on average 1.6598639455782314) internal successors, (1952), 1534 states have internal predecessors, (1952), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:55:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1970 transitions. [2024-11-23 23:55:58,692 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1970 transitions. Word has length 110 [2024-11-23 23:55:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:55:58,692 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 1970 transitions. [2024-11-23 23:55:58,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:55:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1970 transitions. [2024-11-23 23:55:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-23 23:55:58,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:55:58,693 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-23 23:55:58,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-23 23:55:58,693 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:55:58,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:55:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash -665959914, now seen corresponding path program 1 times [2024-11-23 23:55:58,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:55:58,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715301927] [2024-11-23 23:55:58,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:55:58,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:55:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:56:04,980 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-23 23:56:04,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:56:04,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715301927] [2024-11-23 23:56:04,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715301927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:56:04,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:56:04,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-23 23:56:04,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115297248] [2024-11-23 23:56:04,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:56:04,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-23 23:56:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:56:04,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-23 23:56:04,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-23 23:56:04,982 INFO L87 Difference]: Start difference. First operand 1546 states and 1970 transitions. Second operand has 21 states, 20 states have (on average 5.4) internal successors, (108), 21 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:57:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:57:28,490 INFO L93 Difference]: Finished difference Result 1629 states and 2073 transitions. [2024-11-23 23:57:28,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-23 23:57:28,491 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.4) internal successors, (108), 21 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-23 23:57:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:57:28,492 INFO L225 Difference]: With dead ends: 1629 [2024-11-23 23:57:28,492 INFO L226 Difference]: Without dead ends: 1629 [2024-11-23 23:57:28,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2024-11-23 23:57:28,493 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1212 mSDsluCounter, 10153 mSDsCounter, 0 mSdLazyCounter, 7529 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 10900 SdHoareTripleChecker+Invalid, 7558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:57:28,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 10900 Invalid, 7558 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 7529 Invalid, 0 Unknown, 0 Unchecked, 80.2s Time] [2024-11-23 23:57:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-23 23:57:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1601. [2024-11-23 23:57:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1230 states have (on average 1.6317073170731706) internal successors, (2007), 1587 states have internal predecessors, (2007), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-23 23:57:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2031 transitions. [2024-11-23 23:57:28,514 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2031 transitions. Word has length 110 [2024-11-23 23:57:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:57:28,514 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2031 transitions. [2024-11-23 23:57:28,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.4) internal successors, (108), 21 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:57:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2031 transitions. [2024-11-23 23:57:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-23 23:57:28,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:57:28,516 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-23 23:57:28,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-23 23:57:28,516 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:57:28,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:57:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash -665959913, now seen corresponding path program 1 times [2024-11-23 23:57:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:57:28,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277735174] [2024-11-23 23:57:28,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:57:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:57:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:57:34,367 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-23 23:57:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:57:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277735174] [2024-11-23 23:57:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277735174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:57:34,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:57:34,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-23 23:57:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351971573] [2024-11-23 23:57:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:57:34,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:57:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:57:34,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:57:34,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:57:34,369 INFO L87 Difference]: Start difference. First operand 1601 states and 2031 transitions. Second operand has 19 states, 18 states have (on average 6.0) internal successors, (108), 19 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)