./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0521.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_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/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_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0521.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/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_d23d5559-d1ef-490e-aa84-45311352aa1c/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 aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:15:01,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:15:01,471 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-23 23:15:01,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:15:01,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:15:01,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:15:01,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:15:01,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:15:01,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:15:01,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:15:01,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:15:01,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:15:01,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:15:01,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:15:01,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:15:01,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:15:01,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:15:01,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:15:01,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:15:01,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:15:01,515 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 23:15:01,515 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 23:15:01,515 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 23:15:01,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:15:01,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:15:01,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:15:01,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:15:01,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:15:01,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:15:01,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:15:01,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:15:01,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:15:01,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:15:01,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:15:01,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:15:01,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:15:01,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:15:01,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:15:01,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:15:01,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:15:01,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:15:01,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:15:01,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:15:01,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:15:01,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:15:01,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:15:01,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:15:01,518 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_d23d5559-d1ef-490e-aa84-45311352aa1c/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 -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2024-11-23 23:15:01,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:15:01,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:15:01,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:15:01,877 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:15:01,878 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:15:01,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/memsafety/test-0521.i [2024-11-23 23:15:05,356 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/data/a2e5cb2ce/61bca4ec00e44a05a89d282908ca127a/FLAG1288661f7 [2024-11-23 23:15:05,806 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:15:05,807 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/sv-benchmarks/c/memsafety/test-0521.i [2024-11-23 23:15:05,827 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/data/a2e5cb2ce/61bca4ec00e44a05a89d282908ca127a/FLAG1288661f7 [2024-11-23 23:15:05,845 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/data/a2e5cb2ce/61bca4ec00e44a05a89d282908ca127a [2024-11-23 23:15:05,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:15:05,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:15:05,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:15:05,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:15:05,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:15:05,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:05" (1/1) ... [2024-11-23 23:15:05,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e8f3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:05, skipping insertion in model container [2024-11-23 23:15:05,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:05" (1/1) ... [2024-11-23 23:15:05,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:15:06,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:15:06,433 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:15:06,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:15:06,539 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:15:06,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06 WrapperNode [2024-11-23 23:15:06,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:15:06,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:15:06,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:15:06,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:15:06,553 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:15:06" (1/1) ... [2024-11-23 23:15:06,571 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:15:06" (1/1) ... [2024-11-23 23:15:06,613 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 305 [2024-11-23 23:15:06,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:15:06,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:15:06,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:15:06,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:15:06,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,696 INFO L175 MemorySlicer]: Split 76 memory accesses to 6 slices as follows [2, 31, 16, 16, 3, 8]. 41 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 0, 0, 0, 1, 2]. The 26 writes are split as follows [0, 8, 8, 8, 1, 1]. [2024-11-23 23:15:06,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:15:06,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:15:06,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:15:06,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:15:06,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (1/1) ... [2024-11-23 23:15:06,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:15:06,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:15:06,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/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:15:06,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/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:15:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 23:15:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 23:15:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 23:15:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-23 23:15:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-23 23:15:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-23 23:15:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 23:15:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:15:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 23:15:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 23:15:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 23:15:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-23 23:15:06,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-23 23:15:06,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-23 23:15:06,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-23 23:15:06,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 23:15:06,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 23:15:06,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-23 23:15:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-23 23:15:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-23 23:15:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-23 23:15:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:15:06,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-23 23:15:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-23 23:15:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-23 23:15:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-23 23:15:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-23 23:15:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-23 23:15:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:15:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 23:15:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 23:15:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-23 23:15:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-23 23:15:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-23 23:15:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:15:06,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:15:07,119 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:15:07,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:15:08,450 INFO L? ?]: Removed 337 outVars from TransFormulas that were not future-live. [2024-11-23 23:15:08,451 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:15:08,481 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:15:08,482 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-23 23:15:08,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:08 BoogieIcfgContainer [2024-11-23 23:15:08,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:15:08,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:15:08,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:15:08,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:15:08,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:15:05" (1/3) ... [2024-11-23 23:15:08,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea17e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:08, skipping insertion in model container [2024-11-23 23:15:08,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:06" (2/3) ... [2024-11-23 23:15:08,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea17e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:08, skipping insertion in model container [2024-11-23 23:15:08,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:08" (3/3) ... [2024-11-23 23:15:08,497 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0521.i [2024-11-23 23:15:08,517 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:15:08,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0521.i that has 1 procedures, 315 locations, 1 initial locations, 8 loop locations, and 152 error locations. [2024-11-23 23:15:08,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:15:08,592 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;@68ad6b6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:15:08,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2024-11-23 23:15:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 315 states, 162 states have (on average 2.1728395061728394) internal successors, (352), 314 states have internal predecessors, (352), 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:15:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-23 23:15:08,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:08,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-23 23:15:08,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:08,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash 28730505, now seen corresponding path program 1 times [2024-11-23 23:15:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236728688] [2024-11-23 23:15:08,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:08,796 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:15:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236728688] [2024-11-23 23:15:08,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236728688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:08,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:15:08,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040254304] [2024-11-23 23:15:08,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:08,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 23:15:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:08,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 23:15:08,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:15:08,842 INFO L87 Difference]: Start difference. First operand has 315 states, 162 states have (on average 2.1728395061728394) internal successors, (352), 314 states have internal predecessors, (352), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:15:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:08,892 INFO L93 Difference]: Finished difference Result 315 states and 342 transitions. [2024-11-23 23:15:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 23:15:08,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-23 23:15:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:08,906 INFO L225 Difference]: With dead ends: 315 [2024-11-23 23:15:08,906 INFO L226 Difference]: Without dead ends: 313 [2024-11-23 23:15:08,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:15:08,914 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:08,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:15:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-23 23:15:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-11-23 23:15:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 161 states have (on average 2.111801242236025) internal successors, (340), 312 states have internal predecessors, (340), 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:15:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 340 transitions. [2024-11-23 23:15:09,003 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 340 transitions. Word has length 5 [2024-11-23 23:15:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:09,005 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 340 transitions. [2024-11-23 23:15:09,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:15:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 340 transitions. [2024-11-23 23:15:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-23 23:15:09,006 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:09,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-23 23:15:09,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:15:09,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:09,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 889541450, now seen corresponding path program 1 times [2024-11-23 23:15:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785105914] [2024-11-23 23:15:09,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:09,210 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:15:09,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785105914] [2024-11-23 23:15:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785105914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:09,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:15:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633998947] [2024-11-23 23:15:09,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:09,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:09,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:09,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:09,215 INFO L87 Difference]: Start difference. First operand 313 states and 340 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:09,650 INFO L93 Difference]: Finished difference Result 297 states and 324 transitions. [2024-11-23 23:15:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:09,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-23 23:15:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:09,653 INFO L225 Difference]: With dead ends: 297 [2024-11-23 23:15:09,653 INFO L226 Difference]: Without dead ends: 297 [2024-11-23 23:15:09,653 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:15:09,654 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 60 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:09,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 411 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:15:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-23 23:15:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-11-23 23:15:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 161 states have (on average 2.012422360248447) internal successors, (324), 296 states have internal predecessors, (324), 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:15:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 324 transitions. [2024-11-23 23:15:09,683 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 324 transitions. Word has length 6 [2024-11-23 23:15:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:09,684 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 324 transitions. [2024-11-23 23:15:09,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 324 transitions. [2024-11-23 23:15:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-23 23:15:09,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:09,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-23 23:15:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:15:09,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:09,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 889541451, now seen corresponding path program 1 times [2024-11-23 23:15:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059190175] [2024-11-23 23:15:09,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:09,865 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:15:09,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:09,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059190175] [2024-11-23 23:15:09,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059190175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:09,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:09,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:15:09,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651936944] [2024-11-23 23:15:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:09,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:09,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:09,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:09,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:09,867 INFO L87 Difference]: Start difference. First operand 297 states and 324 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:10,217 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2024-11-23 23:15:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:10,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-23 23:15:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:10,219 INFO L225 Difference]: With dead ends: 281 [2024-11-23 23:15:10,219 INFO L226 Difference]: Without dead ends: 281 [2024-11-23 23:15:10,220 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:15:10,225 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 60 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:10,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 420 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:15:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-23 23:15:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-11-23 23:15:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 161 states have (on average 1.9130434782608696) internal successors, (308), 280 states have internal predecessors, (308), 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:15:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 308 transitions. [2024-11-23 23:15:10,249 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 308 transitions. Word has length 6 [2024-11-23 23:15:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:10,249 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 308 transitions. [2024-11-23 23:15:10,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 308 transitions. [2024-11-23 23:15:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:15:10,250 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:10,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:10,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:15:10,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:10,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:10,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890954, now seen corresponding path program 1 times [2024-11-23 23:15:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:10,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729235383] [2024-11-23 23:15:10,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:10,332 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:15:10,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:10,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729235383] [2024-11-23 23:15:10,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729235383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:10,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:10,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:15:10,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855846520] [2024-11-23 23:15:10,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:10,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:10,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:10,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:10,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:10,334 INFO L87 Difference]: Start difference. First operand 281 states and 308 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:15:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:10,638 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2024-11-23 23:15:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:10,639 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:15:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:10,640 INFO L225 Difference]: With dead ends: 279 [2024-11-23 23:15:10,640 INFO L226 Difference]: Without dead ends: 279 [2024-11-23 23:15:10,641 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:15:10,641 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:10,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 455 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:15:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-23 23:15:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2024-11-23 23:15:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 161 states have (on average 1.9006211180124224) internal successors, (306), 278 states have internal predecessors, (306), 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:15:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 306 transitions. [2024-11-23 23:15:10,650 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 306 transitions. Word has length 7 [2024-11-23 23:15:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:10,651 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 306 transitions. [2024-11-23 23:15:10,651 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:15:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2024-11-23 23:15:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:15:10,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:10,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:15:10,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:10,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890955, now seen corresponding path program 1 times [2024-11-23 23:15:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:10,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047890317] [2024-11-23 23:15:10,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:10,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:10,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047890317] [2024-11-23 23:15:10,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047890317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:10,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:10,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:15:10,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422787029] [2024-11-23 23:15:10,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:10,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:10,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:10,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:10,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:10,776 INFO L87 Difference]: Start difference. First operand 279 states and 306 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:15:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:11,065 INFO L93 Difference]: Finished difference Result 277 states and 304 transitions. [2024-11-23 23:15:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:11,066 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:15:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:11,067 INFO L225 Difference]: With dead ends: 277 [2024-11-23 23:15:11,068 INFO L226 Difference]: Without dead ends: 277 [2024-11-23 23:15:11,068 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:15:11,069 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 6 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:11,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 465 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:15:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-23 23:15:11,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-23 23:15:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 161 states have (on average 1.8881987577639752) internal successors, (304), 276 states have internal predecessors, (304), 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:15:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2024-11-23 23:15:11,084 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 7 [2024-11-23 23:15:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:11,085 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2024-11-23 23:15:11,085 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:15:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2024-11-23 23:15:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-23 23:15:11,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:11,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:11,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:15:11,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:11,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:11,086 INFO L85 PathProgramCache]: Analyzing trace with hash 150842187, now seen corresponding path program 1 times [2024-11-23 23:15:11,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:11,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837166737] [2024-11-23 23:15:11,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:11,186 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:15:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:11,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837166737] [2024-11-23 23:15:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837166737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:11,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:11,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:15:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162936056] [2024-11-23 23:15:11,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:11,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:15:11,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:11,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:15:11,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:15:11,188 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:15:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:11,280 INFO L93 Difference]: Finished difference Result 342 states and 377 transitions. [2024-11-23 23:15:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:15:11,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-11-23 23:15:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:11,282 INFO L225 Difference]: With dead ends: 342 [2024-11-23 23:15:11,283 INFO L226 Difference]: Without dead ends: 342 [2024-11-23 23:15:11,283 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:15:11,284 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 69 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:11,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 876 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:15:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-23 23:15:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 282. [2024-11-23 23:15:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 166 states have (on average 1.8674698795180722) internal successors, (310), 281 states have internal predecessors, (310), 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:15:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 310 transitions. [2024-11-23 23:15:11,295 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 310 transitions. Word has length 8 [2024-11-23 23:15:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:11,296 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 310 transitions. [2024-11-23 23:15:11,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:15:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 310 transitions. [2024-11-23 23:15:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 23:15:11,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:11,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:11,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 23:15:11,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:11,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash 712820468, now seen corresponding path program 1 times [2024-11-23 23:15:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86300550] [2024-11-23 23:15:11,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86300550] [2024-11-23 23:15:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86300550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:11,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:11,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:15:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833613485] [2024-11-23 23:15:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:11,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:11,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:11,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:11,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:11,399 INFO L87 Difference]: Start difference. First operand 282 states and 310 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:11,694 INFO L93 Difference]: Finished difference Result 280 states and 308 transitions. [2024-11-23 23:15:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:11,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-23 23:15:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:11,697 INFO L225 Difference]: With dead ends: 280 [2024-11-23 23:15:11,697 INFO L226 Difference]: Without dead ends: 280 [2024-11-23 23:15:11,697 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:15:11,698 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 2 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:11,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 454 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:15:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-23 23:15:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-11-23 23:15:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 166 states have (on average 1.855421686746988) internal successors, (308), 279 states have internal predecessors, (308), 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:15:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2024-11-23 23:15:11,718 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 12 [2024-11-23 23:15:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:11,718 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2024-11-23 23:15:11,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2024-11-23 23:15:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 23:15:11,721 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:11,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:15:11,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash 712820469, now seen corresponding path program 1 times [2024-11-23 23:15:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256844869] [2024-11-23 23:15:11,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:11,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:11,928 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:15:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:11,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256844869] [2024-11-23 23:15:11,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256844869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:11,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:11,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:15:11,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816534521] [2024-11-23 23:15:11,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:11,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:11,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:11,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:11,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:11,930 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:12,215 INFO L93 Difference]: Finished difference Result 278 states and 306 transitions. [2024-11-23 23:15:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:12,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-23 23:15:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:12,217 INFO L225 Difference]: With dead ends: 278 [2024-11-23 23:15:12,217 INFO L226 Difference]: Without dead ends: 278 [2024-11-23 23:15:12,218 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:15:12,219 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:12,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 464 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:15:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-23 23:15:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-23 23:15:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 166 states have (on average 1.8433734939759037) internal successors, (306), 277 states have internal predecessors, (306), 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:15:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2024-11-23 23:15:12,235 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 12 [2024-11-23 23:15:12,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:12,235 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2024-11-23 23:15:12,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2024-11-23 23:15:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 23:15:12,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:12,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:12,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 23:15:12,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:12,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash 304404885, now seen corresponding path program 1 times [2024-11-23 23:15:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:12,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243788716] [2024-11-23 23:15:12,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:12,498 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:15:12,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:12,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243788716] [2024-11-23 23:15:12,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243788716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:12,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:12,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:15:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202229939] [2024-11-23 23:15:12,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:12,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:15:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:12,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:15:12,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:15:12,500 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:15:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:12,747 INFO L93 Difference]: Finished difference Result 331 states and 366 transitions. [2024-11-23 23:15:12,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:15:12,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:15:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:12,750 INFO L225 Difference]: With dead ends: 331 [2024-11-23 23:15:12,752 INFO L226 Difference]: Without dead ends: 331 [2024-11-23 23:15:12,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:15:12,753 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 81 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:12,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1429 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:15:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-23 23:15:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 281. [2024-11-23 23:15:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 169 states have (on average 1.8284023668639053) internal successors, (309), 280 states have internal predecessors, (309), 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:15:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 309 transitions. [2024-11-23 23:15:12,770 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 309 transitions. Word has length 13 [2024-11-23 23:15:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:12,770 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 309 transitions. [2024-11-23 23:15:12,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:15:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 309 transitions. [2024-11-23 23:15:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 23:15:12,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:12,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:12,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:15:12,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:12,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:12,773 INFO L85 PathProgramCache]: Analyzing trace with hash 466457004, now seen corresponding path program 1 times [2024-11-23 23:15:12,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:12,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727208890] [2024-11-23 23:15:12,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:12,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:12,933 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:15:12,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:12,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727208890] [2024-11-23 23:15:12,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727208890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:12,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:12,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:15:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994130448] [2024-11-23 23:15:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:12,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:12,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:12,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:12,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:12,935 INFO L87 Difference]: Start difference. First operand 281 states and 309 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:15:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:13,062 INFO L93 Difference]: Finished difference Result 405 states and 445 transitions. [2024-11-23 23:15:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:15:13,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:15:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:13,065 INFO L225 Difference]: With dead ends: 405 [2024-11-23 23:15:13,065 INFO L226 Difference]: Without dead ends: 405 [2024-11-23 23:15:13,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:15:13,067 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 132 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:13,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1127 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:15:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-23 23:15:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 344. [2024-11-23 23:15:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 232 states have (on average 1.8793103448275863) internal successors, (436), 343 states have internal predecessors, (436), 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:15:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 436 transitions. [2024-11-23 23:15:13,078 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 436 transitions. Word has length 15 [2024-11-23 23:15:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:13,078 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 436 transitions. [2024-11-23 23:15:13,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:15:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 436 transitions. [2024-11-23 23:15:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-23 23:15:13,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:13,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:13,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 23:15:13,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:13,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1466565047, now seen corresponding path program 1 times [2024-11-23 23:15:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804154808] [2024-11-23 23:15:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:13,156 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:15:13,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:13,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804154808] [2024-11-23 23:15:13,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804154808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:13,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:13,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:15:13,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902877229] [2024-11-23 23:15:13,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:13,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:13,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:13,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:13,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:13,158 INFO L87 Difference]: Start difference. First operand 344 states and 436 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:13,186 INFO L93 Difference]: Finished difference Result 329 states and 411 transitions. [2024-11-23 23:15:13,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:13,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-23 23:15:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:13,189 INFO L225 Difference]: With dead ends: 329 [2024-11-23 23:15:13,191 INFO L226 Difference]: Without dead ends: 329 [2024-11-23 23:15:13,191 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:15:13,192 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:13,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:15:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-23 23:15:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-11-23 23:15:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 217 states have (on average 1.8940092165898617) internal successors, (411), 328 states have internal predecessors, (411), 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:15:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 411 transitions. [2024-11-23 23:15:13,208 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 411 transitions. Word has length 16 [2024-11-23 23:15:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:13,208 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 411 transitions. [2024-11-23 23:15:13,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 411 transitions. [2024-11-23 23:15:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 23:15:13,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:13,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:13,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 23:15:13,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:13,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1588780882, now seen corresponding path program 1 times [2024-11-23 23:15:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:13,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49384474] [2024-11-23 23:15:13,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:13,297 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:15:13,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:13,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49384474] [2024-11-23 23:15:13,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49384474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:13,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:13,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:15:13,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429594742] [2024-11-23 23:15:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:13,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:13,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:13,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:13,298 INFO L87 Difference]: Start difference. First operand 329 states and 411 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:15:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:13,569 INFO L93 Difference]: Finished difference Result 313 states and 379 transitions. [2024-11-23 23:15:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:13,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-23 23:15:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:13,571 INFO L225 Difference]: With dead ends: 313 [2024-11-23 23:15:13,571 INFO L226 Difference]: Without dead ends: 313 [2024-11-23 23:15:13,571 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:15:13,572 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:13,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 351 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:15:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-23 23:15:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-11-23 23:15:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 217 states have (on average 1.7465437788018434) internal successors, (379), 312 states have internal predecessors, (379), 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:15:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 379 transitions. [2024-11-23 23:15:13,582 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 379 transitions. Word has length 17 [2024-11-23 23:15:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:13,582 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 379 transitions. [2024-11-23 23:15:13,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:15:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 379 transitions. [2024-11-23 23:15:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 23:15:13,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:13,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:13,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 23:15:13,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1588780883, now seen corresponding path program 1 times [2024-11-23 23:15:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920900251] [2024-11-23 23:15:13,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:13,696 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:15:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:13,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920900251] [2024-11-23 23:15:13,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920900251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:13,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:13,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:15:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171024489] [2024-11-23 23:15:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:13,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:13,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:13,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:13,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:13,698 INFO L87 Difference]: Start difference. First operand 313 states and 379 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:15:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:13,946 INFO L93 Difference]: Finished difference Result 297 states and 347 transitions. [2024-11-23 23:15:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:13,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-23 23:15:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:13,948 INFO L225 Difference]: With dead ends: 297 [2024-11-23 23:15:13,949 INFO L226 Difference]: Without dead ends: 297 [2024-11-23 23:15:13,949 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:15:13,949 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 60 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:13,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 360 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:15:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-23 23:15:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-11-23 23:15:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 217 states have (on average 1.599078341013825) internal successors, (347), 296 states have internal predecessors, (347), 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:15:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 347 transitions. [2024-11-23 23:15:13,961 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 347 transitions. Word has length 17 [2024-11-23 23:15:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:13,961 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 347 transitions. [2024-11-23 23:15:13,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:15:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 347 transitions. [2024-11-23 23:15:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-23 23:15:13,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:13,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:13,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 23:15:13,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:13,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2105047220, now seen corresponding path program 1 times [2024-11-23 23:15:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:13,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977843845] [2024-11-23 23:15:13,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:13,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:14,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:14,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977843845] [2024-11-23 23:15:14,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977843845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:14,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:14,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:15:14,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099032048] [2024-11-23 23:15:14,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:14,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:14,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:14,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:14,110 INFO L87 Difference]: Start difference. First operand 297 states and 347 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:15:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:14,238 INFO L93 Difference]: Finished difference Result 316 states and 351 transitions. [2024-11-23 23:15:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:15:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-23 23:15:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:14,241 INFO L225 Difference]: With dead ends: 316 [2024-11-23 23:15:14,241 INFO L226 Difference]: Without dead ends: 316 [2024-11-23 23:15:14,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:15:14,241 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 65 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:14,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 998 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:15:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-23 23:15:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 295. [2024-11-23 23:15:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 215 states have (on average 1.5906976744186045) internal successors, (342), 294 states have internal predecessors, (342), 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:15:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 342 transitions. [2024-11-23 23:15:14,252 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 342 transitions. Word has length 19 [2024-11-23 23:15:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:14,252 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 342 transitions. [2024-11-23 23:15:14,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:15:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 342 transitions. [2024-11-23 23:15:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-23 23:15:14,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:14,254 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:14,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 23:15:14,254 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:14,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -339892194, now seen corresponding path program 1 times [2024-11-23 23:15:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249833139] [2024-11-23 23:15:14,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249833139] [2024-11-23 23:15:14,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249833139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:14,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:14,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:15:14,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499013778] [2024-11-23 23:15:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:14,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:15:14,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:14,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:15:14,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:15:14,509 INFO L87 Difference]: Start difference. First operand 295 states and 342 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:14,995 INFO L93 Difference]: Finished difference Result 317 states and 366 transitions. [2024-11-23 23:15:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:15:14,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-23 23:15:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:14,997 INFO L225 Difference]: With dead ends: 317 [2024-11-23 23:15:14,997 INFO L226 Difference]: Without dead ends: 317 [2024-11-23 23:15:14,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:15:14,998 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 83 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:14,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 627 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:15:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-23 23:15:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 297. [2024-11-23 23:15:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 219 states have (on average 1.5844748858447488) internal successors, (347), 296 states have internal predecessors, (347), 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:15:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 347 transitions. [2024-11-23 23:15:15,007 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 347 transitions. Word has length 20 [2024-11-23 23:15:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:15,008 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 347 transitions. [2024-11-23 23:15:15,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 347 transitions. [2024-11-23 23:15:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-23 23:15:15,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:15,009 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:15,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 23:15:15,011 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:15,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash -339892193, now seen corresponding path program 1 times [2024-11-23 23:15:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:15,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922829060] [2024-11-23 23:15:15,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:15,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:15,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:15,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922829060] [2024-11-23 23:15:15,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922829060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:15,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:15,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:15:15,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826784068] [2024-11-23 23:15:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:15,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:15,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:15,276 INFO L87 Difference]: Start difference. First operand 297 states and 347 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:15,787 INFO L93 Difference]: Finished difference Result 305 states and 355 transitions. [2024-11-23 23:15:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:15:15,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-23 23:15:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:15,789 INFO L225 Difference]: With dead ends: 305 [2024-11-23 23:15:15,790 INFO L226 Difference]: Without dead ends: 305 [2024-11-23 23:15:15,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:15:15,791 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 65 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:15,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 667 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 23:15:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-23 23:15:15,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 296. [2024-11-23 23:15:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.5799086757990868) internal successors, (346), 295 states have internal predecessors, (346), 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:15:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2024-11-23 23:15:15,803 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 20 [2024-11-23 23:15:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:15,804 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2024-11-23 23:15:15,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2024-11-23 23:15:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-23 23:15:15,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:15,805 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] [2024-11-23 23:15:15,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-23 23:15:15,806 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:15,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash -319613048, now seen corresponding path program 1 times [2024-11-23 23:15:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:15,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919803938] [2024-11-23 23:15:15,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:16,114 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:15:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919803938] [2024-11-23 23:15:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919803938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:16,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 23:15:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578020451] [2024-11-23 23:15:16,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:16,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:15:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:16,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:15:16,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:15:16,119 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:15:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:16,392 INFO L93 Difference]: Finished difference Result 314 states and 352 transitions. [2024-11-23 23:15:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:15:16,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2024-11-23 23:15:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:16,395 INFO L225 Difference]: With dead ends: 314 [2024-11-23 23:15:16,395 INFO L226 Difference]: Without dead ends: 314 [2024-11-23 23:15:16,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:15:16,397 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 82 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:16,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1464 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:15:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-23 23:15:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 282. [2024-11-23 23:15:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 205 states have (on average 1.575609756097561) internal successors, (323), 281 states have internal predecessors, (323), 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:15:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 323 transitions. [2024-11-23 23:15:16,406 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 323 transitions. Word has length 24 [2024-11-23 23:15:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:16,406 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 323 transitions. [2024-11-23 23:15:16,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:15:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 323 transitions. [2024-11-23 23:15:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-23 23:15:16,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:16,407 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:16,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-23 23:15:16,408 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:16,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2081482914, now seen corresponding path program 1 times [2024-11-23 23:15:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:16,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140861987] [2024-11-23 23:15:16,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:16,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:16,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140861987] [2024-11-23 23:15:16,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140861987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:16,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:16,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:15:16,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547829849] [2024-11-23 23:15:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:16,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:16,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:16,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:16,507 INFO L87 Difference]: Start difference. First operand 282 states and 323 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:15:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:16,595 INFO L93 Difference]: Finished difference Result 291 states and 331 transitions. [2024-11-23 23:15:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:15:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2024-11-23 23:15:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:16,597 INFO L225 Difference]: With dead ends: 291 [2024-11-23 23:15:16,597 INFO L226 Difference]: Without dead ends: 291 [2024-11-23 23:15:16,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:15:16,598 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 68 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:16,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1001 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:15:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-23 23:15:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 282. [2024-11-23 23:15:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 205 states have (on average 1.5707317073170732) internal successors, (322), 281 states have internal predecessors, (322), 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:15:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 322 transitions. [2024-11-23 23:15:16,607 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 322 transitions. Word has length 25 [2024-11-23 23:15:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:16,607 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 322 transitions. [2024-11-23 23:15:16,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:15:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 322 transitions. [2024-11-23 23:15:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-23 23:15:16,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:16,609 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] [2024-11-23 23:15:16,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 23:15:16,611 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2080659075, now seen corresponding path program 1 times [2024-11-23 23:15:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:16,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251513402] [2024-11-23 23:15:16,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:16,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:16,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251513402] [2024-11-23 23:15:16,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251513402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:16,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:16,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:15:16,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240800478] [2024-11-23 23:15:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:16,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:16,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:16,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:16,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:16,790 INFO L87 Difference]: Start difference. First operand 282 states and 322 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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:15:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:17,230 INFO L93 Difference]: Finished difference Result 291 states and 324 transitions. [2024-11-23 23:15:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:15:17,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-11-23 23:15:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:17,232 INFO L225 Difference]: With dead ends: 291 [2024-11-23 23:15:17,233 INFO L226 Difference]: Without dead ends: 287 [2024-11-23 23:15:17,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:17,233 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 27 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:17,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 671 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:15:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-23 23:15:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 280. [2024-11-23 23:15:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5714285714285714) internal successors, (319), 279 states have internal predecessors, (319), 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:15:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 319 transitions. [2024-11-23 23:15:17,242 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 319 transitions. Word has length 26 [2024-11-23 23:15:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:17,242 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 319 transitions. [2024-11-23 23:15:17,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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:15:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 319 transitions. [2024-11-23 23:15:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-23 23:15:17,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:17,244 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:17,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-23 23:15:17,244 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:17,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash -234471107, now seen corresponding path program 1 times [2024-11-23 23:15:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:17,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576018500] [2024-11-23 23:15:17,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:17,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:17,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:17,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576018500] [2024-11-23 23:15:17,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576018500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:17,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:17,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-23 23:15:17,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161520997] [2024-11-23 23:15:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:17,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-23 23:15:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:17,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 23:15:17,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-23 23:15:17,838 INFO L87 Difference]: Start difference. First operand 280 states and 319 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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:15:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:18,895 INFO L93 Difference]: Finished difference Result 284 states and 323 transitions. [2024-11-23 23:15:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 23:15:18,896 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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 27 [2024-11-23 23:15:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:18,898 INFO L225 Difference]: With dead ends: 284 [2024-11-23 23:15:18,899 INFO L226 Difference]: Without dead ends: 284 [2024-11-23 23:15:18,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:15:18,900 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 80 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:18,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1313 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-23 23:15:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-23 23:15:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 279. [2024-11-23 23:15:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 203 states have (on average 1.5665024630541873) internal successors, (318), 278 states have internal predecessors, (318), 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:15:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 318 transitions. [2024-11-23 23:15:18,914 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 318 transitions. Word has length 27 [2024-11-23 23:15:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:18,914 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 318 transitions. [2024-11-23 23:15:18,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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:15:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2024-11-23 23:15:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-23 23:15:18,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:18,915 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:18,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-23 23:15:18,916 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:18,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -234471106, now seen corresponding path program 1 times [2024-11-23 23:15:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:18,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142545857] [2024-11-23 23:15:18,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142545857] [2024-11-23 23:15:19,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142545857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:19,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:19,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-23 23:15:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758503851] [2024-11-23 23:15:19,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:19,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-23 23:15:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:19,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 23:15:19,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-23 23:15:19,807 INFO L87 Difference]: Start difference. First operand 279 states and 318 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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:15:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:20,950 INFO L93 Difference]: Finished difference Result 283 states and 322 transitions. [2024-11-23 23:15:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 23:15:20,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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 27 [2024-11-23 23:15:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:20,952 INFO L225 Difference]: With dead ends: 283 [2024-11-23 23:15:20,952 INFO L226 Difference]: Without dead ends: 283 [2024-11-23 23:15:20,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-23 23:15:20,953 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 80 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:20,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1382 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-23 23:15:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-23 23:15:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2024-11-23 23:15:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 203 states have (on average 1.561576354679803) internal successors, (317), 277 states have internal predecessors, (317), 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:15:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 317 transitions. [2024-11-23 23:15:20,961 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 317 transitions. Word has length 27 [2024-11-23 23:15:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:20,961 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 317 transitions. [2024-11-23 23:15:20,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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:15:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2024-11-23 23:15:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-23 23:15:20,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:20,962 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] [2024-11-23 23:15:20,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-23 23:15:20,962 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:20,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:20,963 INFO L85 PathProgramCache]: Analyzing trace with hash -32938849, now seen corresponding path program 1 times [2024-11-23 23:15:20,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914983868] [2024-11-23 23:15:20,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:21,015 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:15:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914983868] [2024-11-23 23:15:21,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914983868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:21,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:21,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:15:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004817663] [2024-11-23 23:15:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:21,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:21,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:21,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:21,018 INFO L87 Difference]: Start difference. First operand 278 states and 317 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:15:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:21,036 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2024-11-23 23:15:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:21,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2024-11-23 23:15:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:21,041 INFO L225 Difference]: With dead ends: 263 [2024-11-23 23:15:21,041 INFO L226 Difference]: Without dead ends: 245 [2024-11-23 23:15:21,041 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:15:21,043 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:21,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:15:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-23 23:15:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-23 23:15:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 170 states have (on average 1.611764705882353) internal successors, (274), 244 states have internal predecessors, (274), 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:15:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2024-11-23 23:15:21,052 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 27 [2024-11-23 23:15:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:21,052 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2024-11-23 23:15:21,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:15:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2024-11-23 23:15:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-23 23:15:21,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:21,053 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:21,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-23 23:15:21,054 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:21,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1997295788, now seen corresponding path program 1 times [2024-11-23 23:15:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:21,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059734662] [2024-11-23 23:15:21,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:21,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:21,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:21,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059734662] [2024-11-23 23:15:21,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059734662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:21,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:21,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:15:21,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606336914] [2024-11-23 23:15:21,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:21,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 23:15:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:21,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 23:15:21,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:15:21,294 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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:15:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:21,526 INFO L93 Difference]: Finished difference Result 264 states and 295 transitions. [2024-11-23 23:15:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 23:15:21,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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:15:21,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:21,528 INFO L225 Difference]: With dead ends: 264 [2024-11-23 23:15:21,528 INFO L226 Difference]: Without dead ends: 264 [2024-11-23 23:15:21,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-23 23:15:21,529 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 114 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:21,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1597 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:15:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-23 23:15:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 245. [2024-11-23 23:15:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 170 states have (on average 1.6058823529411765) internal successors, (273), 244 states have internal predecessors, (273), 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:15:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 273 transitions. [2024-11-23 23:15:21,535 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 273 transitions. Word has length 29 [2024-11-23 23:15:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:21,536 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 273 transitions. [2024-11-23 23:15:21,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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:15:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 273 transitions. [2024-11-23 23:15:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-23 23:15:21,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:21,537 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:21,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-23 23:15:21,537 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:21,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash 376377735, now seen corresponding path program 1 times [2024-11-23 23:15:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:21,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636151319] [2024-11-23 23:15:21,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 23:15:21,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:21,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636151319] [2024-11-23 23:15:21,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636151319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:21,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:21,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:15:21,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055167230] [2024-11-23 23:15:21,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:21,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:21,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:21,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:21,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:21,783 INFO L87 Difference]: Start difference. First operand 245 states and 273 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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:15:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:22,137 INFO L93 Difference]: Finished difference Result 263 states and 294 transitions. [2024-11-23 23:15:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:15:22,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-23 23:15:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:22,139 INFO L225 Difference]: With dead ends: 263 [2024-11-23 23:15:22,139 INFO L226 Difference]: Without dead ends: 263 [2024-11-23 23:15:22,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:15:22,140 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 22 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:22,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 739 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:15:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-23 23:15:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 244. [2024-11-23 23:15:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 170 states have (on average 1.6) internal successors, (272), 243 states have internal predecessors, (272), 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:15:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 272 transitions. [2024-11-23 23:15:22,147 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 272 transitions. Word has length 31 [2024-11-23 23:15:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:22,147 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 272 transitions. [2024-11-23 23:15:22,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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:15:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 272 transitions. [2024-11-23 23:15:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-23 23:15:22,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:22,148 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:22,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-23 23:15:22,148 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:22,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash 376377736, now seen corresponding path program 1 times [2024-11-23 23:15:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:22,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354781938] [2024-11-23 23:15:22,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:22,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:22,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:22,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354781938] [2024-11-23 23:15:22,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354781938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:22,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:22,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:15:22,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081545849] [2024-11-23 23:15:22,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:22,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:15:22,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:22,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:15:22,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:15:22,803 INFO L87 Difference]: Start difference. First operand 244 states and 272 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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:15:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:23,753 INFO L93 Difference]: Finished difference Result 271 states and 302 transitions. [2024-11-23 23:15:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:15:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-23 23:15:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:23,755 INFO L225 Difference]: With dead ends: 271 [2024-11-23 23:15:23,755 INFO L226 Difference]: Without dead ends: 271 [2024-11-23 23:15:23,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-23 23:15:23,756 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 103 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:23,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1013 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-23 23:15:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-23 23:15:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 243. [2024-11-23 23:15:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 170 states have (on average 1.5941176470588236) internal successors, (271), 242 states have internal predecessors, (271), 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:15:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2024-11-23 23:15:23,767 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 31 [2024-11-23 23:15:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:23,767 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2024-11-23 23:15:23,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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:15:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2024-11-23 23:15:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-23 23:15:23,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:23,768 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:23,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-23 23:15:23,768 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:23,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash 41356335, now seen corresponding path program 1 times [2024-11-23 23:15:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171592386] [2024-11-23 23:15:23,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:24,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171592386] [2024-11-23 23:15:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171592386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:24,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:24,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-23 23:15:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307652508] [2024-11-23 23:15:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:24,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:15:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:24,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:15:24,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:15:24,134 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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:15:24,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:24,567 INFO L93 Difference]: Finished difference Result 247 states and 275 transitions. [2024-11-23 23:15:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 23:15:24,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 35 [2024-11-23 23:15:24,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:24,569 INFO L225 Difference]: With dead ends: 247 [2024-11-23 23:15:24,569 INFO L226 Difference]: Without dead ends: 247 [2024-11-23 23:15:24,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:15:24,570 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 71 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:24,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2213 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:15:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-23 23:15:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2024-11-23 23:15:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 171 states have (on average 1.590643274853801) internal successors, (272), 243 states have internal predecessors, (272), 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:15:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 272 transitions. [2024-11-23 23:15:24,577 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 272 transitions. Word has length 35 [2024-11-23 23:15:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:24,577 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 272 transitions. [2024-11-23 23:15:24,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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:15:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 272 transitions. [2024-11-23 23:15:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-23 23:15:24,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:24,577 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:24,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-23 23:15:24,578 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:24,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1040791695, now seen corresponding path program 1 times [2024-11-23 23:15:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277384752] [2024-11-23 23:15:24,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:24,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:25,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:25,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277384752] [2024-11-23 23:15:25,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277384752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:15:25,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118150202] [2024-11-23 23:15:25,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:25,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:15:25,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:15:25,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:15:25,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:15:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:25,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-23 23:15:25,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:15:25,950 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:15:25,959 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:15:26,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:15:26,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:15:26,164 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 54 treesize of output 34 [2024-11-23 23:15:26,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-23 23:15:26,241 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 54 treesize of output 34 [2024-11-23 23:15:26,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-23 23:15:26,274 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 30 [2024-11-23 23:15:26,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-23 23:15:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:26,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:15:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118150202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:15:26,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:15:26,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2024-11-23 23:15:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918545602] [2024-11-23 23:15:26,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:15:26,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-23 23:15:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:26,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-23 23:15:26,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-23 23:15:26,561 INFO L87 Difference]: Start difference. First operand 244 states and 272 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:27,456 INFO L93 Difference]: Finished difference Result 326 states and 363 transitions. [2024-11-23 23:15:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:15:27,457 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-23 23:15:27,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:27,459 INFO L225 Difference]: With dead ends: 326 [2024-11-23 23:15:27,459 INFO L226 Difference]: Without dead ends: 326 [2024-11-23 23:15:27,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2024-11-23 23:15:27,460 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 94 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:27,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 2592 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-23 23:15:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-23 23:15:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 273. [2024-11-23 23:15:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 200 states have (on average 1.515) internal successors, (303), 272 states have internal predecessors, (303), 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:15:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 303 transitions. [2024-11-23 23:15:27,468 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 303 transitions. Word has length 35 [2024-11-23 23:15:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:27,468 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 303 transitions. [2024-11-23 23:15:27,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 303 transitions. [2024-11-23 23:15:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-23 23:15:27,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:27,469 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:27,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 23:15:27,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:15:27,674 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:27,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:27,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1173346196, now seen corresponding path program 1 times [2024-11-23 23:15:27,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:27,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450406277] [2024-11-23 23:15:27,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:27,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:28,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:28,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450406277] [2024-11-23 23:15:28,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450406277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:28,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:28,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-23 23:15:28,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968229173] [2024-11-23 23:15:28,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:28,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 23:15:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:28,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 23:15:28,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-23 23:15:28,875 INFO L87 Difference]: Start difference. First operand 273 states and 303 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:29,717 INFO L93 Difference]: Finished difference Result 273 states and 301 transitions. [2024-11-23 23:15:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:15:29,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-23 23:15:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:29,719 INFO L225 Difference]: With dead ends: 273 [2024-11-23 23:15:29,719 INFO L226 Difference]: Without dead ends: 273 [2024-11-23 23:15:29,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2024-11-23 23:15:29,720 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 72 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:29,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2124 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 23:15:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-23 23:15:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-23 23:15:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 200 states have (on average 1.505) internal successors, (301), 272 states have internal predecessors, (301), 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:15:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 301 transitions. [2024-11-23 23:15:29,730 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 301 transitions. Word has length 36 [2024-11-23 23:15:29,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:29,731 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 301 transitions. [2024-11-23 23:15:29,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 301 transitions. [2024-11-23 23:15:29,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-23 23:15:29,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:29,732 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:29,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-23 23:15:29,732 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:29,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash -668968481, now seen corresponding path program 1 times [2024-11-23 23:15:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761091107] [2024-11-23 23:15:29,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 23:15:30,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:30,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761091107] [2024-11-23 23:15:30,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761091107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:30,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:30,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:15:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153664601] [2024-11-23 23:15:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:30,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:30,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:30,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:30,066 INFO L87 Difference]: Start difference. First operand 273 states and 301 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:15:30,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:30,162 INFO L93 Difference]: Finished difference Result 280 states and 308 transitions. [2024-11-23 23:15:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:15:30,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 41 [2024-11-23 23:15:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:30,165 INFO L225 Difference]: With dead ends: 280 [2024-11-23 23:15:30,165 INFO L226 Difference]: Without dead ends: 280 [2024-11-23 23:15:30,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:15:30,167 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 3 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:30,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 976 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:15:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-23 23:15:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2024-11-23 23:15:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 205 states have (on average 1.4926829268292683) internal successors, (306), 277 states have internal predecessors, (306), 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:15:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2024-11-23 23:15:30,176 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 41 [2024-11-23 23:15:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:30,177 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2024-11-23 23:15:30,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:15:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2024-11-23 23:15:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-23 23:15:30,179 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:30,179 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:30,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-23 23:15:30,179 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:30,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1301220699, now seen corresponding path program 1 times [2024-11-23 23:15:30,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:30,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011029242] [2024-11-23 23:15:30,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:15:30,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:30,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011029242] [2024-11-23 23:15:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011029242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:30,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:30,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:15:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776007160] [2024-11-23 23:15:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:30,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:15:30,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:30,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:15:30,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:15:30,435 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 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:15:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:31,085 INFO L93 Difference]: Finished difference Result 348 states and 387 transitions. [2024-11-23 23:15:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:15:31,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 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 43 [2024-11-23 23:15:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:31,087 INFO L225 Difference]: With dead ends: 348 [2024-11-23 23:15:31,087 INFO L226 Difference]: Without dead ends: 348 [2024-11-23 23:15:31,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:15:31,088 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 216 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:31,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 636 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 23:15:31,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-23 23:15:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 281. [2024-11-23 23:15:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 210 states have (on average 1.4904761904761905) internal successors, (313), 280 states have internal predecessors, (313), 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:15:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 313 transitions. [2024-11-23 23:15:31,096 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 313 transitions. Word has length 43 [2024-11-23 23:15:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:31,096 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 313 transitions. [2024-11-23 23:15:31,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 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:15:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 313 transitions. [2024-11-23 23:15:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-23 23:15:31,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:31,097 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:31,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-23 23:15:31,098 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:31,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:31,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1301220700, now seen corresponding path program 1 times [2024-11-23 23:15:31,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:31,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415114742] [2024-11-23 23:15:31,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:31,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:15:31,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415114742] [2024-11-23 23:15:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415114742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:15:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672693378] [2024-11-23 23:15:31,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:31,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:15:31,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:31,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:15:31,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:15:31,638 INFO L87 Difference]: Start difference. First operand 281 states and 313 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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:15:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:32,295 INFO L93 Difference]: Finished difference Result 366 states and 411 transitions. [2024-11-23 23:15:32,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 23:15:32,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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 43 [2024-11-23 23:15:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:32,297 INFO L225 Difference]: With dead ends: 366 [2024-11-23 23:15:32,297 INFO L226 Difference]: Without dead ends: 366 [2024-11-23 23:15:32,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:15:32,298 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 239 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:32,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1061 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 23:15:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-23 23:15:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 345. [2024-11-23 23:15:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 274 states have (on average 1.4963503649635037) internal successors, (410), 344 states have internal predecessors, (410), 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:15:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 410 transitions. [2024-11-23 23:15:32,307 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 410 transitions. Word has length 43 [2024-11-23 23:15:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:32,307 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 410 transitions. [2024-11-23 23:15:32,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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:15:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 410 transitions. [2024-11-23 23:15:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-23 23:15:32,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:32,309 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:15:32,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-23 23:15:32,310 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:32,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:32,310 INFO L85 PathProgramCache]: Analyzing trace with hash -613101604, now seen corresponding path program 2 times [2024-11-23 23:15:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:32,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320947551] [2024-11-23 23:15:32,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:15:32,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:32,383 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:15:32,385 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:15:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:34,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:34,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320947551] [2024-11-23 23:15:34,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320947551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:15:34,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55649209] [2024-11-23 23:15:34,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:15:34,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:15:34,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:15:34,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:15:34,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:15:34,715 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:15:34,715 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:15:34,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-23 23:15:34,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:15:34,738 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:15:34,906 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 23:15:34,907 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:15:34,979 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 23:15:34,980 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:15:35,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:15:35,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:15:35,272 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 18 treesize of output 13 [2024-11-23 23:15:35,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:15:35,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:15:35,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 23:15:35,497 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 62 treesize of output 34 [2024-11-23 23:15:35,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 23:15:35,623 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 62 treesize of output 34 [2024-11-23 23:15:35,664 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 7 treesize of output 3 [2024-11-23 23:15:35,757 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 54 treesize of output 22 [2024-11-23 23:15:35,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-23 23:15:35,921 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 26 treesize of output 14 [2024-11-23 23:15:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:35,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:15:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:43,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55649209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:15:43,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:15:43,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 13] total 39 [2024-11-23 23:15:43,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293158271] [2024-11-23 23:15:43,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:15:43,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-23 23:15:43,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:43,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-23 23:15:43,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1447, Unknown=2, NotChecked=0, Total=1560 [2024-11-23 23:15:43,128 INFO L87 Difference]: Start difference. First operand 345 states and 410 transitions. Second operand has 40 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 40 states have internal predecessors, (118), 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:15:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:47,519 INFO L93 Difference]: Finished difference Result 388 states and 460 transitions. [2024-11-23 23:15:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:15:47,520 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 40 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-23 23:15:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:47,521 INFO L225 Difference]: With dead ends: 388 [2024-11-23 23:15:47,521 INFO L226 Difference]: Without dead ends: 388 [2024-11-23 23:15:47,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=299, Invalid=2249, Unknown=2, NotChecked=0, Total=2550 [2024-11-23 23:15:47,522 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 542 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 3716 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 3847 SdHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:47,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 3847 Invalid, 3746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3716 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-23 23:15:47,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-23 23:15:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 344. [2024-11-23 23:15:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 274 states have (on average 1.4927007299270072) internal successors, (409), 343 states have internal predecessors, (409), 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:15:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 409 transitions. [2024-11-23 23:15:47,534 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 409 transitions. Word has length 47 [2024-11-23 23:15:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:47,534 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 409 transitions. [2024-11-23 23:15:47,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 40 states have internal predecessors, (118), 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:15:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 409 transitions. [2024-11-23 23:15:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-23 23:15:47,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:47,535 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:15:47,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-23 23:15:47,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:15:47,739 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:15:47,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash -613101603, now seen corresponding path program 1 times [2024-11-23 23:15:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:47,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792126866] [2024-11-23 23:15:47,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:49,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:49,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792126866] [2024-11-23 23:15:49,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792126866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:15:49,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904629804] [2024-11-23 23:15:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:49,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:15:49,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:15:49,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:15:49,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:15:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:50,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-23 23:15:50,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:15:50,109 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:15:50,114 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:15:50,347 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 23:15:50,348 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:15:50,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-23 23:15:50,455 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 23:15:50,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-23 23:15:50,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:15:50,484 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:15:50,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-23 23:15:50,569 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:15:50,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:15:50,718 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 20 treesize of output 15 [2024-11-23 23:15:50,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:15:50,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:15:50,922 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 97 treesize of output 65 [2024-11-23 23:15:50,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2024-11-23 23:15:51,061 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 97 treesize of output 65 [2024-11-23 23:15:51,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2024-11-23 23:15:51,219 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 78 treesize of output 22 [2024-11-23 23:15:51,234 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 17 treesize of output 3 [2024-11-23 23:15:51,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-23 23:15:51,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:15:51,406 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 26 treesize of output 14 [2024-11-23 23:15:51,413 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 7 treesize of output 3 [2024-11-23 23:15:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:51,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:15:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:57,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904629804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:15:57,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:15:57,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 38 [2024-11-23 23:15:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840162804] [2024-11-23 23:15:57,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:15:57,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-23 23:15:57,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:57,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-23 23:15:57,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1375, Unknown=1, NotChecked=0, Total=1482 [2024-11-23 23:15:57,719 INFO L87 Difference]: Start difference. First operand 344 states and 409 transitions. Second operand has 39 states, 38 states have (on average 3.3421052631578947) internal successors, (127), 39 states have internal predecessors, (127), 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:16:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:16:02,614 INFO L93 Difference]: Finished difference Result 371 states and 439 transitions. [2024-11-23 23:16:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-23 23:16:02,615 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.3421052631578947) internal successors, (127), 39 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-23 23:16:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:16:02,616 INFO L225 Difference]: With dead ends: 371 [2024-11-23 23:16:02,616 INFO L226 Difference]: Without dead ends: 371 [2024-11-23 23:16:02,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=338, Invalid=2631, Unknown=1, NotChecked=0, Total=2970 [2024-11-23 23:16:02,618 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 261 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 3763 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 3801 SdHoareTripleChecker+Invalid, 3776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:16:02,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 3801 Invalid, 3776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3763 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-23 23:16:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-23 23:16:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2024-11-23 23:16:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 274 states have (on average 1.489051094890511) internal successors, (408), 342 states have internal predecessors, (408), 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:16:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 408 transitions. [2024-11-23 23:16:02,626 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 408 transitions. Word has length 47 [2024-11-23 23:16:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:16:02,627 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 408 transitions. [2024-11-23 23:16:02,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.3421052631578947) internal successors, (127), 39 states have internal predecessors, (127), 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:16:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 408 transitions. [2024-11-23 23:16:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-23 23:16:02,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:16:02,628 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:16:02,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 23:16:02,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:16:02,832 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:16:02,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:16:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1247378205, now seen corresponding path program 1 times [2024-11-23 23:16:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:16:02,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532663694] [2024-11-23 23:16:02,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:16:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:16:03,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:16:03,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532663694] [2024-11-23 23:16:03,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532663694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:16:03,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:16:03,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:16:03,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500209257] [2024-11-23 23:16:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:16:03,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 23:16:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:16:03,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 23:16:03,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:16:03,022 INFO L87 Difference]: Start difference. First operand 343 states and 408 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:16:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:16:03,330 INFO L93 Difference]: Finished difference Result 423 states and 477 transitions. [2024-11-23 23:16:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:16:03,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-23 23:16:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:16:03,332 INFO L225 Difference]: With dead ends: 423 [2024-11-23 23:16:03,332 INFO L226 Difference]: Without dead ends: 423 [2024-11-23 23:16:03,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:16:03,333 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 241 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:16:03,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1423 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:16:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-23 23:16:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 342. [2024-11-23 23:16:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 273 states have (on average 1.47985347985348) internal successors, (404), 341 states have internal predecessors, (404), 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:16:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 404 transitions. [2024-11-23 23:16:03,341 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 404 transitions. Word has length 47 [2024-11-23 23:16:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:16:03,341 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 404 transitions. [2024-11-23 23:16:03,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:16:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 404 transitions. [2024-11-23 23:16:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-23 23:16:03,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:16:03,343 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:16:03,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-23 23:16:03,343 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:16:03,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:16:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash 925631302, now seen corresponding path program 1 times [2024-11-23 23:16:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:16:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549082567] [2024-11-23 23:16:03,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:16:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:16:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:16:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549082567] [2024-11-23 23:16:04,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549082567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:16:04,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:16:04,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-23 23:16:04,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766195520] [2024-11-23 23:16:04,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:16:04,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-23 23:16:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:16:04,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 23:16:04,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-23 23:16:04,090 INFO L87 Difference]: Start difference. First operand 342 states and 404 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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:16:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:16:05,295 INFO L93 Difference]: Finished difference Result 419 states and 467 transitions. [2024-11-23 23:16:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:16:05,296 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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 49 [2024-11-23 23:16:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:16:05,297 INFO L225 Difference]: With dead ends: 419 [2024-11-23 23:16:05,297 INFO L226 Difference]: Without dead ends: 419 [2024-11-23 23:16:05,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-23 23:16:05,298 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 250 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:16:05,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1014 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-23 23:16:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-23 23:16:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 374. [2024-11-23 23:16:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 305 states have (on average 1.5245901639344261) internal successors, (465), 373 states have internal predecessors, (465), 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:16:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 465 transitions. [2024-11-23 23:16:05,306 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 465 transitions. Word has length 49 [2024-11-23 23:16:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:16:05,306 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 465 transitions. [2024-11-23 23:16:05,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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:16:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 465 transitions. [2024-11-23 23:16:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-23 23:16:05,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:16:05,308 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:16:05,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-23 23:16:05,308 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:16:05,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:16:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash 925631301, now seen corresponding path program 1 times [2024-11-23 23:16:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:16:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347811765] [2024-11-23 23:16:05,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:16:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 23:16:05,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:16:05,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347811765] [2024-11-23 23:16:05,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347811765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:16:05,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:16:05,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:16:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951164752] [2024-11-23 23:16:05,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:16:05,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:16:05,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:16:05,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:16:05,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:16:05,460 INFO L87 Difference]: Start difference. First operand 374 states and 465 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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:16:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:16:05,946 INFO L93 Difference]: Finished difference Result 378 states and 470 transitions. [2024-11-23 23:16:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:16:05,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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 49 [2024-11-23 23:16:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:16:05,948 INFO L225 Difference]: With dead ends: 378 [2024-11-23 23:16:05,948 INFO L226 Difference]: Without dead ends: 378 [2024-11-23 23:16:05,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:16:05,949 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 65 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:16:05,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 549 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 23:16:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-23 23:16:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2024-11-23 23:16:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 309 states have (on average 1.5210355987055015) internal successors, (470), 377 states have internal predecessors, (470), 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:16:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 470 transitions. [2024-11-23 23:16:05,957 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 470 transitions. Word has length 49 [2024-11-23 23:16:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:16:05,958 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 470 transitions. [2024-11-23 23:16:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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:16:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 470 transitions. [2024-11-23 23:16:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-23 23:16:05,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:16:05,960 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:05,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-23 23:16:05,961 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:16:05,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:16:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 392129677, now seen corresponding path program 1 times [2024-11-23 23:16:05,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:16:05,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694012926] [2024-11-23 23:16:05,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:05,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:16:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:16:06,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:16:06,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694012926] [2024-11-23 23:16:06,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694012926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:16:06,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752031132] [2024-11-23 23:16:06,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:06,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:16:06,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:16:06,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:16:06,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:16:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:07,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-23 23:16:07,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:16:07,093 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:16:07,099 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:16:07,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:16:07,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 23:16:07,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 23:16:07,398 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 7 treesize of output 3 [2024-11-23 23:16:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:16:07,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:16:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:16:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752031132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:16:07,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:16:07,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 18 [2024-11-23 23:16:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738146619] [2024-11-23 23:16:07,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:16:07,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 23:16:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:16:07,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 23:16:07,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:16:07,892 INFO L87 Difference]: Start difference. First operand 378 states and 470 transitions. Second operand has 18 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 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:16:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:16:08,637 INFO L93 Difference]: Finished difference Result 473 states and 577 transitions. [2024-11-23 23:16:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:16:08,637 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 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 53 [2024-11-23 23:16:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:16:08,639 INFO L225 Difference]: With dead ends: 473 [2024-11-23 23:16:08,639 INFO L226 Difference]: Without dead ends: 473 [2024-11-23 23:16:08,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-11-23 23:16:08,640 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 168 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:16:08,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 2609 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 23:16:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-23 23:16:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 395. [2024-11-23 23:16:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 326 states have (on average 1.4969325153374233) internal successors, (488), 394 states have internal predecessors, (488), 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:16:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 488 transitions. [2024-11-23 23:16:08,649 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 488 transitions. Word has length 53 [2024-11-23 23:16:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:16:08,650 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 488 transitions. [2024-11-23 23:16:08,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 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:16:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 488 transitions. [2024-11-23 23:16:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-23 23:16:08,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:16:08,651 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:08,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-23 23:16:08,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:16:08,855 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:16:08,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:16:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1056352202, now seen corresponding path program 1 times [2024-11-23 23:16:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:16:08,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515788621] [2024-11-23 23:16:08,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:08,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:16:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:16:09,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:16:09,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515788621] [2024-11-23 23:16:09,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515788621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:16:09,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:16:09,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:16:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041167907] [2024-11-23 23:16:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:16:09,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 23:16:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:16:09,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 23:16:09,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:16:09,055 INFO L87 Difference]: Start difference. First operand 395 states and 488 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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:16:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:16:09,383 INFO L93 Difference]: Finished difference Result 442 states and 496 transitions. [2024-11-23 23:16:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:16:09,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 54 [2024-11-23 23:16:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:16:09,386 INFO L225 Difference]: With dead ends: 442 [2024-11-23 23:16:09,386 INFO L226 Difference]: Without dead ends: 442 [2024-11-23 23:16:09,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:16:09,387 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 234 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:16:09,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1423 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:16:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-23 23:16:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 395. [2024-11-23 23:16:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 326 states have (on average 1.4938650306748467) internal successors, (487), 394 states have internal predecessors, (487), 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:16:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 487 transitions. [2024-11-23 23:16:09,397 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 487 transitions. Word has length 54 [2024-11-23 23:16:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:16:09,398 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 487 transitions. [2024-11-23 23:16:09,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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:16:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 487 transitions. [2024-11-23 23:16:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-23 23:16:09,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:16:09,401 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:16:09,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-23 23:16:09,401 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:16:09,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:16:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1840165516, now seen corresponding path program 1 times [2024-11-23 23:16:09,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:16:09,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222352101] [2024-11-23 23:16:09,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:09,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:16:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:16:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:16:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222352101] [2024-11-23 23:16:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222352101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:16:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736764355] [2024-11-23 23:16:12,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:12,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:16:12,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:16:12,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:16:12,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:16:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:13,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-23 23:16:13,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:16:13,176 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:16:13,262 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-23 23:16:13,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-23 23:16:13,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:16:13,363 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 25 treesize of output 13 [2024-11-23 23:16:13,497 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2024-11-23 23:16:13,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2024-11-23 23:16:13,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-23 23:16:13,667 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 26 treesize of output 19 [2024-11-23 23:16:13,776 INFO L349 Elim1Store]: treesize reduction 84, result has 30.0 percent of original size [2024-11-23 23:16:13,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 48 [2024-11-23 23:16:13,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-23 23:16:14,118 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:16:14,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 53 [2024-11-23 23:16:14,560 INFO L349 Elim1Store]: treesize reduction 126, result has 22.2 percent of original size [2024-11-23 23:16:14,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 50 [2024-11-23 23:16:14,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:16:14,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:16:15,141 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 234 treesize of output 177 [2024-11-23 23:16:15,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 189 [2024-11-23 23:16:15,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 171 [2024-11-23 23:16:15,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 172 [2024-11-23 23:16:16,372 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 35 treesize of output 7 [2024-11-23 23:16:16,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 157 [2024-11-23 23:16:16,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 113 [2024-11-23 23:16:17,158 INFO L349 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2024-11-23 23:16:17,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 52 [2024-11-23 23:16:17,352 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 27 treesize of output 11 [2024-11-23 23:16:17,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 17 [2024-11-23 23:16:17,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-23 23:16:17,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:16:17,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 22 [2024-11-23 23:16:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:16:18,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:16:26,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:16:26,061 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2024-11-23 23:16:26,066 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:16:26,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:16:26,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 244 [2024-11-23 23:16:26,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-23 23:16:26,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:16:26,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2024-11-23 23:16:26,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:16:26,257 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 476 treesize of output 472 [2024-11-23 23:16:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:16:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736764355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:16:32,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:16:32,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 27] total 73 [2024-11-23 23:16:32,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564429887] [2024-11-23 23:16:32,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:16:32,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-23 23:16:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:16:32,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-23 23:16:32,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=5094, Unknown=5, NotChecked=0, Total=5402 [2024-11-23 23:16:32,841 INFO L87 Difference]: Start difference. First operand 395 states and 487 transitions. Second operand has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 74 states have internal predecessors, (150), 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:16:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:16:50,151 INFO L93 Difference]: Finished difference Result 427 states and 523 transitions. [2024-11-23 23:16:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-23 23:16:50,153 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 74 states have internal predecessors, (150), 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 56 [2024-11-23 23:16:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:16:50,162 INFO L225 Difference]: With dead ends: 427 [2024-11-23 23:16:50,163 INFO L226 Difference]: Without dead ends: 427 [2024-11-23 23:16:50,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=852, Invalid=8845, Unknown=5, NotChecked=0, Total=9702 [2024-11-23 23:16:50,184 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 598 mSDsluCounter, 6527 mSDsCounter, 0 mSdLazyCounter, 6924 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 6760 SdHoareTripleChecker+Invalid, 6964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 6924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:16:50,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 6760 Invalid, 6964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 6924 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2024-11-23 23:16:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-23 23:16:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 400. [2024-11-23 23:16:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 331 states have (on average 1.4924471299093656) internal successors, (494), 399 states have internal predecessors, (494), 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:16:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 494 transitions. [2024-11-23 23:16:50,242 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 494 transitions. Word has length 56 [2024-11-23 23:16:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:16:50,242 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 494 transitions. [2024-11-23 23:16:50,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 74 states have internal predecessors, (150), 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:16:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 494 transitions. [2024-11-23 23:16:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-23 23:16:50,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:16:50,249 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:16:50,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-23 23:16:50,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:16:50,451 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:16:50,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:16:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1840165515, now seen corresponding path program 1 times [2024-11-23 23:16:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:16:50,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778668675] [2024-11-23 23:16:50,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:16:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:17:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:17:00,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:17:00,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778668675] [2024-11-23 23:17:00,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778668675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:17:00,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147103574] [2024-11-23 23:17:00,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:17:00,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:17:00,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:17:00,622 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:17:00,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:17:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:17:00,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-23 23:17:01,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:17:01,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-23 23:17:01,047 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:17:01,210 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 23:17:01,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-23 23:17:01,268 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-23 23:17:01,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-23 23:17:01,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:17:01,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:17:01,590 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 51 treesize of output 27 [2024-11-23 23:17:01,612 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 23 treesize of output 11 [2024-11-23 23:17:01,859 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-23 23:17:01,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-23 23:17:01,939 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-23 23:17:01,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-23 23:17:02,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2024-11-23 23:17:02,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-23 23:17:02,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2024-11-23 23:17:02,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-23 23:17:02,365 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-23 23:17:02,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-23 23:17:02,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-23 23:17:02,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 23:17:02,587 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 43 treesize of output 32 [2024-11-23 23:17:02,634 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 84 treesize of output 38 [2024-11-23 23:17:02,661 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 33 treesize of output 17 [2024-11-23 23:17:03,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:17:03,096 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 23:17:03,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-11-23 23:17:03,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:17:03,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:17:03,607 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 205 treesize of output 145 [2024-11-23 23:17:03,616 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 188 treesize of output 144 [2024-11-23 23:17:03,955 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 205 treesize of output 145 [2024-11-23 23:17:03,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 144 [2024-11-23 23:17:04,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 172 [2024-11-23 23:17:04,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 123 [2024-11-23 23:17:05,846 INFO L349 Elim1Store]: treesize reduction 68, result has 57.8 percent of original size [2024-11-23 23:17:05,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 254 treesize of output 222 [2024-11-23 23:17:06,081 INFO L349 Elim1Store]: treesize reduction 68, result has 57.8 percent of original size [2024-11-23 23:17:06,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 184 [2024-11-23 23:17:13,694 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 230 treesize of output 206 [2024-11-23 23:17:13,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 198 [2024-11-23 23:17:14,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 128 [2024-11-23 23:17:14,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:14,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 98 [2024-11-23 23:17:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:17:14,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:17:29,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:29,862 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2024-11-23 23:17:29,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:29,873 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2024-11-23 23:17:29,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:29,907 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-23 23:17:29,926 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~#iter~0#1.base_62| Int) (|v_ULTIMATE.start_main_#t~mem12#1.offset_17| Int) (v_ArrVal_2039 Int) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_3 .cse1))) (or (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_17|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_62| v_ArrVal_2039) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_17|))) (< .cse0 |v_ULTIMATE.start_main_#t~mem12#1.offset_17|) (< |v_ULTIMATE.start_main_~#iter~0#1.base_62| (+ |c_#StackHeapBarrier| 1)) (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse0) (< |v_ULTIMATE.start_main_#t~mem12#1.offset_17| 0) (not (= (select v_arrayElimArr_2 .cse1) |c_ULTIMATE.start_main_~data~0#1.base|)))))) (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.offset_17| Int) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse2 (select v_arrayElimArr_4 (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)))) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse2) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_17|))) (< .cse2 |v_ULTIMATE.start_main_#t~mem12#1.offset_17|) (< |v_ULTIMATE.start_main_#t~mem12#1.offset_17| 0))))) is different from false [2024-11-23 23:17:37,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:37,448 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-23 23:17:37,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:37,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 68 [2024-11-23 23:17:37,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:37,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2024-11-23 23:17:37,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-23 23:17:37,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:37,803 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 68 [2024-11-23 23:17:37,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:37,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 204 [2024-11-23 23:17:37,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:37,861 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 192 treesize of output 158 [2024-11-23 23:17:37,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:37,892 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 148 treesize of output 150 [2024-11-23 23:17:37,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:37,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 462 treesize of output 450 [2024-11-23 23:17:37,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:17:37,965 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 116 treesize of output 114 [2024-11-23 23:17:37,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-11-23 23:17:37,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-23 23:17:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-23 23:17:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147103574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:17:39,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:17:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 22] total 62 [2024-11-23 23:17:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497065553] [2024-11-23 23:17:39,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:17:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-23 23:17:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:17:39,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-23 23:17:39,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3598, Unknown=14, NotChecked=120, Total=3906 [2024-11-23 23:17:39,379 INFO L87 Difference]: Start difference. First operand 400 states and 494 transitions. Second operand has 63 states, 62 states have (on average 2.5806451612903225) internal successors, (160), 63 states have internal predecessors, (160), 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:17:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:17:57,958 INFO L93 Difference]: Finished difference Result 439 states and 537 transitions. [2024-11-23 23:17:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-23 23:17:57,959 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.5806451612903225) internal successors, (160), 63 states have internal predecessors, (160), 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 56 [2024-11-23 23:17:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:17:57,961 INFO L225 Difference]: With dead ends: 439 [2024-11-23 23:17:57,961 INFO L226 Difference]: Without dead ends: 439 [2024-11-23 23:17:57,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=579, Invalid=7067, Unknown=14, NotChecked=172, Total=7832 [2024-11-23 23:17:57,965 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 678 mSDsluCounter, 5303 mSDsCounter, 0 mSdLazyCounter, 6197 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 5535 SdHoareTripleChecker+Invalid, 6478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 6197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-23 23:17:57,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 5535 Invalid, 6478 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 6197 Invalid, 0 Unknown, 241 Unchecked, 10.8s Time] [2024-11-23 23:17:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-23 23:17:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 400. [2024-11-23 23:17:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 331 states have (on average 1.4894259818731117) internal successors, (493), 399 states have internal predecessors, (493), 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:17:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 493 transitions. [2024-11-23 23:17:57,976 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 493 transitions. Word has length 56 [2024-11-23 23:17:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:17:57,977 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 493 transitions. [2024-11-23 23:17:57,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.5806451612903225) internal successors, (160), 63 states have internal predecessors, (160), 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:17:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 493 transitions. [2024-11-23 23:17:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-23 23:17:57,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:17:57,982 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:58,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 23:17:58,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-23 23:17:58,183 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:17:58,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:17:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash -626966735, now seen corresponding path program 1 times [2024-11-23 23:17:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:17:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404564909] [2024-11-23 23:17:58,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:17:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:17:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:17:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:17:59,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:17:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404564909] [2024-11-23 23:17:59,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404564909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:17:59,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:17:59,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-23 23:17:59,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081438] [2024-11-23 23:17:59,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:17:59,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:17:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:17:59,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:17:59,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:17:59,332 INFO L87 Difference]: Start difference. First operand 400 states and 493 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 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:18:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:01,244 INFO L93 Difference]: Finished difference Result 444 states and 538 transitions. [2024-11-23 23:18:01,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-23 23:18:01,245 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 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 56 [2024-11-23 23:18:01,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:01,247 INFO L225 Difference]: With dead ends: 444 [2024-11-23 23:18:01,247 INFO L226 Difference]: Without dead ends: 444 [2024-11-23 23:18:01,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2024-11-23 23:18:01,249 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 165 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:01,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 2160 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-23 23:18:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-23 23:18:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 400. [2024-11-23 23:18:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 331 states have (on average 1.486404833836858) internal successors, (492), 399 states have internal predecessors, (492), 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:18:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 492 transitions. [2024-11-23 23:18:01,270 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 492 transitions. Word has length 56 [2024-11-23 23:18:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:01,272 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 492 transitions. [2024-11-23 23:18:01,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 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:18:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 492 transitions. [2024-11-23 23:18:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-23 23:18:01,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:01,274 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:01,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-23 23:18:01,275 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:01,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash -626966734, now seen corresponding path program 1 times [2024-11-23 23:18:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:01,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171465440] [2024-11-23 23:18:01,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:18:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171465440] [2024-11-23 23:18:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171465440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:02,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:02,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-23 23:18:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040585926] [2024-11-23 23:18:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:02,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 23:18:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:02,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 23:18:02,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:18:02,871 INFO L87 Difference]: Start difference. First operand 400 states and 492 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 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:18:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:05,674 INFO L93 Difference]: Finished difference Result 460 states and 540 transitions. [2024-11-23 23:18:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-23 23:18:05,674 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 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 56 [2024-11-23 23:18:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:05,676 INFO L225 Difference]: With dead ends: 460 [2024-11-23 23:18:05,676 INFO L226 Difference]: Without dead ends: 460 [2024-11-23 23:18:05,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-11-23 23:18:05,678 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 279 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:05,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1752 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-23 23:18:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-23 23:18:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 400. [2024-11-23 23:18:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 331 states have (on average 1.4833836858006042) internal successors, (491), 399 states have internal predecessors, (491), 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:18:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 491 transitions. [2024-11-23 23:18:05,688 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 491 transitions. Word has length 56 [2024-11-23 23:18:05,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:05,689 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 491 transitions. [2024-11-23 23:18:05,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 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:18:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 491 transitions. [2024-11-23 23:18:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-23 23:18:05,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:05,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:05,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-23 23:18:05,691 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:05,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:05,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1580082274, now seen corresponding path program 1 times [2024-11-23 23:18:05,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:05,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599862005] [2024-11-23 23:18:05,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:05,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 23:18:05,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:05,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599862005] [2024-11-23 23:18:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599862005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:05,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 23:18:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528413346] [2024-11-23 23:18:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:05,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:18:05,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:05,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:18:05,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:18:05,950 INFO L87 Difference]: Start difference. First operand 400 states and 491 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:18:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:06,330 INFO L93 Difference]: Finished difference Result 469 states and 588 transitions. [2024-11-23 23:18:06,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:18:06,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-23 23:18:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:06,333 INFO L225 Difference]: With dead ends: 469 [2024-11-23 23:18:06,333 INFO L226 Difference]: Without dead ends: 464 [2024-11-23 23:18:06,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:18:06,334 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 167 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:06,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1197 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:18:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-23 23:18:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 396. [2024-11-23 23:18:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 327 states have (on average 1.4831804281345566) internal successors, (485), 395 states have internal predecessors, (485), 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:18:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 485 transitions. [2024-11-23 23:18:06,347 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 485 transitions. Word has length 56 [2024-11-23 23:18:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:06,347 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 485 transitions. [2024-11-23 23:18:06,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:18:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 485 transitions. [2024-11-23 23:18:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-23 23:18:06,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:06,351 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:06,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-23 23:18:06,351 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:06,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2038582188, now seen corresponding path program 1 times [2024-11-23 23:18:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:06,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038713151] [2024-11-23 23:18:06,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:18:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038713151] [2024-11-23 23:18:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038713151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:06,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-23 23:18:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790947848] [2024-11-23 23:18:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:06,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:18:06,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:06,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:18:06,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:18:06,737 INFO L87 Difference]: Start difference. First operand 396 states and 485 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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:18:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:07,332 INFO L93 Difference]: Finished difference Result 459 states and 514 transitions. [2024-11-23 23:18:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:18:07,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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 57 [2024-11-23 23:18:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:07,335 INFO L225 Difference]: With dead ends: 459 [2024-11-23 23:18:07,335 INFO L226 Difference]: Without dead ends: 459 [2024-11-23 23:18:07,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:18:07,336 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 280 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:07,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1775 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:18:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-23 23:18:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 396. [2024-11-23 23:18:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 327 states have (on average 1.4801223241590213) internal successors, (484), 395 states have internal predecessors, (484), 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:18:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 484 transitions. [2024-11-23 23:18:07,344 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 484 transitions. Word has length 57 [2024-11-23 23:18:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:07,344 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 484 transitions. [2024-11-23 23:18:07,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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:18:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 484 transitions. [2024-11-23 23:18:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-23 23:18:07,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:07,346 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:07,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-23 23:18:07,346 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:07,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1165418750, now seen corresponding path program 1 times [2024-11-23 23:18:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:07,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683036487] [2024-11-23 23:18:07,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:07,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-23 23:18:07,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:07,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683036487] [2024-11-23 23:18:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683036487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:07,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:18:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143687119] [2024-11-23 23:18:07,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:07,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:18:07,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:07,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:18:07,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:18:07,663 INFO L87 Difference]: Start difference. First operand 396 states and 484 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:18:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:08,146 INFO L93 Difference]: Finished difference Result 413 states and 504 transitions. [2024-11-23 23:18:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:18:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-23 23:18:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:08,148 INFO L225 Difference]: With dead ends: 413 [2024-11-23 23:18:08,148 INFO L226 Difference]: Without dead ends: 413 [2024-11-23 23:18:08,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:18:08,149 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 9 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:08,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 760 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 23:18:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-23 23:18:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2024-11-23 23:18:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 338 states have (on average 1.482248520710059) internal successors, (501), 406 states have internal predecessors, (501), 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:18:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 501 transitions. [2024-11-23 23:18:08,159 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 501 transitions. Word has length 60 [2024-11-23 23:18:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:08,160 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 501 transitions. [2024-11-23 23:18:08,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:18:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 501 transitions. [2024-11-23 23:18:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-23 23:18:08,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:08,162 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:08,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-23 23:18:08,162 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:08,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1165418751, now seen corresponding path program 1 times [2024-11-23 23:18:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368552066] [2024-11-23 23:18:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:08,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:11,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368552066] [2024-11-23 23:18:11,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368552066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858471184] [2024-11-23 23:18:11,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:11,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:11,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:11,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:11,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:18:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:11,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-23 23:18:11,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:11,638 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:18:11,649 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:18:11,862 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 23:18:11,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-23 23:18:11,906 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 23:18:11,907 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:18:12,086 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:18:12,087 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:18:12,096 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:18:12,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:18:12,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:18:12,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 16 [2024-11-23 23:18:12,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:18:12,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-23 23:18:12,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:18:12,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:18:12,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 66 [2024-11-23 23:18:12,955 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 27 treesize of output 11 [2024-11-23 23:18:13,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 23:18:13,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 60 [2024-11-23 23:18:13,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-11-23 23:18:13,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:13,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 26 [2024-11-23 23:18:13,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-23 23:18:13,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-23 23:18:13,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-23 23:18:13,961 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 27 treesize of output 11 [2024-11-23 23:18:14,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 23:18:14,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-23 23:18:14,081 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 26 treesize of output 14 [2024-11-23 23:18:14,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-23 23:18:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:14,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:18:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858471184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:18:16,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:18:16,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 15] total 52 [2024-11-23 23:18:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730005315] [2024-11-23 23:18:16,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:18:16,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-23 23:18:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:16,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-23 23:18:16,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2024-11-23 23:18:16,311 INFO L87 Difference]: Start difference. First operand 407 states and 501 transitions. Second operand has 53 states, 52 states have (on average 3.2115384615384617) internal successors, (167), 53 states have internal predecessors, (167), 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:18:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:24,134 INFO L93 Difference]: Finished difference Result 421 states and 512 transitions. [2024-11-23 23:18:24,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-23 23:18:24,135 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.2115384615384617) internal successors, (167), 53 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-23 23:18:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:24,136 INFO L225 Difference]: With dead ends: 421 [2024-11-23 23:18:24,136 INFO L226 Difference]: Without dead ends: 421 [2024-11-23 23:18:24,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=549, Invalid=5151, Unknown=0, NotChecked=0, Total=5700 [2024-11-23 23:18:24,137 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 297 mSDsluCounter, 4645 mSDsCounter, 0 mSdLazyCounter, 5094 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 4875 SdHoareTripleChecker+Invalid, 5115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:24,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 4875 Invalid, 5115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5094 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-23 23:18:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-23 23:18:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 407. [2024-11-23 23:18:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 338 states have (on average 1.4792899408284024) internal successors, (500), 406 states have internal predecessors, (500), 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:18:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 500 transitions. [2024-11-23 23:18:24,143 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 500 transitions. Word has length 60 [2024-11-23 23:18:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:24,144 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 500 transitions. [2024-11-23 23:18:24,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.2115384615384617) internal successors, (167), 53 states have internal predecessors, (167), 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:18:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 500 transitions. [2024-11-23 23:18:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-23 23:18:24,145 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:24,145 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:24,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 23:18:24,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-23 23:18:24,347 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:24,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:24,348 INFO L85 PathProgramCache]: Analyzing trace with hash 490136635, now seen corresponding path program 1 times [2024-11-23 23:18:24,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:24,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235055274] [2024-11-23 23:18:24,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:24,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 23:18:24,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:24,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235055274] [2024-11-23 23:18:24,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235055274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:24,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:24,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:18:24,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967512102] [2024-11-23 23:18:24,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:24,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:18:24,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:24,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:18:24,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:18:24,589 INFO L87 Difference]: Start difference. First operand 407 states and 500 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:18:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:25,110 INFO L93 Difference]: Finished difference Result 455 states and 559 transitions. [2024-11-23 23:18:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:18:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-23 23:18:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:25,112 INFO L225 Difference]: With dead ends: 455 [2024-11-23 23:18:25,112 INFO L226 Difference]: Without dead ends: 455 [2024-11-23 23:18:25,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:18:25,113 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 25 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:25,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 723 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 23:18:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-23 23:18:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 417. [2024-11-23 23:18:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 348 states have (on average 1.4770114942528736) internal successors, (514), 416 states have internal predecessors, (514), 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:18:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 514 transitions. [2024-11-23 23:18:25,120 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 514 transitions. Word has length 60 [2024-11-23 23:18:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:25,121 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 514 transitions. [2024-11-23 23:18:25,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:18:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 514 transitions. [2024-11-23 23:18:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-23 23:18:25,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:25,122 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:25,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-23 23:18:25,122 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:25,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash 490136636, now seen corresponding path program 1 times [2024-11-23 23:18:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340826578] [2024-11-23 23:18:25,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:18:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:26,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340826578] [2024-11-23 23:18:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340826578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:26,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:26,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-23 23:18:26,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718778046] [2024-11-23 23:18:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:26,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 23:18:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:26,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 23:18:26,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-23 23:18:26,296 INFO L87 Difference]: Start difference. First operand 417 states and 514 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:18:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:28,152 INFO L93 Difference]: Finished difference Result 475 states and 536 transitions. [2024-11-23 23:18:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-23 23:18:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-23 23:18:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:28,155 INFO L225 Difference]: With dead ends: 475 [2024-11-23 23:18:28,155 INFO L226 Difference]: Without dead ends: 475 [2024-11-23 23:18:28,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-23 23:18:28,156 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 219 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:28,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1530 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-23 23:18:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-23 23:18:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 417. [2024-11-23 23:18:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 348 states have (on average 1.4741379310344827) internal successors, (513), 416 states have internal predecessors, (513), 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:18:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 513 transitions. [2024-11-23 23:18:28,164 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 513 transitions. Word has length 60 [2024-11-23 23:18:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:28,164 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 513 transitions. [2024-11-23 23:18:28,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:18:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 513 transitions. [2024-11-23 23:18:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-23 23:18:28,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:28,165 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:28,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-23 23:18:28,166 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:28,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1260212143, now seen corresponding path program 1 times [2024-11-23 23:18:28,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:28,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600507565] [2024-11-23 23:18:28,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:29,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:29,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600507565] [2024-11-23 23:18:29,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600507565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:29,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801475126] [2024-11-23 23:18:29,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:29,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:29,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:29,086 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:29,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 23:18:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:29,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-23 23:18:29,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:29,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:18:29,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 23:18:29,677 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 7 treesize of output 3 [2024-11-23 23:18:29,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:18:29,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-23 23:18:30,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-23 23:18:30,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:18:30,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-23 23:18:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:18:30,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:18:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801475126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:30,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:18:30,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 29 [2024-11-23 23:18:30,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879158031] [2024-11-23 23:18:30,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:30,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-23 23:18:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:30,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 23:18:30,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2024-11-23 23:18:30,156 INFO L87 Difference]: Start difference. First operand 417 states and 513 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 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:18:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:31,436 INFO L93 Difference]: Finished difference Result 497 states and 557 transitions. [2024-11-23 23:18:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:18:31,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 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:18:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:31,442 INFO L225 Difference]: With dead ends: 497 [2024-11-23 23:18:31,443 INFO L226 Difference]: Without dead ends: 497 [2024-11-23 23:18:31,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2024-11-23 23:18:31,444 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 414 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:31,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1395 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-23 23:18:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-23 23:18:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 419. [2024-11-23 23:18:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 350 states have (on average 1.4685714285714286) internal successors, (514), 418 states have internal predecessors, (514), 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:18:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 514 transitions. [2024-11-23 23:18:31,452 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 514 transitions. Word has length 63 [2024-11-23 23:18:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:31,452 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 514 transitions. [2024-11-23 23:18:31,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 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:18:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 514 transitions. [2024-11-23 23:18:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-23 23:18:31,454 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:31,454 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:31,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-23 23:18:31,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:31,655 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:31,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash -46519481, now seen corresponding path program 1 times [2024-11-23 23:18:31,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:31,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091187212] [2024-11-23 23:18:31,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:31,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:34,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:34,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091187212] [2024-11-23 23:18:34,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091187212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:34,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248678125] [2024-11-23 23:18:34,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:34,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:34,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:34,642 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:34,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 23:18:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:35,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-23 23:18:35,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:35,097 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:18:35,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:18:35,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:18:35,292 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 23:18:35,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-23 23:18:35,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 23:18:35,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 23:18:35,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 23:18:35,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 23:18:35,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:18:35,507 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:18:35,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 23:18:35,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 23:18:35,673 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 33 treesize of output 17 [2024-11-23 23:18:35,694 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 33 treesize of output 17 [2024-11-23 23:18:36,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:18:36,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:18:36,255 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 101 treesize of output 69 [2024-11-23 23:18:36,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 73 [2024-11-23 23:18:36,378 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 101 treesize of output 69 [2024-11-23 23:18:36,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 73 [2024-11-23 23:18:36,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 96 [2024-11-23 23:18:36,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 72 [2024-11-23 23:18:37,189 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 40 treesize of output 20 [2024-11-23 23:18:37,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-23 23:18:37,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 40 treesize of output 20 [2024-11-23 23:18:37,501 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 33 treesize of output 17 [2024-11-23 23:18:37,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-23 23:18:37,578 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 28 treesize of output 16 [2024-11-23 23:18:37,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:18:37,772 INFO L349 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2024-11-23 23:18:37,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 33 [2024-11-23 23:18:37,788 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 23:18:37,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 16 [2024-11-23 23:18:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:37,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:18:40,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:40,331 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-23 23:18:40,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:40,351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-23 23:18:42,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:42,743 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-23 23:18:42,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:42,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2024-11-23 23:18:42,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:42,782 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 68 treesize of output 60 [2024-11-23 23:18:42,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-23 23:18:42,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:42,970 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-23 23:18:42,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:42,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2024-11-23 23:18:42,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-23 23:18:43,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:18:43,012 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 58 treesize of output 54 [2024-11-23 23:18:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248678125] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:18:43,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:18:43,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 21] total 56 [2024-11-23 23:18:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117132836] [2024-11-23 23:18:43,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:18:43,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-23 23:18:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:43,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-23 23:18:43,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2916, Unknown=6, NotChecked=0, Total=3080 [2024-11-23 23:18:43,518 INFO L87 Difference]: Start difference. First operand 419 states and 514 transitions. Second operand has 56 states, 56 states have (on average 3.107142857142857) internal successors, (174), 56 states have internal predecessors, (174), 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:18:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:51,920 INFO L93 Difference]: Finished difference Result 511 states and 616 transitions. [2024-11-23 23:18:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-23 23:18:51,922 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.107142857142857) internal successors, (174), 56 states have internal predecessors, (174), 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 64 [2024-11-23 23:18:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:51,925 INFO L225 Difference]: With dead ends: 511 [2024-11-23 23:18:51,925 INFO L226 Difference]: Without dead ends: 511 [2024-11-23 23:18:51,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=372, Invalid=5024, Unknown=6, NotChecked=0, Total=5402 [2024-11-23 23:18:51,929 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 323 mSDsluCounter, 8547 mSDsCounter, 0 mSdLazyCounter, 4269 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 8792 SdHoareTripleChecker+Invalid, 4290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:51,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 8792 Invalid, 4290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4269 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-23 23:18:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-23 23:18:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 472. [2024-11-23 23:18:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 403 states have (on average 1.4267990074441688) internal successors, (575), 471 states have internal predecessors, (575), 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:18:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 575 transitions. [2024-11-23 23:18:51,938 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 575 transitions. Word has length 64 [2024-11-23 23:18:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:51,938 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 575 transitions. [2024-11-23 23:18:51,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.107142857142857) internal successors, (174), 56 states have internal predecessors, (174), 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:18:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 575 transitions. [2024-11-23 23:18:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-23 23:18:51,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:51,939 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:51,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-23 23:18:52,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-23 23:18:52,140 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:52,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 587563012, now seen corresponding path program 1 times [2024-11-23 23:18:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:52,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417913011] [2024-11-23 23:18:52,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:18:52,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417913011] [2024-11-23 23:18:52,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417913011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612674588] [2024-11-23 23:18:52,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:52,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:52,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:52,983 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:52,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-23 23:18:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:53,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-23 23:18:53,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:53,408 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:18:53,414 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:18:53,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:18:53,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 23:18:53,758 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 54 treesize of output 34 [2024-11-23 23:18:53,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-23 23:18:53,814 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 54 treesize of output 34 [2024-11-23 23:18:53,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-23 23:18:53,839 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 30 [2024-11-23 23:18:53,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-23 23:18:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:18:53,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:18:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:18:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612674588] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:18:54,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:18:54,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 19 [2024-11-23 23:18:54,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505919141] [2024-11-23 23:18:54,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:18:54,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:18:54,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:54,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:18:54,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:18:54,226 INFO L87 Difference]: Start difference. First operand 472 states and 575 transitions. Second operand has 19 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 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:18:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:55,283 INFO L93 Difference]: Finished difference Result 554 states and 667 transitions. [2024-11-23 23:18:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:18:55,284 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 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 64 [2024-11-23 23:18:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:55,286 INFO L225 Difference]: With dead ends: 554 [2024-11-23 23:18:55,286 INFO L226 Difference]: Without dead ends: 554 [2024-11-23 23:18:55,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-11-23 23:18:55,286 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 224 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:55,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 2246 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-23 23:18:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-23 23:18:55,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2024-11-23 23:18:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 420 states have (on average 1.411904761904762) internal successors, (593), 488 states have internal predecessors, (593), 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:18:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 593 transitions. [2024-11-23 23:18:55,295 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 593 transitions. Word has length 64 [2024-11-23 23:18:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:55,295 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 593 transitions. [2024-11-23 23:18:55,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 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:18:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 593 transitions. [2024-11-23 23:18:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-23 23:18:55,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:55,296 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:55,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-23 23:18:55,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:55,497 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:55,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1410159974, now seen corresponding path program 2 times [2024-11-23 23:18:55,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:55,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748936320] [2024-11-23 23:18:55,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:18:55,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:55,531 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:18:55,531 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:18:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-23 23:18:55,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:55,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748936320] [2024-11-23 23:18:55,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748936320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:18:55,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:18:55,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-23 23:18:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001822727] [2024-11-23 23:18:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:18:55,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:18:55,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:18:55,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:18:55,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:18:55,949 INFO L87 Difference]: Start difference. First operand 489 states and 593 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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:18:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:18:56,544 INFO L93 Difference]: Finished difference Result 569 states and 681 transitions. [2024-11-23 23:18:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 23:18:56,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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 65 [2024-11-23 23:18:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:18:56,546 INFO L225 Difference]: With dead ends: 569 [2024-11-23 23:18:56,546 INFO L226 Difference]: Without dead ends: 564 [2024-11-23 23:18:56,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:18:56,547 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 77 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:18:56,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 2048 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 23:18:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-23 23:18:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 496. [2024-11-23 23:18:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 427 states have (on average 1.405152224824356) internal successors, (600), 495 states have internal predecessors, (600), 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:18:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 600 transitions. [2024-11-23 23:18:56,555 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 600 transitions. Word has length 65 [2024-11-23 23:18:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:18:56,555 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 600 transitions. [2024-11-23 23:18:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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:18:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 600 transitions. [2024-11-23 23:18:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-23 23:18:56,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:18:56,557 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:18:56,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-23 23:18:56,557 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-23 23:18:56,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:18:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash 81014232, now seen corresponding path program 1 times [2024-11-23 23:18:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:18:56,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879015805] [2024-11-23 23:18:56,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:56,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:18:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:18:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:18:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879015805] [2024-11-23 23:18:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879015805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:18:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115376605] [2024-11-23 23:18:59,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:18:59,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:18:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:18:59,168 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:18:59,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d23d5559-d1ef-490e-aa84-45311352aa1c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 23:18:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:18:59,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-11-23 23:18:59,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:18:59,562 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:18:59,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:18:59,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:18:59,609 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 23 treesize of output 11 [2024-11-23 23:18:59,617 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 23 treesize of output 11 [2024-11-23 23:18:59,664 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-23 23:18:59,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-23 23:18:59,814 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 27 treesize of output 15 [2024-11-23 23:18:59,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 23 treesize of output 22 [2024-11-23 23:18:59,858 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-23 23:18:59,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 37 [2024-11-23 23:18:59,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-23 23:19:00,059 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-23 23:19:00,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-23 23:19:00,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-23 23:19:00,266 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-23 23:19:00,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2024-11-23 23:19:00,346 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-23 23:19:00,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2024-11-23 23:19:00,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-23 23:19:00,422 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-23 23:19:00,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2024-11-23 23:19:00,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:19:00,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 44 [2024-11-23 23:19:00,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-23 23:19:00,766 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-23 23:19:00,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 67 [2024-11-23 23:19:00,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:19:00,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2024-11-23 23:19:01,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:19:01,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:19:01,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 23:19:01,751 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 190 treesize of output 133 [2024-11-23 23:19:02,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 23:19:02,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 127 [2024-11-23 23:19:02,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-23 23:19:03,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 134 [2024-11-23 23:19:04,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2024-11-23 23:19:04,101 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 65 treesize of output 52 [2024-11-23 23:19:05,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:19:05,564 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:05,615 INFO L349 Elim1Store]: treesize reduction 83, result has 15.3 percent of original size [2024-11-23 23:19:05,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 173 treesize of output 99 [2024-11-23 23:19:05,652 INFO L349 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2024-11-23 23:19:05,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 35 [2024-11-23 23:19:05,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:19:05,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2024-11-23 23:19:05,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2024-11-23 23:19:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:19:06,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:19:07,121 INFO L349 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2024-11-23 23:19:07,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2024-11-23 23:19:11,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:19:11,906 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 96 [2024-11-23 23:19:12,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:19:12,005 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 96 [2024-11-23 23:19:55,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~node~0#1.base|))) (and (forall ((v_ArrVal_3641 (Array Int Int))) (or (not (= v_ArrVal_3641 (store .cse0 |c_ULTIMATE.start_main_~node~0#1.offset| (select v_ArrVal_3641 |c_ULTIMATE.start_main_~node~0#1.offset|)))) (forall ((v_ArrVal_3640 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~node~0#1.offset| (select v_ArrVal_3640 |c_ULTIMATE.start_main_~node~0#1.offset|)) v_ArrVal_3640)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_52| Int)) (or (= |v_ULTIMATE.start_main_~item~0#1.base_52| 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3647 Int) (v_ArrVal_3648 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_~node~0#1.base_52| Int) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (let ((.cse4 (store (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3641))) (store .cse10 |v_ULTIMATE.start_main_~item~0#1.base_52| (store (store (select .cse10 |v_ULTIMATE.start_main_~item~0#1.base_52|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 v_ArrVal_3647))) |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3655))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |v_ULTIMATE.start_main_~node~0#1.base_52|))) (let ((.cse8 (store .cse4 |v_ULTIMATE.start_main_~item~0#1.base_51| (store .cse5 4 |v_ULTIMATE.start_main_~item~0#1.base_52|)))) (let ((.cse3 (select v_arrayElimArr_12 4)) (.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_52| 1)) (.cse6 (select (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_52|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse7 (+ (select (select (store (store (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3640))) (store .cse9 |v_ULTIMATE.start_main_~item~0#1.base_52| (store (store (select .cse9 |v_ULTIMATE.start_main_~item~0#1.base_52|) 0 |c_ULTIMATE.start_main_~node~0#1.offset|) 4 v_ArrVal_3648))) |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3654) |v_ULTIMATE.start_main_~item~0#1.base_51| v_arrayElimArr_12) |v_ULTIMATE.start_main_~item~0#1.base_52|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (not (= (select (store .cse2 |v_ULTIMATE.start_main_~node~0#1.base_52| 1) |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (< .cse3 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (< 0 .cse3) (= (select (select (store .cse4 |v_ULTIMATE.start_main_~item~0#1.base_51| .cse5) .cse6) .cse7) 0) (not (= (select .cse2 |v_ULTIMATE.start_main_~node~0#1.base_52|) 0)) (= (select (select .cse8 .cse6) .cse7) |v_ULTIMATE.start_main_~item~0#1.base_52|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_52|) 0)))))))) (forall ((v_ArrVal_3641 (Array Int Int))) (or (not (= v_ArrVal_3641 (store .cse0 |c_ULTIMATE.start_main_~node~0#1.offset| (select v_ArrVal_3641 |c_ULTIMATE.start_main_~node~0#1.offset|)))) (forall ((v_ArrVal_3640 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~node~0#1.offset| (select v_ArrVal_3640 |c_ULTIMATE.start_main_~node~0#1.offset|)) v_ArrVal_3640)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_52| Int)) (or (= |v_ULTIMATE.start_main_~item~0#1.base_52| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_52|) 0)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3647 Int) (v_ArrVal_3648 Int) (|v_ULTIMATE.start_main_~node~0#1.base_52| Int) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int)) (v_ArrVal_3662 Int) (v_ArrVal_3658 (Array Int Int))) (let ((.cse12 (store (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3640))) (store .cse18 |v_ULTIMATE.start_main_~item~0#1.base_52| (store (store (select .cse18 |v_ULTIMATE.start_main_~item~0#1.base_52|) 0 |c_ULTIMATE.start_main_~node~0#1.offset|) 4 v_ArrVal_3648))) |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3654)) (.cse15 (let ((.cse16 (store (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3641))) (store .cse17 |v_ULTIMATE.start_main_~item~0#1.base_52| (store (store (select .cse17 |v_ULTIMATE.start_main_~item~0#1.base_52|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 v_ArrVal_3647))) |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3655))) (store .cse16 |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select .cse16 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |v_ULTIMATE.start_main_~node~0#1.base_52|) 4 |v_ULTIMATE.start_main_~item~0#1.base_52|))))) (let ((.cse13 (select (select .cse15 |v_ULTIMATE.start_main_~item~0#1.base_52|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse14 (+ 4 (select (select (store .cse12 |v_ULTIMATE.start_main_~item~0#1.base_51| (store v_ArrVal_3658 4 v_ArrVal_3662)) |v_ULTIMATE.start_main_~item~0#1.base_52|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|))) (.cse11 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_52| 1))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (not (= (select (store .cse11 |v_ULTIMATE.start_main_~node~0#1.base_52| 1) |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (= (select (select (store .cse12 |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_3658) .cse13) .cse14) 0) (= (select (select .cse15 .cse13) .cse14) |v_ULTIMATE.start_main_~item~0#1.base_52|) (< 0 v_ArrVal_3662) (not (= (select .cse11 |v_ULTIMATE.start_main_~node~0#1.base_52|) 0)))))))))))))) is different from false [2024-11-23 23:19:55,830 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:55,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:56,040 INFO L349 Elim1Store]: treesize reduction 67, result has 50.4 percent of original size [2024-11-23 23:19:56,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 321595 treesize of output 312874 [2024-11-23 23:19:56,236 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:56,238 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:56,246 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:56,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:56,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:19:56,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 5748 treesize of output 5614 [2024-11-23 23:19:56,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2024-11-23 23:19:56,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 104 [2024-11-23 23:19:56,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2024-11-23 23:19:56,549 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:56,957 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:56,959 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:57,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:19:57,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 525 treesize of output 527 [2024-11-23 23:19:57,016 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:57,017 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:57,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:57,071 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:19:57,371 INFO L349 Elim1Store]: treesize reduction 72, result has 31.4 percent of original size [2024-11-23 23:19:57,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 73651 treesize of output 67173 [2024-11-23 23:19:57,944 INFO L349 Elim1Store]: treesize reduction 20, result has 16.7 percent of original size [2024-11-23 23:19:57,945 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 6827 treesize of output 6447 [2024-11-23 23:19:58,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 23:20:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-23 23:20:01,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115376605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:20:01,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:20:01,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29, 31] total 78 [2024-11-23 23:20:01,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19968787] [2024-11-23 23:20:01,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:20:01,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-11-23 23:20:01,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:20:01,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-11-23 23:20:01,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=5551, Unknown=16, NotChecked=150, Total=6006 [2024-11-23 23:20:01,166 INFO L87 Difference]: Start difference. First operand 496 states and 600 transitions. Second operand has 78 states, 78 states have (on average 2.2435897435897436) internal successors, (175), 78 states have internal predecessors, (175), 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:20:05,762 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse39 (< |c_ULTIMATE.start_main_~item~0#1.offset| 0)) (.cse0 (= 0 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse55 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse43 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse5 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |c_ULTIMATE.start_main_~node~0#1.base|))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store .cse5 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse4 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| v_arrayElimArr_12) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4)) (.cse1 (select v_arrayElimArr_12 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< .cse1 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select .cse2 .cse3) .cse4) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51| .cse5) .cse3) .cse4) 0) (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse1)))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_ArrVal_3662 Int) (v_ArrVal_3658 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse7 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store v_ArrVal_3658 4 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_3658) .cse6) .cse7) 0) (= (select (select .cse8 .cse6) .cse7) |c_ULTIMATE.start_main_~data~0#1.base|))))) (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_ArrVal_3662 Int) (v_ArrVal_3658 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse10 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store v_ArrVal_3658 4 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_3658) .cse9) .cse10) 0) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= (select (select .cse11 .cse9) .cse10) |c_ULTIMATE.start_main_~data~0#1.base|))))))))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_52| Int)) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_52| 1) |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_ArrVal_3662 Int) (v_ArrVal_3658 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3654)) (.cse12 (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3655))) (store .cse16 |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select .cse16 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |v_ULTIMATE.start_main_~node~0#1.base_52|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse14 (+ (select (select (store .cse15 |v_ULTIMATE.start_main_~item~0#1.base_51| (store v_ArrVal_3658 4 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= (select (select .cse12 .cse13) .cse14) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (select (store .cse15 |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_3658) .cse13) .cse14) 0))))) (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_52|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3655))) (let ((.cse18 (store (select .cse17 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |c_ULTIMATE.start_main_~node~0#1.base|))) (let ((.cse22 (store .cse17 |v_ULTIMATE.start_main_~item~0#1.base_51| (store .cse18 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse19 (select (select .cse22 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse20 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3654) |v_ULTIMATE.start_main_~item~0#1.base_51| v_arrayElimArr_13) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4)) (.cse21 (select v_arrayElimArr_13 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= (select (select (store .cse17 |v_ULTIMATE.start_main_~item~0#1.base_51| .cse18) .cse19) .cse20) 0) (< .cse21 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select .cse22 .cse19) .cse20) |c_ULTIMATE.start_main_~data~0#1.base|) (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse21) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse27 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |c_ULTIMATE.start_main_~node~0#1.base|))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store .cse27 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse26 (select v_arrayElimArr_13 4)) (.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse25 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| v_arrayElimArr_13) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (= (select (select .cse23 .cse24) .cse25) |c_ULTIMATE.start_main_~data~0#1.base|) (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< .cse26 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse26) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51| .cse27) .cse24) .cse25) 0) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0)))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_ArrVal_3662 Int) (v_ArrVal_3658 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3654)) (.cse31 (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3655))) (store .cse32 |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select .cse32 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse29 (select (select .cse31 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse30 (+ (select (select (store .cse28 |v_ULTIMATE.start_main_~item~0#1.base_51| (store v_ArrVal_3658 4 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select (store .cse28 |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_3658) .cse29) .cse30) 0) (= (select (select .cse31 .cse29) .cse30) |c_ULTIMATE.start_main_~data~0#1.base|))))) (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3655))) (let ((.cse35 (store (select .cse34 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |c_ULTIMATE.start_main_~node~0#1.base|))) (let ((.cse38 (store .cse34 |v_ULTIMATE.start_main_~item~0#1.base_51| (store .cse35 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse36 (select (select .cse38 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse37 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3654) |v_ULTIMATE.start_main_~item~0#1.base_51| v_arrayElimArr_12) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4)) (.cse33 (select v_arrayElimArr_12 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< .cse33 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= 0 (select (select (store .cse34 |v_ULTIMATE.start_main_~item~0#1.base_51| .cse35) .cse36) .cse37)) (= (select (select .cse38 .cse36) .cse37) |c_ULTIMATE.start_main_~data~0#1.base|) (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse33))))))))))) (or .cse39 (let ((.cse54 (store .cse55 |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~0#1.base|))) (let ((.cse40 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse54 .cse43 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse46 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| .cse54)) (.cse44 (select .cse40 |c_ULTIMATE.start_main_~data~0#1.base|))) (and (forall ((v_ArrVal_3662 Int) (v_ArrVal_3658 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse41 (select .cse44 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse42 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store v_ArrVal_3658 .cse43 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select .cse40 .cse41) .cse42) |c_ULTIMATE.start_main_~data~0#1.base|) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_3658) .cse41) .cse42) 0)))))) (or (and (forall ((v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse47 (select .cse44 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse48 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4)) (.cse45 (select v_arrayElimArr_12 .cse43))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse45) (= (select (select .cse46 .cse47) .cse48) 0) (= (select (select .cse40 .cse47) .cse48) |c_ULTIMATE.start_main_~data~0#1.base|) (< .cse45 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)))) (forall ((v_ArrVal_3662 Int) (v_ArrVal_3658 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse49 (select .cse44 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse50 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store v_ArrVal_3658 .cse43 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select .cse40 .cse49) .cse50) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_3658) .cse49) .cse50) 0))))))) .cse0) (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse53 (select v_arrayElimArr_13 .cse43)) (.cse51 (select .cse44 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse52 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= (select (select .cse46 .cse51) .cse52) 0) (< .cse53 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse53) (= (select (select .cse40 .cse51) .cse52) |c_ULTIMATE.start_main_~data~0#1.base|))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~node~0#1.base_52| Int)) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_52| 1) |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse57 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3655))) (let ((.cse58 (store (select .cse57 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |v_ULTIMATE.start_main_~node~0#1.base_52|))) (let ((.cse61 (store .cse57 |v_ULTIMATE.start_main_~item~0#1.base_51| (store .cse58 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse59 (select (select .cse61 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse60 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3654) |v_ULTIMATE.start_main_~item~0#1.base_51| v_arrayElimArr_12) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4)) (.cse56 (select v_arrayElimArr_12 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< .cse56 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select (store .cse57 |v_ULTIMATE.start_main_~item~0#1.base_51| .cse58) .cse59) .cse60) 0) (= |c_ULTIMATE.start_main_~data~0#1.base| (select (select .cse61 .cse59) .cse60)) (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse56))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_52|) 0)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_52|) 0)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_52| 1) |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_ArrVal_3662 Int) (v_ArrVal_3658 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse65 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3654)) (.cse62 (let ((.cse66 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3655))) (store .cse66 |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select .cse66 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |v_ULTIMATE.start_main_~node~0#1.base_52|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse63 (select (select .cse62 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse64 (+ (select (select (store .cse65 |v_ULTIMATE.start_main_~item~0#1.base_51| (store v_ArrVal_3658 4 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select .cse62 .cse63) .cse64) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (select (store .cse65 |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_3658) .cse63) .cse64) 0))))) (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662))))))))) (or .cse39 (let ((.cse67 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse55 .cse43 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse70 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse71 (select .cse67 |c_ULTIMATE.start_main_~data~0#1.base|))) (and (or (and (forall ((v_ArrVal_3662 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse68 (select .cse71 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse69 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse70 .cse43 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select .cse67 .cse68) .cse69) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse68) .cse69) 0)))) (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662))) (forall ((v_ArrVal_3662 Int)) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse72 (select .cse71 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse73 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse70 .cse43 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select .cse67 .cse72) .cse73) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse72) .cse73) 0))))))) .cse0) (forall ((v_ArrVal_3662 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse74 (select .cse71 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse75 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse70 .cse43 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select .cse67 .cse74) .cse75) |c_ULTIMATE.start_main_~data~0#1.base|) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse74) .cse75) 0)))) (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662))) (forall ((v_ArrVal_3662 Int)) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse76 (select .cse71 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse77 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse70 .cse43 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= (select (select .cse67 .cse76) .cse77) |c_ULTIMATE.start_main_~data~0#1.base|) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse76) .cse77) 0)))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_ArrVal_3662 Int) (v_ArrVal_3658 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse78 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3654)) (.cse81 (let ((.cse82 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_3655))) (store .cse82 |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select .cse82 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse79 (select (select .cse81 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse80 (+ (select (select (store .cse78 |v_ULTIMATE.start_main_~item~0#1.base_51| (store v_ArrVal_3658 4 v_ArrVal_3662)) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< v_ArrVal_3662 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= (select (select (store .cse78 |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_3658) .cse79) .cse80) 0) (= (select (select .cse81 .cse79) .cse80) |c_ULTIMATE.start_main_~data~0#1.base|))))) (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_3662))))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_52|) 0)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_52| 1) |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.offset_24| Int)) (let ((.cse87 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3655))) (let ((.cse88 (store (select .cse87 |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 |v_ULTIMATE.start_main_~node~0#1.base_52|))) (let ((.cse84 (store .cse87 |v_ULTIMATE.start_main_~item~0#1.base_51| (store .cse88 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse83 (select v_arrayElimArr_13 4)) (.cse85 (select (select .cse84 |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|)) (.cse86 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~node~0#1.base_52| v_ArrVal_3654) |v_ULTIMATE.start_main_~item~0#1.base_51| v_arrayElimArr_13) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) 4))) (or (< |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (< .cse83 |v_ULTIMATE.start_main_#t~mem12#1.offset_24|) (< |c_ULTIMATE.start_main_~data~0#1.offset| .cse83) (= |v_ULTIMATE.start_main_#t~mem12#1.offset_24| 0) (= (select (select .cse84 .cse85) .cse86) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (select (store .cse87 |v_ULTIMATE.start_main_~item~0#1.base_51| .cse88) .cse85) .cse86) 0))))))))))))) is different from true [2024-11-23 23:20:09,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:13,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:17,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:22,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:26,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:29,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:41,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:46,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:50,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:53,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:20:57,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:01,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:05,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:08,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:12,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:43,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:44,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:49,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:53,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:57,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:21:59,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:22:03,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:22:30,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:22:35,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:22:39,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:23:04,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:23:08,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:23:14,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:23:18,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:23:22,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:23:24,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:23:25,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:23:42,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:26:59,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:27:03,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:27:07,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:27:17,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:27:29,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-23 23:27:43,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]