./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72afb7e2fef67e92af6cd96223794441a1933610ae2e28bcd8b3509d9f7d2eed --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:57:45,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:57:46,057 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:57:46,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:57:46,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:57:46,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:57:46,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:57:46,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:57:46,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:57:46,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:57:46,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:57:46,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:57:46,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:57:46,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:57:46,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:57:46,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:57:46,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:57:46,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:57:46,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:57:46,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:57:46,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:57:46,111 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:57:46,111 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:57:46,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:57:46,111 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:57:46,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:57:46,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:57:46,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:57:46,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:57:46,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:57:46,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:57:46,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:57:46,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:57:46,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:57:46,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:57:46,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:57:46,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:57:46,115 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_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72afb7e2fef67e92af6cd96223794441a1933610ae2e28bcd8b3509d9f7d2eed [2024-11-28 04:57:46,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:57:46,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:57:46,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:57:46,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:57:46,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:57:46,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/ldv-regression/test10.c [2024-11-28 04:57:49,508 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/data/f7970411b/f2747a1bbfa64291bb5d33f172a5c3ec/FLAG1cf5a3cdf [2024-11-28 04:57:49,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:57:49,788 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/sv-benchmarks/c/ldv-regression/test10.c [2024-11-28 04:57:49,799 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/data/f7970411b/f2747a1bbfa64291bb5d33f172a5c3ec/FLAG1cf5a3cdf [2024-11-28 04:57:49,819 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/data/f7970411b/f2747a1bbfa64291bb5d33f172a5c3ec [2024-11-28 04:57:49,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:57:49,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:57:49,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:57:49,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:57:49,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:57:49,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:57:49" (1/1) ... [2024-11-28 04:57:49,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4397f147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:49, skipping insertion in model container [2024-11-28 04:57:49,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:57:49" (1/1) ... [2024-11-28 04:57:49,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:57:50,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:57:50,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:57:50,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:57:50,047 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:57:50,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50 WrapperNode [2024-11-28 04:57:50,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:57:50,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:57:50,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:57:50,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:57:50,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,085 INFO L138 Inliner]: procedures = 16, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2024-11-28 04:57:50,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:57:50,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:57:50,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:57:50,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:57:50,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,135 INFO L175 MemorySlicer]: Split 23 memory accesses to 3 slices as follows [2, 13, 8]. 57 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 11 writes are split as follows [0, 8, 3]. [2024-11-28 04:57:50,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:57:50,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:57:50,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:57:50,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:57:50,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (1/1) ... [2024-11-28 04:57:50,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:57:50,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:57:50,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:57:50,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:57:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:57:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:57:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:57:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 04:57:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 04:57:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 04:57:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:57:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:57:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:57:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:57:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:57:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:57:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:57:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:57:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:57:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:57:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:57:50,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:57:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:57:50,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:57:50,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:57:50,371 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:57:50,374 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:57:50,792 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-28 04:57:50,792 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:57:50,812 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:57:50,812 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 04:57:50,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:50 BoogieIcfgContainer [2024-11-28 04:57:50,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:57:50,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:57:50,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:57:50,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:57:50,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:57:49" (1/3) ... [2024-11-28 04:57:50,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c1e3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:57:50, skipping insertion in model container [2024-11-28 04:57:50,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:50" (2/3) ... [2024-11-28 04:57:50,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c1e3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:57:50, skipping insertion in model container [2024-11-28 04:57:50,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:50" (3/3) ... [2024-11-28 04:57:50,822 INFO L128 eAbstractionObserver]: Analyzing ICFG test10.c [2024-11-28 04:57:50,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:57:50,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test10.c that has 1 procedures, 72 locations, 1 initial locations, 0 loop locations, and 36 error locations. [2024-11-28 04:57:50,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:57:50,889 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;@3af128f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:57:50,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-11-28 04:57:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 35 states have (on average 2.085714285714286) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:57:50,897 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:50,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:57:50,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:50,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-28 04:57:50,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:50,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76387355] [2024-11-28 04:57:50,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:51,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:51,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76387355] [2024-11-28 04:57:51,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76387355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:51,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:51,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:57:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953023969] [2024-11-28 04:57:51,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:51,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:51,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:51,180 INFO L87 Difference]: Start difference. First operand has 72 states, 35 states have (on average 2.085714285714286) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:51,297 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2024-11-28 04:57:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:51,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 04:57:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:51,308 INFO L225 Difference]: With dead ends: 69 [2024-11-28 04:57:51,308 INFO L226 Difference]: Without dead ends: 67 [2024-11-28 04:57:51,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:51,315 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:51,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 31 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-28 04:57:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-28 04:57:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 66 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2024-11-28 04:57:51,347 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 3 [2024-11-28 04:57:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:51,347 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2024-11-28 04:57:51,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2024-11-28 04:57:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:57:51,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:51,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:57:51,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:57:51,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:51,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:51,349 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-28 04:57:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:51,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318049615] [2024-11-28 04:57:51,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:51,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:51,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:51,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318049615] [2024-11-28 04:57:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318049615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:51,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:51,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:57:51,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286924412] [2024-11-28 04:57:51,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:51,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:51,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:51,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:51,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:51,541 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:51,655 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2024-11-28 04:57:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:51,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 04:57:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:51,658 INFO L225 Difference]: With dead ends: 65 [2024-11-28 04:57:51,658 INFO L226 Difference]: Without dead ends: 65 [2024-11-28 04:57:51,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:51,659 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:51,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 32 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-28 04:57:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-28 04:57:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 64 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2024-11-28 04:57:51,671 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 3 [2024-11-28 04:57:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:51,671 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2024-11-28 04:57:51,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2024-11-28 04:57:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:57:51,672 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:51,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:57:51,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:57:51,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:51,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-28 04:57:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827936379] [2024-11-28 04:57:51,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:51,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827936379] [2024-11-28 04:57:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827936379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:57:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312119307] [2024-11-28 04:57:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:51,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:51,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:51,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:51,753 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:51,849 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2024-11-28 04:57:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:51,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 04:57:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:51,850 INFO L225 Difference]: With dead ends: 64 [2024-11-28 04:57:51,850 INFO L226 Difference]: Without dead ends: 64 [2024-11-28 04:57:51,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:51,851 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 29 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-28 04:57:51,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 29 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-28 04:57:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-28 04:57:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 63 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2024-11-28 04:57:51,856 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 4 [2024-11-28 04:57:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:51,857 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2024-11-28 04:57:51,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2024-11-28 04:57:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:57:51,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:51,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:57:51,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:57:51,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-28 04:57:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749311413] [2024-11-28 04:57:51,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:51,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749311413] [2024-11-28 04:57:51,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749311413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:51,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:51,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:57:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485363741] [2024-11-28 04:57:51,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:51,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:51,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:51,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:51,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:51,959 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:52,041 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2024-11-28 04:57:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:52,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 04:57:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:52,042 INFO L225 Difference]: With dead ends: 63 [2024-11-28 04:57:52,042 INFO L226 Difference]: Without dead ends: 63 [2024-11-28 04:57:52,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:52,043 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:52,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 31 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-28 04:57:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-28 04:57:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 62 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-28 04:57:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2024-11-28 04:57:52,056 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 4 [2024-11-28 04:57:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:52,056 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2024-11-28 04:57:52,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2024-11-28 04:57:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:57:52,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:52,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:57:52,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:57:52,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:52,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2024-11-28 04:57:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:52,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468186004] [2024-11-28 04:57:52,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468186004] [2024-11-28 04:57:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468186004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:52,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:57:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302543204] [2024-11-28 04:57:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:52,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:52,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:52,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:52,205 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-28 04:57:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:52,283 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2024-11-28 04:57:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:52,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-28 04:57:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:52,284 INFO L225 Difference]: With dead ends: 60 [2024-11-28 04:57:52,284 INFO L226 Difference]: Without dead ends: 60 [2024-11-28 04:57:52,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:52,285 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:52,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 27 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-28 04:57:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-28 04:57:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 59 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-28 04:57:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2024-11-28 04:57:52,296 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 6 [2024-11-28 04:57:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:52,296 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2024-11-28 04:57:52,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-28 04:57:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2024-11-28 04:57:52,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:57:52,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:52,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:57:52,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:57:52,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:52,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2024-11-28 04:57:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:52,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120816815] [2024-11-28 04:57:52,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:52,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120816815] [2024-11-28 04:57:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120816815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:52,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:52,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:57:52,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015581928] [2024-11-28 04:57:52,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:52,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:52,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:52,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:52,478 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-28 04:57:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:52,547 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2024-11-28 04:57:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:52,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-28 04:57:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:52,549 INFO L225 Difference]: With dead ends: 57 [2024-11-28 04:57:52,549 INFO L226 Difference]: Without dead ends: 57 [2024-11-28 04:57:52,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:52,550 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:52,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 29 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-28 04:57:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-28 04:57:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 56 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-28 04:57:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-11-28 04:57:52,558 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 6 [2024-11-28 04:57:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:52,558 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2024-11-28 04:57:52,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-28 04:57:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-11-28 04:57:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 04:57:52,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:52,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:52,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:57:52,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:52,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026919, now seen corresponding path program 1 times [2024-11-28 04:57:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708598924] [2024-11-28 04:57:52,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:52,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:52,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708598924] [2024-11-28 04:57:52,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708598924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:52,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:52,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:57:52,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138661711] [2024-11-28 04:57:52,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:52,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:52,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:52,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:52,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:52,685 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-28 04:57:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:52,760 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-11-28 04:57:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:52,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-28 04:57:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:52,762 INFO L225 Difference]: With dead ends: 51 [2024-11-28 04:57:52,762 INFO L226 Difference]: Without dead ends: 51 [2024-11-28 04:57:52,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:52,766 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:52,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-28 04:57:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-28 04:57:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-28 04:57:52,771 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 7 [2024-11-28 04:57:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:52,771 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-28 04:57:52,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-28 04:57:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-28 04:57:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 04:57:52,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:52,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:52,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:57:52,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:52,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026920, now seen corresponding path program 1 times [2024-11-28 04:57:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:52,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515992555] [2024-11-28 04:57:52,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:52,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:52,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515992555] [2024-11-28 04:57:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515992555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:52,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:52,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:57:52,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533357351] [2024-11-28 04:57:52,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:52,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:52,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:52,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:52,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:52,908 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-28 04:57:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:52,963 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2024-11-28 04:57:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:52,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-28 04:57:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:52,965 INFO L225 Difference]: With dead ends: 45 [2024-11-28 04:57:52,965 INFO L226 Difference]: Without dead ends: 45 [2024-11-28 04:57:52,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:52,966 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:52,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-28 04:57:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-28 04:57:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2024-11-28 04:57:52,970 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 7 [2024-11-28 04:57:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:52,971 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2024-11-28 04:57:52,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-28 04:57:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2024-11-28 04:57:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:57:52,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:52,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:52,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:57:52,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:52,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1036363501, now seen corresponding path program 1 times [2024-11-28 04:57:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:52,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73163929] [2024-11-28 04:57:52,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:53,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:53,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73163929] [2024-11-28 04:57:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73163929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:53,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:53,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:57:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757828657] [2024-11-28 04:57:53,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:53,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:57:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:53,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:57:53,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:57:53,093 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-28 04:57:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:53,185 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2024-11-28 04:57:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:57:53,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-28 04:57:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:53,186 INFO L225 Difference]: With dead ends: 44 [2024-11-28 04:57:53,187 INFO L226 Difference]: Without dead ends: 44 [2024-11-28 04:57:53,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:57:53,187 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:53,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 21 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-28 04:57:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-28 04:57:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2024-11-28 04:57:53,198 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 12 [2024-11-28 04:57:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:53,199 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2024-11-28 04:57:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-28 04:57:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2024-11-28 04:57:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:57:53,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:53,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:53,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:57:53,200 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:53,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1036363502, now seen corresponding path program 1 times [2024-11-28 04:57:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:53,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120902318] [2024-11-28 04:57:53,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:53,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:53,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:53,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120902318] [2024-11-28 04:57:53,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120902318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:53,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:53,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:57:53,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065715304] [2024-11-28 04:57:53,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:53,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:57:53,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:53,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:57:53,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:57:53,438 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 4 states, 3 states have (on average 4.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-28 04:57:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:53,516 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2024-11-28 04:57:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:57:53,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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-28 04:57:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:53,517 INFO L225 Difference]: With dead ends: 43 [2024-11-28 04:57:53,517 INFO L226 Difference]: Without dead ends: 43 [2024-11-28 04:57:53,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:57:53,518 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:53,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 36 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-28 04:57:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-28 04:57:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 42 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-28 04:57:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2024-11-28 04:57:53,522 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 12 [2024-11-28 04:57:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:53,522 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2024-11-28 04:57:53,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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-28 04:57:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2024-11-28 04:57:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 04:57:53,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:53,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:53,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:57:53,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:53,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:53,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2062497456, now seen corresponding path program 1 times [2024-11-28 04:57:53,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391399671] [2024-11-28 04:57:53,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391399671] [2024-11-28 04:57:53,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391399671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:53,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:53,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:57:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136953977] [2024-11-28 04:57:53,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:53,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:57:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:53,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:57:53,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:57:53,636 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:53,705 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2024-11-28 04:57:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:57:53,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 04:57:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:53,706 INFO L225 Difference]: With dead ends: 42 [2024-11-28 04:57:53,706 INFO L226 Difference]: Without dead ends: 42 [2024-11-28 04:57:53,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:57:53,707 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:53,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 17 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-28 04:57:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-28 04:57:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2024-11-28 04:57:53,712 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 13 [2024-11-28 04:57:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:53,712 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2024-11-28 04:57:53,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2024-11-28 04:57:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 04:57:53,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:53,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:53,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:57:53,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:53,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2062497457, now seen corresponding path program 1 times [2024-11-28 04:57:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:53,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309704272] [2024-11-28 04:57:53,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:53,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:53,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309704272] [2024-11-28 04:57:53,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309704272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:53,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:53,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:57:53,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144819916] [2024-11-28 04:57:53,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:53,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:57:53,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:53,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:57:53,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:57:53,928 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:54,015 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2024-11-28 04:57:54,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:57:54,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 04:57:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:54,016 INFO L225 Difference]: With dead ends: 41 [2024-11-28 04:57:54,016 INFO L226 Difference]: Without dead ends: 41 [2024-11-28 04:57:54,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:57:54,017 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:54,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-28 04:57:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-28 04:57:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2024-11-28 04:57:54,023 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 13 [2024-11-28 04:57:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:54,024 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2024-11-28 04:57:54,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2024-11-28 04:57:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 04:57:54,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:54,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:54,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:57:54,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:54,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash 403550421, now seen corresponding path program 1 times [2024-11-28 04:57:54,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:54,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620502368] [2024-11-28 04:57:54,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:54,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620502368] [2024-11-28 04:57:54,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620502368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:54,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:54,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:57:54,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216184973] [2024-11-28 04:57:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:54,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:57:54,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:54,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:57:54,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:57:54,162 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-28 04:57:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:54,231 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-11-28 04:57:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:57:54,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-28 04:57:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:54,232 INFO L225 Difference]: With dead ends: 40 [2024-11-28 04:57:54,232 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 04:57:54,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:57:54,233 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:54,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 29 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 04:57:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-28 04:57:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 39 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-28 04:57:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2024-11-28 04:57:54,236 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 20 [2024-11-28 04:57:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:54,236 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2024-11-28 04:57:54,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-28 04:57:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2024-11-28 04:57:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 04:57:54,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:54,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:54,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:57:54,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:54,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash 403550422, now seen corresponding path program 1 times [2024-11-28 04:57:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:54,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590887817] [2024-11-28 04:57:54,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:54,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:54,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:54,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590887817] [2024-11-28 04:57:54,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590887817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:54,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:54,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:57:54,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941284973] [2024-11-28 04:57:54,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:54,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:57:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:54,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:57:54,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:57:54,509 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 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-28 04:57:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:54,622 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2024-11-28 04:57:54,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:57:54,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 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-28 04:57:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:54,623 INFO L225 Difference]: With dead ends: 39 [2024-11-28 04:57:54,623 INFO L226 Difference]: Without dead ends: 39 [2024-11-28 04:57:54,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:57:54,624 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 81 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:54,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 22 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-28 04:57:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-28 04:57:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-28 04:57:54,630 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 20 [2024-11-28 04:57:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:54,630 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-11-28 04:57:54,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 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-28 04:57:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-28 04:57:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 04:57:54,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:54,634 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] [2024-11-28 04:57:54,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:57:54,634 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:54,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1453192031, now seen corresponding path program 1 times [2024-11-28 04:57:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:54,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908201045] [2024-11-28 04:57:54,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:55,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-28 04:57:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:55,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908201045] [2024-11-28 04:57:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908201045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:55,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:55,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:57:55,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684829963] [2024-11-28 04:57:55,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:55,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:57:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:55,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:57:55,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:57:55,158 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-28 04:57:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:55,378 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2024-11-28 04:57:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:57:55,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-28 04:57:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:55,380 INFO L225 Difference]: With dead ends: 38 [2024-11-28 04:57:55,380 INFO L226 Difference]: Without dead ends: 38 [2024-11-28 04:57:55,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:57:55,380 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:55,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 48 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-28 04:57:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-28 04:57:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-11-28 04:57:55,385 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 25 [2024-11-28 04:57:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:55,385 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-11-28 04:57:55,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-28 04:57:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-11-28 04:57:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 04:57:55,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:55,386 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] [2024-11-28 04:57:55,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:57:55,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:55,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1453192030, now seen corresponding path program 1 times [2024-11-28 04:57:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:55,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156424473] [2024-11-28 04:57:55,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156424473] [2024-11-28 04:57:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156424473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:56,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:56,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:57:56,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465333846] [2024-11-28 04:57:56,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:56,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:57:56,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:56,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:57:56,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:57:56,065 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-28 04:57:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:56,370 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2024-11-28 04:57:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:57:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-28 04:57:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:56,371 INFO L225 Difference]: With dead ends: 37 [2024-11-28 04:57:56,371 INFO L226 Difference]: Without dead ends: 37 [2024-11-28 04:57:56,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:57:56,372 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 95 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:56,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 53 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-28 04:57:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-28 04:57:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-11-28 04:57:56,375 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 25 [2024-11-28 04:57:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:56,376 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2024-11-28 04:57:56,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-28 04:57:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-11-28 04:57:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 04:57:56,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:56,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:56,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:57:56,377 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:56,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:56,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1226577117, now seen corresponding path program 1 times [2024-11-28 04:57:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:56,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120319046] [2024-11-28 04:57:56,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:56,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120319046] [2024-11-28 04:57:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120319046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:57:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279010412] [2024-11-28 04:57:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:56,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:57:56,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:56,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:57:56,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:57:56,610 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:56,757 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2024-11-28 04:57:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:57:56,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-28 04:57:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:56,758 INFO L225 Difference]: With dead ends: 42 [2024-11-28 04:57:56,758 INFO L226 Difference]: Without dead ends: 42 [2024-11-28 04:57:56,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:57:56,759 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:56,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 109 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-28 04:57:56,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-28 04:57:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 35 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-28 04:57:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-11-28 04:57:56,761 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 28 [2024-11-28 04:57:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:56,761 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2024-11-28 04:57:56,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-11-28 04:57:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 04:57:56,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:56,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:56,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:57:56,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:56,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:56,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1226577118, now seen corresponding path program 1 times [2024-11-28 04:57:56,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:56,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466580612] [2024-11-28 04:57:56,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:56,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:57,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466580612] [2024-11-28 04:57:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466580612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:57:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544371545] [2024-11-28 04:57:57,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:57,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:57:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:57,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:57:57,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:57:57,331 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:57,707 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2024-11-28 04:57:57,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:57:57,708 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-28 04:57:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:57,709 INFO L225 Difference]: With dead ends: 41 [2024-11-28 04:57:57,709 INFO L226 Difference]: Without dead ends: 41 [2024-11-28 04:57:57,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:57:57,709 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 164 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:57,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 107 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-28 04:57:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2024-11-28 04:57:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 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-28 04:57:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-28 04:57:57,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 28 [2024-11-28 04:57:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:57,712 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-28 04:57:57,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-28 04:57:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:57:57,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:57,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:57,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:57:57,715 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:57,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash -630816629, now seen corresponding path program 1 times [2024-11-28 04:57:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:57,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215163575] [2024-11-28 04:57:57,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:57,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:57,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215163575] [2024-11-28 04:57:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215163575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:57,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:57:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376612308] [2024-11-28 04:57:57,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:57,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:57,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:57,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:57,799 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-28 04:57:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:57,808 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2024-11-28 04:57:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:57,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-28 04:57:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:57,809 INFO L225 Difference]: With dead ends: 36 [2024-11-28 04:57:57,810 INFO L226 Difference]: Without dead ends: 36 [2024-11-28 04:57:57,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:57,811 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:57,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:57:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-28 04:57:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-28 04:57:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 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-28 04:57:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-11-28 04:57:57,815 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2024-11-28 04:57:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:57,816 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2024-11-28 04:57:57,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-28 04:57:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-11-28 04:57:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 04:57:57,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:57,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:57,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:57:57,817 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:57,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1919518950, now seen corresponding path program 1 times [2024-11-28 04:57:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303725592] [2024-11-28 04:57:57,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:58,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:58,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303725592] [2024-11-28 04:57:58,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303725592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:58,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:58,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:57:58,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196182277] [2024-11-28 04:57:58,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:58,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:57:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:58,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:57:58,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:57:58,429 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-28 04:57:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:58,777 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2024-11-28 04:57:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:57:58,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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 30 [2024-11-28 04:57:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:58,777 INFO L225 Difference]: With dead ends: 35 [2024-11-28 04:57:58,778 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 04:57:58,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:57:58,778 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:58,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 97 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 04:57:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-28 04:57:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2024-11-28 04:57:58,781 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 30 [2024-11-28 04:57:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:58,781 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2024-11-28 04:57:58,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-28 04:57:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2024-11-28 04:57:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 04:57:58,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:58,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:58,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:57:58,782 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:58,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:58,783 INFO L85 PathProgramCache]: Analyzing trace with hash -622823888, now seen corresponding path program 1 times [2024-11-28 04:57:58,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:58,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800259998] [2024-11-28 04:57:58,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:58,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:58,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800259998] [2024-11-28 04:57:58,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800259998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:58,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:58,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:57:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136991104] [2024-11-28 04:57:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:58,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:57:58,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:58,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:57:58,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:58,839 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 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-28 04:57:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:58,870 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2024-11-28 04:57:58,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:57:58,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 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-28 04:57:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:58,871 INFO L225 Difference]: With dead ends: 34 [2024-11-28 04:57:58,872 INFO L226 Difference]: Without dead ends: 33 [2024-11-28 04:57:58,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:57:58,872 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:58,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:57:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-28 04:57:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-28 04:57:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0) internal successors, (32), 32 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2024-11-28 04:57:58,874 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 31 [2024-11-28 04:57:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:58,875 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2024-11-28 04:57:58,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 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-28 04:57:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2024-11-28 04:57:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 04:57:58,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:58,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 04:57:58,877 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-28 04:57:58,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:58,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2127673375, now seen corresponding path program 1 times [2024-11-28 04:57:58,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:58,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899081427] [2024-11-28 04:57:58,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899081427] [2024-11-28 04:57:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899081427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:59,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:59,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 04:57:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342834168] [2024-11-28 04:57:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:59,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:57:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:59,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:57:59,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:57:59,280 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:59,600 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2024-11-28 04:57:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:57:59,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-28 04:57:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:59,601 INFO L225 Difference]: With dead ends: 30 [2024-11-28 04:57:59,601 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 04:57:59,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:57:59,605 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:59,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 131 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:57:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 04:57:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 04:57:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 04:57:59,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2024-11-28 04:57:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:59,609 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 04:57:59,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 04:57:59,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 04:57:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 36 remaining) [2024-11-28 04:57:59,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2024-11-28 04:57:59,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2024-11-28 04:57:59,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2024-11-28 04:57:59,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2024-11-28 04:57:59,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2024-11-28 04:57:59,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2024-11-28 04:57:59,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2024-11-28 04:57:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2024-11-28 04:57:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2024-11-28 04:57:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2024-11-28 04:57:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2024-11-28 04:57:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (1 of 36 remaining) [2024-11-28 04:57:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (0 of 36 remaining) [2024-11-28 04:57:59,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 04:57:59,621 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:59,625 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:57:59,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:57:59 BoogieIcfgContainer [2024-11-28 04:57:59,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:57:59,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:57:59,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:57:59,630 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:57:59,635 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:50" (3/4) ... [2024-11-28 04:57:59,640 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 04:57:59,653 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-28 04:57:59,654 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-28 04:57:59,654 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 04:57:59,654 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 04:57:59,747 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:57:59,747 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:57:59,747 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:57:59,748 INFO L158 Benchmark]: Toolchain (without parser) took 9924.66ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 94.6MB in the beginning and 318.6MB in the end (delta: -224.0MB). Peak memory consumption was 208.0MB. Max. memory is 16.1GB. [2024-11-28 04:57:59,748 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 167.8MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:57:59,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.49ms. Allocated memory is still 117.4MB. Free memory was 94.6MB in the beginning and 83.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:57:59,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.48ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 82.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:57:59,749 INFO L158 Benchmark]: Boogie Preprocessor took 73.43ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 80.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:57:59,749 INFO L158 Benchmark]: RCFGBuilder took 650.69ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 62.5MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 04:57:59,750 INFO L158 Benchmark]: TraceAbstraction took 8813.97ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 62.1MB in the beginning and 123.7MB in the end (delta: -61.6MB). Peak memory consumption was 166.0MB. Max. memory is 16.1GB. [2024-11-28 04:57:59,751 INFO L158 Benchmark]: Witness Printer took 117.44ms. Allocated memory is still 352.3MB. Free memory was 123.7MB in the beginning and 318.6MB in the end (delta: -194.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:57:59,752 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62ms. Allocated memory is still 167.8MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.49ms. Allocated memory is still 117.4MB. Free memory was 94.6MB in the beginning and 83.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.48ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 82.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.43ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 80.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 650.69ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 62.5MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8813.97ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 62.1MB in the beginning and 123.7MB in the end (delta: -61.6MB). Peak memory consumption was 166.0MB. Max. memory is 16.1GB. * Witness Printer took 117.44ms. Allocated memory is still 352.3MB. Free memory was 123.7MB in the beginning and 318.6MB in the end (delta: -194.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 72 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1321 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1321 mSDsluCounter, 991 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 475 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1094 IncrementalHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 516 mSDtfsCounter, 1094 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=0, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 2831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 04:57:59,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc98a677-ef3f-4b60-926c-22baea0706e4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE