./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0214.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0214.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU --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 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:59:33,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:59:33,277 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 21:59:33,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:59:33,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:59:33,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:59:33,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:59:33,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:59:33,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:59:33,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:59:33,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:59:33,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:59:33,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:59:33,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:59:33,332 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:59:33,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:59:33,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:59:33,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:59:33,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:59:33,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:59:33,338 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 21:59:33,339 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 21:59:33,339 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 21:59:33,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:59:33,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:59:33,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:59:33,340 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:59:33,350 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:59:33,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:59:33,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:59:33,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:59:33,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:59:33,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:59:33,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:33,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:59:33,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:59:33,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:59:33,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:59:33,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:59:33,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:59:33,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:59:33,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:59:33,356 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 [2024-10-31 21:59:33,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:59:33,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:59:33,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:59:33,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:59:33,680 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:59:33,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/memsafety/test-0214.i Unable to find full path for "g++" [2024-10-31 21:59:35,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:59:36,229 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:59:36,230 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/sv-benchmarks/c/memsafety/test-0214.i [2024-10-31 21:59:36,246 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/data/9405abcf4/47a8b28c50bd43d398ce192a6d999d21/FLAG51543c88c [2024-10-31 21:59:36,271 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/data/9405abcf4/47a8b28c50bd43d398ce192a6d999d21 [2024-10-31 21:59:36,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:59:36,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:59:36,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:36,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:59:36,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:59:36,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:36" (1/1) ... [2024-10-31 21:59:36,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1219991a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:36, skipping insertion in model container [2024-10-31 21:59:36,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:36" (1/1) ... [2024-10-31 21:59:36,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:59:36,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:36,879 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:59:36,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:37,010 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:59:37,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37 WrapperNode [2024-10-31 21:59:37,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:37,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:37,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:59:37,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:59:37,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,075 INFO L138 Inliner]: procedures = 181, calls = 42, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 176 [2024-10-31 21:59:37,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:37,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:59:37,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:59:37,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:59:37,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,121 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 7, 18]. 67 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 11 writes are split as follows [0, 5, 6]. [2024-10-31 21:59:37,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:59:37,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:59:37,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:59:37,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:59:37,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (1/1) ... [2024-10-31 21:59:37,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:37,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:59:37,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:59:37,246 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-10-31 21:59:37,247 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-10-31 21:59:37,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:59:37,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:59:37,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 21:59:37,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 21:59:37,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:59:37,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 21:59:37,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 21:59:37,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 21:59:37,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 21:59:37,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 21:59:37,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-31 21:59:37,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 21:59:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-31 21:59:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-31 21:59:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-31 21:59:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:59:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 21:59:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 21:59:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:59:37,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:59:37,473 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:59:37,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:59:38,097 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2024-10-31 21:59:38,098 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:59:38,122 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:59:38,122 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-31 21:59:38,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:38 BoogieIcfgContainer [2024-10-31 21:59:38,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:59:38,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:59:38,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:59:38,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:59:38,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:59:36" (1/3) ... [2024-10-31 21:59:38,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8334c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:38, skipping insertion in model container [2024-10-31 21:59:38,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:37" (2/3) ... [2024-10-31 21:59:38,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8334c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:38, skipping insertion in model container [2024-10-31 21:59:38,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:38" (3/3) ... [2024-10-31 21:59:38,139 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0214.i [2024-10-31 21:59:38,160 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:59:38,160 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2024-10-31 21:59:38,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:59:38,288 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;@2e0611c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:59:38,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2024-10-31 21:59:38,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 81 states have (on average 1.9506172839506173) internal successors, (158), 138 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 21:59:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-31 21:59:38,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:38,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:59:38,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:38,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1072948778, now seen corresponding path program 1 times [2024-10-31 21:59:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243388096] [2024-10-31 21:59:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:38,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243388096] [2024-10-31 21:59:38,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243388096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:38,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:38,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673398753] [2024-10-31 21:59:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:38,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:59:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:59:38,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:59:38,535 INFO L87 Difference]: Start difference. First operand has 142 states, 81 states have (on average 1.9506172839506173) internal successors, (158), 138 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 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-10-31 21:59:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:38,561 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2024-10-31 21:59:38,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:59:38,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 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-10-31 21:59:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:38,570 INFO L225 Difference]: With dead ends: 142 [2024-10-31 21:59:38,570 INFO L226 Difference]: Without dead ends: 140 [2024-10-31 21:59:38,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:59:38,575 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:38,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-31 21:59:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-31 21:59:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 80 states have (on average 1.8875) internal successors, (151), 136 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 21:59:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2024-10-31 21:59:38,645 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 6 [2024-10-31 21:59:38,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:38,647 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2024-10-31 21:59:38,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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-10-31 21:59:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2024-10-31 21:59:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:59:38,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:38,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:38,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:59:38,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:38,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1280381875, now seen corresponding path program 1 times [2024-10-31 21:59:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:38,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443089343] [2024-10-31 21:59:38,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:38,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443089343] [2024-10-31 21:59:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443089343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:38,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:38,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 21:59:38,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002677156] [2024-10-31 21:59:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:38,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:38,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:38,886 INFO L87 Difference]: Start difference. First operand 140 states and 155 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-10-31 21:59:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:39,237 INFO L93 Difference]: Finished difference Result 271 states and 300 transitions. [2024-10-31 21:59:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:39,237 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-10-31 21:59:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:39,240 INFO L225 Difference]: With dead ends: 271 [2024-10-31 21:59:39,243 INFO L226 Difference]: Without dead ends: 271 [2024-10-31 21:59:39,243 INFO L431 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-10-31 21:59:39,245 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 136 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:39,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 195 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-31 21:59:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 189. [2024-10-31 21:59:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 126 states have (on average 1.8571428571428572) internal successors, (234), 182 states have internal predecessors, (234), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-31 21:59:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 242 transitions. [2024-10-31 21:59:39,280 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 242 transitions. Word has length 7 [2024-10-31 21:59:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:39,281 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 242 transitions. [2024-10-31 21:59:39,281 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-10-31 21:59:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 242 transitions. [2024-10-31 21:59:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:59:39,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:39,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:39,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:59:39,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1280381874, now seen corresponding path program 1 times [2024-10-31 21:59:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:39,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550801957] [2024-10-31 21:59:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550801957] [2024-10-31 21:59:39,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550801957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:39,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:39,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791838955] [2024-10-31 21:59:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:39,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:39,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:39,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:39,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:39,525 INFO L87 Difference]: Start difference. First operand 189 states and 242 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:39,786 INFO L93 Difference]: Finished difference Result 319 states and 397 transitions. [2024-10-31 21:59:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-31 21:59:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:39,790 INFO L225 Difference]: With dead ends: 319 [2024-10-31 21:59:39,790 INFO L226 Difference]: Without dead ends: 319 [2024-10-31 21:59:39,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:39,796 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 106 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:39,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 328 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-31 21:59:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 262. [2024-10-31 21:59:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 193 states have (on average 1.8186528497409327) internal successors, (351), 251 states have internal predecessors, (351), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-31 21:59:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 367 transitions. [2024-10-31 21:59:39,836 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 367 transitions. Word has length 7 [2024-10-31 21:59:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:39,836 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 367 transitions. [2024-10-31 21:59:39,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 367 transitions. [2024-10-31 21:59:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:59:39,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:39,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:39,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:59:39,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:39,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1280381812, now seen corresponding path program 1 times [2024-10-31 21:59:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:39,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987944151] [2024-10-31 21:59:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:39,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987944151] [2024-10-31 21:59:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987944151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:40,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:40,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258670721] [2024-10-31 21:59:40,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:40,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:40,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:40,002 INFO L87 Difference]: Start difference. First operand 262 states and 367 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:40,179 INFO L93 Difference]: Finished difference Result 318 states and 395 transitions. [2024-10-31 21:59:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:40,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-31 21:59:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:40,181 INFO L225 Difference]: With dead ends: 318 [2024-10-31 21:59:40,182 INFO L226 Difference]: Without dead ends: 318 [2024-10-31 21:59:40,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:40,183 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 104 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:40,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 303 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-31 21:59:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 262. [2024-10-31 21:59:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 193 states have (on average 1.8186528497409327) internal successors, (351), 251 states have internal predecessors, (351), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-31 21:59:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 367 transitions. [2024-10-31 21:59:40,196 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 367 transitions. Word has length 7 [2024-10-31 21:59:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:40,196 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 367 transitions. [2024-10-31 21:59:40,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 367 transitions. [2024-10-31 21:59:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-31 21:59:40,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:40,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:40,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:59:40,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:40,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash -251697362, now seen corresponding path program 1 times [2024-10-31 21:59:40,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:40,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713296810] [2024-10-31 21:59:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:40,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:40,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713296810] [2024-10-31 21:59:40,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713296810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:40,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:40,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:40,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66801660] [2024-10-31 21:59:40,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:40,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:40,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:40,415 INFO L87 Difference]: Start difference. First operand 262 states and 367 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:40,589 INFO L93 Difference]: Finished difference Result 400 states and 533 transitions. [2024-10-31 21:59:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:40,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-31 21:59:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:40,595 INFO L225 Difference]: With dead ends: 400 [2024-10-31 21:59:40,595 INFO L226 Difference]: Without dead ends: 400 [2024-10-31 21:59:40,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:40,596 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 127 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:40,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 645 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-31 21:59:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 304. [2024-10-31 21:59:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 232 states have (on average 1.8017241379310345) internal successors, (418), 291 states have internal predecessors, (418), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 438 transitions. [2024-10-31 21:59:40,612 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 438 transitions. Word has length 10 [2024-10-31 21:59:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:40,613 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 438 transitions. [2024-10-31 21:59:40,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 438 transitions. [2024-10-31 21:59:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-31 21:59:40,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:40,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:40,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:59:40,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:40,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash -249850320, now seen corresponding path program 1 times [2024-10-31 21:59:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706104326] [2024-10-31 21:59:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:40,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:40,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706104326] [2024-10-31 21:59:40,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706104326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:40,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:40,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499939743] [2024-10-31 21:59:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:40,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:40,739 INFO L87 Difference]: Start difference. First operand 304 states and 438 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:40,918 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2024-10-31 21:59:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-31 21:59:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:40,921 INFO L225 Difference]: With dead ends: 390 [2024-10-31 21:59:40,921 INFO L226 Difference]: Without dead ends: 390 [2024-10-31 21:59:40,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:40,922 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 112 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:40,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 669 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-31 21:59:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 303. [2024-10-31 21:59:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 231 states have (on average 1.8051948051948052) internal successors, (417), 290 states have internal predecessors, (417), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 437 transitions. [2024-10-31 21:59:40,933 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 437 transitions. Word has length 10 [2024-10-31 21:59:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:40,933 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 437 transitions. [2024-10-31 21:59:40,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 437 transitions. [2024-10-31 21:59:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-31 21:59:40,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:40,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:40,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:59:40,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:40,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:40,935 INFO L85 PathProgramCache]: Analyzing trace with hash 787315061, now seen corresponding path program 1 times [2024-10-31 21:59:40,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:40,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121618072] [2024-10-31 21:59:40,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121618072] [2024-10-31 21:59:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121618072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:40,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:40,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144678728] [2024-10-31 21:59:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:40,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:40,964 INFO L87 Difference]: Start difference. First operand 303 states and 437 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:41,105 INFO L93 Difference]: Finished difference Result 358 states and 488 transitions. [2024-10-31 21:59:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:41,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-31 21:59:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:41,107 INFO L225 Difference]: With dead ends: 358 [2024-10-31 21:59:41,108 INFO L226 Difference]: Without dead ends: 351 [2024-10-31 21:59:41,108 INFO L431 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-10-31 21:59:41,109 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 68 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:41,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 223 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-31 21:59:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 300. [2024-10-31 21:59:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 228 states have (on average 1.8070175438596492) internal successors, (412), 287 states have internal predecessors, (412), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 432 transitions. [2024-10-31 21:59:41,122 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 432 transitions. Word has length 11 [2024-10-31 21:59:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:41,123 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 432 transitions. [2024-10-31 21:59:41,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 432 transitions. [2024-10-31 21:59:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-31 21:59:41,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:41,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:41,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:59:41,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:41,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1918130468, now seen corresponding path program 1 times [2024-10-31 21:59:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658894302] [2024-10-31 21:59:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:41,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:41,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658894302] [2024-10-31 21:59:41,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658894302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:41,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:41,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35788613] [2024-10-31 21:59:41,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:41,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:41,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:41,205 INFO L87 Difference]: Start difference. First operand 300 states and 432 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:41,495 INFO L93 Difference]: Finished difference Result 396 states and 528 transitions. [2024-10-31 21:59:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:41,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-31 21:59:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:41,497 INFO L225 Difference]: With dead ends: 396 [2024-10-31 21:59:41,498 INFO L226 Difference]: Without dead ends: 396 [2024-10-31 21:59:41,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:41,499 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 163 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:41,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 279 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-31 21:59:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 300. [2024-10-31 21:59:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 228 states have (on average 1.780701754385965) internal successors, (406), 287 states have internal predecessors, (406), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2024-10-31 21:59:41,509 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 13 [2024-10-31 21:59:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:41,509 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2024-10-31 21:59:41,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2024-10-31 21:59:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-31 21:59:41,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:41,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:41,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:59:41,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:41,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1918130467, now seen corresponding path program 1 times [2024-10-31 21:59:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:41,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549011090] [2024-10-31 21:59:41,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:41,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549011090] [2024-10-31 21:59:41,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549011090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:41,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:41,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259451074] [2024-10-31 21:59:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:41,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:41,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:41,765 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:42,113 INFO L93 Difference]: Finished difference Result 369 states and 472 transitions. [2024-10-31 21:59:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:42,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-31 21:59:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:42,116 INFO L225 Difference]: With dead ends: 369 [2024-10-31 21:59:42,116 INFO L226 Difference]: Without dead ends: 369 [2024-10-31 21:59:42,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:42,117 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 108 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:42,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 579 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-31 21:59:42,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 310. [2024-10-31 21:59:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 235 states have (on average 1.7617021276595746) internal successors, (414), 295 states have internal predecessors, (414), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-31 21:59:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 440 transitions. [2024-10-31 21:59:42,144 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 440 transitions. Word has length 13 [2024-10-31 21:59:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:42,144 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 440 transitions. [2024-10-31 21:59:42,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 440 transitions. [2024-10-31 21:59:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-31 21:59:42,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:42,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:42,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:59:42,146 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:42,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1917206946, now seen corresponding path program 1 times [2024-10-31 21:59:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117316659] [2024-10-31 21:59:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:42,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:42,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:42,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117316659] [2024-10-31 21:59:42,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117316659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:42,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:42,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873721287] [2024-10-31 21:59:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:42,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:42,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:42,380 INFO L87 Difference]: Start difference. First operand 310 states and 440 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:42,915 INFO L93 Difference]: Finished difference Result 368 states and 470 transitions. [2024-10-31 21:59:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:42,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-31 21:59:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:42,917 INFO L225 Difference]: With dead ends: 368 [2024-10-31 21:59:42,919 INFO L226 Difference]: Without dead ends: 368 [2024-10-31 21:59:42,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:42,920 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 103 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:42,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 637 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 21:59:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-31 21:59:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 304. [2024-10-31 21:59:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 232 states have (on average 1.771551724137931) internal successors, (411), 289 states have internal predecessors, (411), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 431 transitions. [2024-10-31 21:59:42,936 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 431 transitions. Word has length 13 [2024-10-31 21:59:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:42,936 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 431 transitions. [2024-10-31 21:59:42,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 431 transitions. [2024-10-31 21:59:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-31 21:59:42,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:42,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:42,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:59:42,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:42,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash 398929757, now seen corresponding path program 1 times [2024-10-31 21:59:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:42,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527771488] [2024-10-31 21:59:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:42,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:43,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:59:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:43,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:43,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527771488] [2024-10-31 21:59:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527771488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:43,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113119811] [2024-10-31 21:59:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:43,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:43,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:43,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:43,021 INFO L87 Difference]: Start difference. First operand 304 states and 431 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:43,272 INFO L93 Difference]: Finished difference Result 396 states and 526 transitions. [2024-10-31 21:59:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:43,273 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-31 21:59:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:43,274 INFO L225 Difference]: With dead ends: 396 [2024-10-31 21:59:43,275 INFO L226 Difference]: Without dead ends: 396 [2024-10-31 21:59:43,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:43,276 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 134 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:43,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 286 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-31 21:59:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 310. [2024-10-31 21:59:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 238 states have (on average 1.7521008403361344) internal successors, (417), 295 states have internal predecessors, (417), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2024-10-31 21:59:43,290 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 15 [2024-10-31 21:59:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:43,291 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2024-10-31 21:59:43,291 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2024-10-31 21:59:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-31 21:59:43,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:43,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:43,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:59:43,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:43,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 398929758, now seen corresponding path program 1 times [2024-10-31 21:59:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:43,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282438891] [2024-10-31 21:59:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:43,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:59:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282438891] [2024-10-31 21:59:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282438891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:43,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:43,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:43,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674549694] [2024-10-31 21:59:43,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:43,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:43,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:43,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:43,419 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:43,636 INFO L93 Difference]: Finished difference Result 359 states and 449 transitions. [2024-10-31 21:59:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:43,636 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-31 21:59:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:43,638 INFO L225 Difference]: With dead ends: 359 [2024-10-31 21:59:43,638 INFO L226 Difference]: Without dead ends: 359 [2024-10-31 21:59:43,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:43,639 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 105 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:43,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 361 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-31 21:59:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 310. [2024-10-31 21:59:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 238 states have (on average 1.7142857142857142) internal successors, (408), 295 states have internal predecessors, (408), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 428 transitions. [2024-10-31 21:59:43,649 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 428 transitions. Word has length 15 [2024-10-31 21:59:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:43,649 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 428 transitions. [2024-10-31 21:59:43,649 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 428 transitions. [2024-10-31 21:59:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 21:59:43,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:43,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:43,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:59:43,650 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:43,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash 688488293, now seen corresponding path program 1 times [2024-10-31 21:59:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:43,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813973003] [2024-10-31 21:59:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:43,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813973003] [2024-10-31 21:59:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813973003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:43,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:43,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:43,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327348718] [2024-10-31 21:59:43,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:43,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:43,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:43,700 INFO L87 Difference]: Start difference. First operand 310 states and 428 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:43,799 INFO L93 Difference]: Finished difference Result 307 states and 422 transitions. [2024-10-31 21:59:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:43,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-31 21:59:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:43,804 INFO L225 Difference]: With dead ends: 307 [2024-10-31 21:59:43,804 INFO L226 Difference]: Without dead ends: 307 [2024-10-31 21:59:43,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-31 21:59:43,805 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:43,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 230 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-31 21:59:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-10-31 21:59:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 238 states have (on average 1.6890756302521008) internal successors, (402), 292 states have internal predecessors, (402), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 422 transitions. [2024-10-31 21:59:43,818 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 422 transitions. Word has length 19 [2024-10-31 21:59:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:43,819 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 422 transitions. [2024-10-31 21:59:43,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 422 transitions. [2024-10-31 21:59:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 21:59:43,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:43,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:43,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:59:43,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:43,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash 688488294, now seen corresponding path program 1 times [2024-10-31 21:59:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:43,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640123710] [2024-10-31 21:59:43,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:43,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:43,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640123710] [2024-10-31 21:59:43,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640123710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:43,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:43,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:43,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788836380] [2024-10-31 21:59:43,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:43,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:43,931 INFO L87 Difference]: Start difference. First operand 307 states and 422 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:44,054 INFO L93 Difference]: Finished difference Result 310 states and 424 transitions. [2024-10-31 21:59:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:44,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-31 21:59:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:44,056 INFO L225 Difference]: With dead ends: 310 [2024-10-31 21:59:44,056 INFO L226 Difference]: Without dead ends: 310 [2024-10-31 21:59:44,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:44,057 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 8 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:44,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 341 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-31 21:59:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-10-31 21:59:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 242 states have (on average 1.6694214876033058) internal successors, (404), 295 states have internal predecessors, (404), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 424 transitions. [2024-10-31 21:59:44,069 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 424 transitions. Word has length 19 [2024-10-31 21:59:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:44,069 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 424 transitions. [2024-10-31 21:59:44,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 424 transitions. [2024-10-31 21:59:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 21:59:44,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:44,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:44,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:59:44,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:44,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -131699369, now seen corresponding path program 1 times [2024-10-31 21:59:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006281883] [2024-10-31 21:59:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:44,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:44,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006281883] [2024-10-31 21:59:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006281883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:44,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:44,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:59:44,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608218881] [2024-10-31 21:59:44,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:44,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:44,181 INFO L87 Difference]: Start difference. First operand 310 states and 424 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:44,215 INFO L93 Difference]: Finished difference Result 316 states and 430 transitions. [2024-10-31 21:59:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:44,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-31 21:59:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:44,217 INFO L225 Difference]: With dead ends: 316 [2024-10-31 21:59:44,217 INFO L226 Difference]: Without dead ends: 316 [2024-10-31 21:59:44,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-31 21:59:44,218 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 11 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:44,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-31 21:59:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2024-10-31 21:59:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 244 states have (on average 1.6639344262295082) internal successors, (406), 297 states have internal predecessors, (406), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:59:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 426 transitions. [2024-10-31 21:59:44,226 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 426 transitions. Word has length 20 [2024-10-31 21:59:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:44,226 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 426 transitions. [2024-10-31 21:59:44,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 426 transitions. [2024-10-31 21:59:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 21:59:44,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:44,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:44,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:59:44,227 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:44,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:44,228 INFO L85 PathProgramCache]: Analyzing trace with hash -131643665, now seen corresponding path program 1 times [2024-10-31 21:59:44,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:44,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740843355] [2024-10-31 21:59:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740843355] [2024-10-31 21:59:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740843355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:44,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:44,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:44,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784337688] [2024-10-31 21:59:44,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:44,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:44,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:44,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:44,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:44,342 INFO L87 Difference]: Start difference. First operand 312 states and 426 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:44,415 INFO L93 Difference]: Finished difference Result 362 states and 490 transitions. [2024-10-31 21:59:44,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:44,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-31 21:59:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:44,418 INFO L225 Difference]: With dead ends: 362 [2024-10-31 21:59:44,418 INFO L226 Difference]: Without dead ends: 362 [2024-10-31 21:59:44,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:44,419 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 31 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:44,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 850 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-31 21:59:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 338. [2024-10-31 21:59:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 265 states have (on average 1.6264150943396227) internal successors, (431), 319 states have internal predecessors, (431), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 461 transitions. [2024-10-31 21:59:44,430 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 461 transitions. Word has length 20 [2024-10-31 21:59:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:44,430 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 461 transitions. [2024-10-31 21:59:44,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 461 transitions. [2024-10-31 21:59:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 21:59:44,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:44,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:44,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 21:59:44,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:44,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2560946, now seen corresponding path program 1 times [2024-10-31 21:59:44,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:44,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116946149] [2024-10-31 21:59:44,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:44,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:44,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:44,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116946149] [2024-10-31 21:59:44,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116946149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:44,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:44,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170639759] [2024-10-31 21:59:44,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:44,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:44,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:44,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:44,551 INFO L87 Difference]: Start difference. First operand 338 states and 461 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:44,682 INFO L93 Difference]: Finished difference Result 342 states and 465 transitions. [2024-10-31 21:59:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:44,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-31 21:59:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:44,684 INFO L225 Difference]: With dead ends: 342 [2024-10-31 21:59:44,684 INFO L226 Difference]: Without dead ends: 342 [2024-10-31 21:59:44,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:44,685 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 6 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:44,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 342 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-31 21:59:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-10-31 21:59:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 269 states have (on average 1.6171003717472119) internal successors, (435), 323 states have internal predecessors, (435), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 465 transitions. [2024-10-31 21:59:44,695 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 465 transitions. Word has length 20 [2024-10-31 21:59:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:44,695 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 465 transitions. [2024-10-31 21:59:44,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 465 transitions. [2024-10-31 21:59:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 21:59:44,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:44,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:44,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 21:59:44,697 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:44,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2559024, now seen corresponding path program 1 times [2024-10-31 21:59:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:44,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804894054] [2024-10-31 21:59:44,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:44,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:44,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804894054] [2024-10-31 21:59:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804894054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246062999] [2024-10-31 21:59:44,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:44,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:44,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:44,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:44,794 INFO L87 Difference]: Start difference. First operand 342 states and 465 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:44,880 INFO L93 Difference]: Finished difference Result 375 states and 504 transitions. [2024-10-31 21:59:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-31 21:59:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:44,882 INFO L225 Difference]: With dead ends: 375 [2024-10-31 21:59:44,883 INFO L226 Difference]: Without dead ends: 375 [2024-10-31 21:59:44,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:44,883 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 45 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:44,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 952 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-31 21:59:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 337. [2024-10-31 21:59:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 265 states have (on average 1.6113207547169812) internal successors, (427), 318 states have internal predecessors, (427), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 457 transitions. [2024-10-31 21:59:44,893 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 457 transitions. Word has length 20 [2024-10-31 21:59:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:44,893 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 457 transitions. [2024-10-31 21:59:44,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 457 transitions. [2024-10-31 21:59:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 21:59:44,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:44,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:44,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 21:59:44,895 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:44,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash 59872289, now seen corresponding path program 1 times [2024-10-31 21:59:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:44,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116779558] [2024-10-31 21:59:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:59:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116779558] [2024-10-31 21:59:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116779558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:45,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:45,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:59:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758007742] [2024-10-31 21:59:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:45,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:45,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:45,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:45,208 INFO L87 Difference]: Start difference. First operand 337 states and 457 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:45,637 INFO L93 Difference]: Finished difference Result 416 states and 525 transitions. [2024-10-31 21:59:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:59:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-31 21:59:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:45,639 INFO L225 Difference]: With dead ends: 416 [2024-10-31 21:59:45,640 INFO L226 Difference]: Without dead ends: 416 [2024-10-31 21:59:45,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:59:45,640 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 101 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:45,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 899 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-31 21:59:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 331. [2024-10-31 21:59:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 259 states have (on average 1.606177606177606) internal successors, (416), 312 states have internal predecessors, (416), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 446 transitions. [2024-10-31 21:59:45,653 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 446 transitions. Word has length 21 [2024-10-31 21:59:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:45,653 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 446 transitions. [2024-10-31 21:59:45,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 446 transitions. [2024-10-31 21:59:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 21:59:45,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:45,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:45,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 21:59:45,656 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:45,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash -79389329, now seen corresponding path program 1 times [2024-10-31 21:59:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:45,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487178387] [2024-10-31 21:59:45,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:45,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487178387] [2024-10-31 21:59:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487178387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:45,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:45,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:45,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487997622] [2024-10-31 21:59:45,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:45,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:59:45,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:59:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:45,762 INFO L87 Difference]: Start difference. First operand 331 states and 446 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:45,896 INFO L93 Difference]: Finished difference Result 334 states and 448 transitions. [2024-10-31 21:59:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:59:45,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-31 21:59:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:45,899 INFO L225 Difference]: With dead ends: 334 [2024-10-31 21:59:45,899 INFO L226 Difference]: Without dead ends: 334 [2024-10-31 21:59:45,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:59:45,900 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:45,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 340 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-31 21:59:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 324. [2024-10-31 21:59:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 253 states have (on average 1.6126482213438735) internal successors, (408), 305 states have internal predecessors, (408), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 438 transitions. [2024-10-31 21:59:45,910 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 438 transitions. Word has length 21 [2024-10-31 21:59:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:45,910 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 438 transitions. [2024-10-31 21:59:45,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 438 transitions. [2024-10-31 21:59:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 21:59:45,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:45,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:45,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 21:59:45,913 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:45,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:45,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1710334668, now seen corresponding path program 1 times [2024-10-31 21:59:45,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:45,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944129739] [2024-10-31 21:59:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:59:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944129739] [2024-10-31 21:59:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944129739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:45,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:45,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:59:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136076176] [2024-10-31 21:59:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:45,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:45,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:45,990 INFO L87 Difference]: Start difference. First operand 324 states and 438 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:46,127 INFO L93 Difference]: Finished difference Result 329 states and 437 transitions. [2024-10-31 21:59:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-31 21:59:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:46,129 INFO L225 Difference]: With dead ends: 329 [2024-10-31 21:59:46,129 INFO L226 Difference]: Without dead ends: 329 [2024-10-31 21:59:46,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:46,130 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 34 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:46,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 305 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-31 21:59:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 323. [2024-10-31 21:59:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.5465116279069768) internal successors, (399), 304 states have internal predecessors, (399), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 429 transitions. [2024-10-31 21:59:46,144 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 429 transitions. Word has length 23 [2024-10-31 21:59:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:46,144 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 429 transitions. [2024-10-31 21:59:46,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 429 transitions. [2024-10-31 21:59:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 21:59:46,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:46,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:46,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 21:59:46,146 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:46,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:46,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1710334669, now seen corresponding path program 1 times [2024-10-31 21:59:46,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:46,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727588108] [2024-10-31 21:59:46,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:46,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:59:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:46,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:46,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727588108] [2024-10-31 21:59:46,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727588108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:46,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:46,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:59:46,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164127506] [2024-10-31 21:59:46,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:46,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:46,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:46,369 INFO L87 Difference]: Start difference. First operand 323 states and 429 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:46,597 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2024-10-31 21:59:46,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:59:46,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-31 21:59:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:46,599 INFO L225 Difference]: With dead ends: 247 [2024-10-31 21:59:46,599 INFO L226 Difference]: Without dead ends: 247 [2024-10-31 21:59:46,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:59:46,600 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 46 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:46,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 884 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-31 21:59:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 225. [2024-10-31 21:59:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 168 states have (on average 1.5238095238095237) internal successors, (256), 212 states have internal predecessors, (256), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:59:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 274 transitions. [2024-10-31 21:59:46,606 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 274 transitions. Word has length 23 [2024-10-31 21:59:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:46,607 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 274 transitions. [2024-10-31 21:59:46,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 274 transitions. [2024-10-31 21:59:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 21:59:46,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:46,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:46,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 21:59:46,608 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:46,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2045900250, now seen corresponding path program 1 times [2024-10-31 21:59:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:46,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396824517] [2024-10-31 21:59:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:46,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:46,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396824517] [2024-10-31 21:59:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396824517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:46,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:59:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505686885] [2024-10-31 21:59:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:46,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:46,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:46,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:46,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:46,935 INFO L87 Difference]: Start difference. First operand 225 states and 274 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:47,204 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2024-10-31 21:59:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:59:47,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-31 21:59:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:47,206 INFO L225 Difference]: With dead ends: 256 [2024-10-31 21:59:47,206 INFO L226 Difference]: Without dead ends: 256 [2024-10-31 21:59:47,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:59:47,210 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:47,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 858 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-31 21:59:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 235. [2024-10-31 21:59:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.4943820224719102) internal successors, (266), 222 states have internal predecessors, (266), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:59:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 284 transitions. [2024-10-31 21:59:47,218 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 284 transitions. Word has length 24 [2024-10-31 21:59:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:47,218 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 284 transitions. [2024-10-31 21:59:47,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 284 transitions. [2024-10-31 21:59:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 21:59:47,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:47,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:47,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 21:59:47,219 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:47,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1535366073, now seen corresponding path program 1 times [2024-10-31 21:59:47,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:47,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842800109] [2024-10-31 21:59:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:47,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842800109] [2024-10-31 21:59:47,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842800109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:47,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:47,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:47,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846871032] [2024-10-31 21:59:47,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:47,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:47,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:47,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:47,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:47,385 INFO L87 Difference]: Start difference. First operand 235 states and 284 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:47,461 INFO L93 Difference]: Finished difference Result 259 states and 311 transitions. [2024-10-31 21:59:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:47,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-31 21:59:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:47,463 INFO L225 Difference]: With dead ends: 259 [2024-10-31 21:59:47,463 INFO L226 Difference]: Without dead ends: 259 [2024-10-31 21:59:47,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:47,464 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 20 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:47,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 892 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-31 21:59:47,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2024-10-31 21:59:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.4831460674157304) internal successors, (264), 222 states have internal predecessors, (264), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:59:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 282 transitions. [2024-10-31 21:59:47,471 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 282 transitions. Word has length 24 [2024-10-31 21:59:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:47,471 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 282 transitions. [2024-10-31 21:59:47,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 282 transitions. [2024-10-31 21:59:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 21:59:47,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:47,472 INFO L215 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-10-31 21:59:47,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 21:59:47,472 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1674205682, now seen corresponding path program 1 times [2024-10-31 21:59:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:47,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865970196] [2024-10-31 21:59:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:47,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:47,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865970196] [2024-10-31 21:59:47,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865970196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:47,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:47,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:59:47,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261501273] [2024-10-31 21:59:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:47,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:47,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:47,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:47,782 INFO L87 Difference]: Start difference. First operand 235 states and 282 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:48,071 INFO L93 Difference]: Finished difference Result 253 states and 301 transitions. [2024-10-31 21:59:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:59:48,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-31 21:59:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:48,073 INFO L225 Difference]: With dead ends: 253 [2024-10-31 21:59:48,073 INFO L226 Difference]: Without dead ends: 253 [2024-10-31 21:59:48,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:59:48,074 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 53 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:48,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 921 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-31 21:59:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2024-10-31 21:59:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 183 states have (on average 1.469945355191257) internal successors, (269), 227 states have internal predecessors, (269), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:59:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 287 transitions. [2024-10-31 21:59:48,080 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 287 transitions. Word has length 25 [2024-10-31 21:59:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:48,081 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 287 transitions. [2024-10-31 21:59:48,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 287 transitions. [2024-10-31 21:59:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 21:59:48,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:48,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:48,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-31 21:59:48,082 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:48,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash -984725155, now seen corresponding path program 1 times [2024-10-31 21:59:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:48,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445417596] [2024-10-31 21:59:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:48,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:48,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:48,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445417596] [2024-10-31 21:59:48,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445417596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:48,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330013081] [2024-10-31 21:59:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:48,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:48,351 INFO L87 Difference]: Start difference. First operand 240 states and 287 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:48,798 INFO L93 Difference]: Finished difference Result 431 states and 519 transitions. [2024-10-31 21:59:48,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:59:48,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-31 21:59:48,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:48,800 INFO L225 Difference]: With dead ends: 431 [2024-10-31 21:59:48,801 INFO L226 Difference]: Without dead ends: 431 [2024-10-31 21:59:48,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:59:48,802 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 151 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:48,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 609 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 21:59:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-31 21:59:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 367. [2024-10-31 21:59:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 302 states have (on average 1.5033112582781456) internal successors, (454), 348 states have internal predecessors, (454), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 484 transitions. [2024-10-31 21:59:48,816 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 484 transitions. Word has length 26 [2024-10-31 21:59:48,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:48,816 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 484 transitions. [2024-10-31 21:59:48,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 484 transitions. [2024-10-31 21:59:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 21:59:48,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:48,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:48,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-31 21:59:48,817 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:48,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:48,818 INFO L85 PathProgramCache]: Analyzing trace with hash -461708714, now seen corresponding path program 1 times [2024-10-31 21:59:48,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:48,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568636573] [2024-10-31 21:59:48,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:48,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:49,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568636573] [2024-10-31 21:59:49,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568636573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:49,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:49,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:59:49,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335530945] [2024-10-31 21:59:49,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:49,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:49,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:49,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:49,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:49,006 INFO L87 Difference]: Start difference. First operand 367 states and 484 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:49,225 INFO L93 Difference]: Finished difference Result 396 states and 514 transitions. [2024-10-31 21:59:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:59:49,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-31 21:59:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:49,227 INFO L225 Difference]: With dead ends: 396 [2024-10-31 21:59:49,227 INFO L226 Difference]: Without dead ends: 396 [2024-10-31 21:59:49,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:59:49,228 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 172 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:49,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 569 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-31 21:59:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 388. [2024-10-31 21:59:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 324 states have (on average 1.4814814814814814) internal successors, (480), 369 states have internal predecessors, (480), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 510 transitions. [2024-10-31 21:59:49,243 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 510 transitions. Word has length 27 [2024-10-31 21:59:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:49,243 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 510 transitions. [2024-10-31 21:59:49,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 510 transitions. [2024-10-31 21:59:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 21:59:49,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:49,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:49,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-31 21:59:49,244 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:49,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:49,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1700919435, now seen corresponding path program 1 times [2024-10-31 21:59:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:49,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659065160] [2024-10-31 21:59:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:49,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:49,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:49,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659065160] [2024-10-31 21:59:49,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659065160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:49,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:49,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 21:59:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270724751] [2024-10-31 21:59:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 21:59:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 21:59:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:59:49,678 INFO L87 Difference]: Start difference. First operand 388 states and 510 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:50,368 INFO L93 Difference]: Finished difference Result 574 states and 736 transitions. [2024-10-31 21:59:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:59:50,369 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-31 21:59:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:50,371 INFO L225 Difference]: With dead ends: 574 [2024-10-31 21:59:50,371 INFO L226 Difference]: Without dead ends: 574 [2024-10-31 21:59:50,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:59:50,373 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 169 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:50,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1209 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 21:59:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-31 21:59:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 511. [2024-10-31 21:59:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 439 states have (on average 1.501138952164009) internal successors, (659), 486 states have internal predecessors, (659), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2024-10-31 21:59:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 701 transitions. [2024-10-31 21:59:50,386 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 701 transitions. Word has length 27 [2024-10-31 21:59:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:50,386 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 701 transitions. [2024-10-31 21:59:50,387 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 701 transitions. [2024-10-31 21:59:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 21:59:50,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:50,387 INFO L215 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-10-31 21:59:50,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-31 21:59:50,388 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:50,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1188894914, now seen corresponding path program 1 times [2024-10-31 21:59:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:50,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206513242] [2024-10-31 21:59:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:50,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:50,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:50,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206513242] [2024-10-31 21:59:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206513242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:50,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:59:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213130170] [2024-10-31 21:59:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:50,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:50,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:50,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:50,548 INFO L87 Difference]: Start difference. First operand 511 states and 701 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:50,816 INFO L93 Difference]: Finished difference Result 528 states and 714 transitions. [2024-10-31 21:59:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:59:50,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-31 21:59:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:50,819 INFO L225 Difference]: With dead ends: 528 [2024-10-31 21:59:50,819 INFO L226 Difference]: Without dead ends: 528 [2024-10-31 21:59:50,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:59:50,820 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 149 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:50,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 694 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-31 21:59:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 520. [2024-10-31 21:59:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 449 states have (on average 1.487750556792873) internal successors, (668), 495 states have internal predecessors, (668), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2024-10-31 21:59:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 710 transitions. [2024-10-31 21:59:50,843 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 710 transitions. Word has length 28 [2024-10-31 21:59:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:50,844 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 710 transitions. [2024-10-31 21:59:50,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 710 transitions. [2024-10-31 21:59:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 21:59:50,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:50,846 INFO L215 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-10-31 21:59:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-31 21:59:50,847 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1320441736, now seen corresponding path program 1 times [2024-10-31 21:59:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:50,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784865192] [2024-10-31 21:59:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:51,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784865192] [2024-10-31 21:59:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784865192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:51,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022128152] [2024-10-31 21:59:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:51,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:51,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:51,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:51,113 INFO L87 Difference]: Start difference. First operand 520 states and 710 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:51,354 INFO L93 Difference]: Finished difference Result 519 states and 690 transitions. [2024-10-31 21:59:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:51,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-31 21:59:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:51,357 INFO L225 Difference]: With dead ends: 519 [2024-10-31 21:59:51,357 INFO L226 Difference]: Without dead ends: 519 [2024-10-31 21:59:51,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:59:51,358 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 192 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:51,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 242 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-10-31 21:59:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 481. [2024-10-31 21:59:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 417 states have (on average 1.434052757793765) internal successors, (598), 456 states have internal predecessors, (598), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2024-10-31 21:59:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 640 transitions. [2024-10-31 21:59:51,375 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 640 transitions. Word has length 29 [2024-10-31 21:59:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:51,376 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 640 transitions. [2024-10-31 21:59:51,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 640 transitions. [2024-10-31 21:59:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-31 21:59:51,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:51,377 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:51,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-31 21:59:51,377 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:51,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1684807341, now seen corresponding path program 1 times [2024-10-31 21:59:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984861667] [2024-10-31 21:59:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:51,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 21:59:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 21:59:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:51,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984861667] [2024-10-31 21:59:51,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984861667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:59:51,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833214581] [2024-10-31 21:59:51,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:51,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:51,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:51,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:59:51,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:59:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:51,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-31 21:59:51,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:59:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:52,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:59:52,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 21:59:52,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-10-31 21:59:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 21:59:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833214581] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:59:52,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:59:52,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2024-10-31 21:59:52,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247137644] [2024-10-31 21:59:52,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:59:52,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-31 21:59:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:52,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-31 21:59:52,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-31 21:59:52,862 INFO L87 Difference]: Start difference. First operand 481 states and 640 transitions. Second operand has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-31 21:59:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:53,330 INFO L93 Difference]: Finished difference Result 508 states and 664 transitions. [2024-10-31 21:59:53,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 21:59:53,330 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-10-31 21:59:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:53,332 INFO L225 Difference]: With dead ends: 508 [2024-10-31 21:59:53,333 INFO L226 Difference]: Without dead ends: 508 [2024-10-31 21:59:53,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-10-31 21:59:53,334 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 672 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:53,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 568 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-31 21:59:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 379. [2024-10-31 21:59:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 324 states have (on average 1.3919753086419753) internal successors, (451), 360 states have internal predecessors, (451), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 481 transitions. [2024-10-31 21:59:53,344 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 481 transitions. Word has length 40 [2024-10-31 21:59:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:53,345 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 481 transitions. [2024-10-31 21:59:53,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-31 21:59:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 481 transitions. [2024-10-31 21:59:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-31 21:59:53,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:53,346 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:53,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 21:59:53,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-31 21:59:53,550 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:53,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1517564365, now seen corresponding path program 1 times [2024-10-31 21:59:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:53,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035715351] [2024-10-31 21:59:53,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:53,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:53,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035715351] [2024-10-31 21:59:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035715351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:59:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191282270] [2024-10-31 21:59:53,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:53,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:53,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:53,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:59:53,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 21:59:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-31 21:59:54,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:59:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:54,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:59:54,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191282270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:54,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 21:59:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2024-10-31 21:59:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160294175] [2024-10-31 21:59:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:54,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-10-31 21:59:54,482 INFO L87 Difference]: Start difference. First operand 379 states and 481 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:54,653 INFO L93 Difference]: Finished difference Result 386 states and 488 transitions. [2024-10-31 21:59:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-10-31 21:59:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:54,655 INFO L225 Difference]: With dead ends: 386 [2024-10-31 21:59:54,656 INFO L226 Difference]: Without dead ends: 386 [2024-10-31 21:59:54,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-10-31 21:59:54,657 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 157 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:54,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 242 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-31 21:59:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2024-10-31 21:59:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 326 states have (on average 1.392638036809816) internal successors, (454), 362 states have internal predecessors, (454), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 484 transitions. [2024-10-31 21:59:54,671 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 484 transitions. Word has length 40 [2024-10-31 21:59:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:54,671 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 484 transitions. [2024-10-31 21:59:54,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:54,672 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 484 transitions. [2024-10-31 21:59:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-31 21:59:54,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:54,673 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:54,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 21:59:54,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-31 21:59:54,877 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:54,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1517564303, now seen corresponding path program 1 times [2024-10-31 21:59:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698720250] [2024-10-31 21:59:54,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:54,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698720250] [2024-10-31 21:59:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698720250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:59:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153413831] [2024-10-31 21:59:55,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:55,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:55,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:55,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:59:55,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 21:59:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-31 21:59:55,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:59:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:55,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:59:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153413831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:55,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 21:59:55,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2024-10-31 21:59:55,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958253374] [2024-10-31 21:59:55,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:55,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:55,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:55,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:55,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:59:55,635 INFO L87 Difference]: Start difference. First operand 381 states and 484 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:55,835 INFO L93 Difference]: Finished difference Result 385 states and 486 transitions. [2024-10-31 21:59:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:55,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-10-31 21:59:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:55,837 INFO L225 Difference]: With dead ends: 385 [2024-10-31 21:59:55,837 INFO L226 Difference]: Without dead ends: 385 [2024-10-31 21:59:55,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-31 21:59:55,838 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 227 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:55,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 311 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-31 21:59:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 378. [2024-10-31 21:59:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 324 states have (on average 1.3858024691358024) internal successors, (449), 359 states have internal predecessors, (449), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 479 transitions. [2024-10-31 21:59:55,858 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 479 transitions. Word has length 40 [2024-10-31 21:59:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:55,858 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 479 transitions. [2024-10-31 21:59:55,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 479 transitions. [2024-10-31 21:59:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-31 21:59:55,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:55,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:55,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-31 21:59:56,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:56,064 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:56,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:56,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1078522670, now seen corresponding path program 1 times [2024-10-31 21:59:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:56,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431957190] [2024-10-31 21:59:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:59:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 21:59:56,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:56,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431957190] [2024-10-31 21:59:56,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431957190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:56,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:56,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:56,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275602714] [2024-10-31 21:59:56,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:56,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:56,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:56,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:56,325 INFO L87 Difference]: Start difference. First operand 378 states and 479 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 21:59:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:56,512 INFO L93 Difference]: Finished difference Result 380 states and 475 transitions. [2024-10-31 21:59:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:56,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-10-31 21:59:56,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:56,514 INFO L225 Difference]: With dead ends: 380 [2024-10-31 21:59:56,515 INFO L226 Difference]: Without dead ends: 380 [2024-10-31 21:59:56,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:56,515 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 141 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:56,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 248 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-31 21:59:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2024-10-31 21:59:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 324 states have (on average 1.3611111111111112) internal successors, (441), 357 states have internal predecessors, (441), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 471 transitions. [2024-10-31 21:59:56,525 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 471 transitions. Word has length 42 [2024-10-31 21:59:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:56,526 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 471 transitions. [2024-10-31 21:59:56,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 21:59:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 471 transitions. [2024-10-31 21:59:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-31 21:59:56,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:56,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:56,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-31 21:59:56,527 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:56,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash -934084823, now seen corresponding path program 1 times [2024-10-31 21:59:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053155564] [2024-10-31 21:59:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053155564] [2024-10-31 21:59:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053155564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:57,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:57,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-31 21:59:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014047265] [2024-10-31 21:59:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:57,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-31 21:59:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-31 21:59:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-31 21:59:57,685 INFO L87 Difference]: Start difference. First operand 376 states and 471 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:58,396 INFO L93 Difference]: Finished difference Result 394 states and 491 transitions. [2024-10-31 21:59:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 21:59:58,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2024-10-31 21:59:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:58,398 INFO L225 Difference]: With dead ends: 394 [2024-10-31 21:59:58,398 INFO L226 Difference]: Without dead ends: 394 [2024-10-31 21:59:58,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2024-10-31 21:59:58,400 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:58,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 903 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 21:59:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-31 21:59:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 390. [2024-10-31 21:59:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 338 states have (on average 1.3520710059171597) internal successors, (457), 371 states have internal predecessors, (457), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 487 transitions. [2024-10-31 21:59:58,415 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 487 transitions. Word has length 43 [2024-10-31 21:59:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:58,416 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 487 transitions. [2024-10-31 21:59:58,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 487 transitions. [2024-10-31 21:59:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-31 21:59:58,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:58,417 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:58,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-31 21:59:58,418 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:58,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1138243033, now seen corresponding path program 1 times [2024-10-31 21:59:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:58,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542545301] [2024-10-31 21:59:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:58,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:58,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:59:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:58,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:58,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542545301] [2024-10-31 21:59:58,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542545301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:58,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:58,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 21:59:58,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535943273] [2024-10-31 21:59:58,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:58,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 21:59:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:58,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 21:59:58,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:59:58,993 INFO L87 Difference]: Start difference. First operand 390 states and 487 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:59,386 INFO L93 Difference]: Finished difference Result 405 states and 500 transitions. [2024-10-31 21:59:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 21:59:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-31 21:59:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:59,389 INFO L225 Difference]: With dead ends: 405 [2024-10-31 21:59:59,389 INFO L226 Difference]: Without dead ends: 405 [2024-10-31 21:59:59,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-31 21:59:59,390 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 146 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:59,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 761 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-31 21:59:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 394. [2024-10-31 21:59:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 342 states have (on average 1.345029239766082) internal successors, (460), 375 states have internal predecessors, (460), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:59:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 490 transitions. [2024-10-31 21:59:59,403 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 490 transitions. Word has length 44 [2024-10-31 21:59:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:59,404 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 490 transitions. [2024-10-31 21:59:59,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:59:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 490 transitions. [2024-10-31 21:59:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-31 21:59:59,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:59,405 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:59,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-31 21:59:59,406 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-31 21:59:59,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:59,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1516678113, now seen corresponding path program 1 times [2024-10-31 21:59:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821355400] [2024-10-31 21:59:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 22:00:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:00:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821355400] [2024-10-31 22:00:00,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821355400] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:00:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284285095] [2024-10-31 22:00:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:00,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:00:00,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:00:00,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:00:00,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02549dc6-0e6f-4eba-a589-b78d1d6bfe73/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-31 22:00:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:00,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-31 22:00:00,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:00:01,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-31 22:00:01,517 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-10-31 22:00:01,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2024-10-31 22:00:01,540 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-10-31 22:00:01,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30