./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:54:52,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:54:52,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:54:52,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:54:52,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:54:52,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:54:52,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:54:52,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:54:52,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:54:52,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:54:52,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:54:52,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:54:52,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:54:52,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:54:52,427 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:54:52,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:54:52,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:54:52,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:54:52,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:54:52,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:54:52,429 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:54:52,429 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:54:52,430 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:54:52,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:54:52,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:54:52,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:54:52,431 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:54:52,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:54:52,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:54:52,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:54:52,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:54:52,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:54:52,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:54:52,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:54:52,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:54:52,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:54:52,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:54:52,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:54:52,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:54:52,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:54:52,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:54:52,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:54:52,435 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2024-11-19 06:54:52,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:54:52,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:54:52,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:54:52,742 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:54:52,742 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:54:52,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2024-11-19 06:54:54,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:54:54,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:54:54,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2024-11-19 06:54:54,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e943a9648/5f3fd5540bec4b01b4413088c9c992ec/FLAGd6a86c8a4 [2024-11-19 06:54:54,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e943a9648/5f3fd5540bec4b01b4413088c9c992ec [2024-11-19 06:54:54,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:54:54,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:54:54,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:54:54,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:54:54,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:54:54,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb231b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:54, skipping insertion in model container [2024-11-19 06:54:54,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:54:54" (1/1) ... [2024-11-19 06:54:54,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:54:55,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:54:55,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:54:55,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:54:55,387 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:54:55,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55 WrapperNode [2024-11-19 06:54:55,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:54:55,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:54:55,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:54:55,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:54:55,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,445 INFO L138 Inliner]: procedures = 125, calls = 84, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 302 [2024-11-19 06:54:55,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:54:55,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:54:55,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:54:55,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:54:55,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,504 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 3, 10, 34]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 2, 3, 8]. [2024-11-19 06:54:55,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:54:55,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:54:55,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:54:55,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:54:55,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (1/1) ... [2024-11-19 06:54:55,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:54:55,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:55,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:54:55,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:54:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:54:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:54:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 06:54:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 06:54:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2024-11-19 06:54:55,623 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2024-11-19 06:54:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-19 06:54:55,623 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-19 06:54:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:54:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:54:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 06:54:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 06:54:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:54:55,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:54:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:54:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:54:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:54:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:54:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 06:54:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:54:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:54:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:54:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 06:54:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:54:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:54:55,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:54:55,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:54:55,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 06:54:55,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:54:55,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:54:55,770 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:54:55,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:54:56,423 INFO L? ?]: Removed 241 outVars from TransFormulas that were not future-live. [2024-11-19 06:54:56,423 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:54:56,449 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:54:56,450 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-19 06:54:56,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:54:56 BoogieIcfgContainer [2024-11-19 06:54:56,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:54:56,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:54:56,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:54:56,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:54:56,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:54:54" (1/3) ... [2024-11-19 06:54:56,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45aff311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:54:56, skipping insertion in model container [2024-11-19 06:54:56,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:55" (2/3) ... [2024-11-19 06:54:56,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45aff311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:54:56, skipping insertion in model container [2024-11-19 06:54:56,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:54:56" (3/3) ... [2024-11-19 06:54:56,460 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2024-11-19 06:54:56,478 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:54:56,478 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2024-11-19 06:54:56,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:54:56,534 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;@222f6ab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:54:56,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2024-11-19 06:54:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 265 states, 142 states have (on average 2.176056338028169) internal successors, (309), 262 states have internal predecessors, (309), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 06:54:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:54:56,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:56,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:54:56,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:56,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash 64039330, now seen corresponding path program 1 times [2024-11-19 06:54:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:56,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964446304] [2024-11-19 06:54:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:56,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:56,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964446304] [2024-11-19 06:54:56,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964446304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:56,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:56,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:56,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12008414] [2024-11-19 06:54:56,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:56,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:54:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:56,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:54:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:54:56,850 INFO L87 Difference]: Start difference. First operand has 265 states, 142 states have (on average 2.176056338028169) internal successors, (309), 262 states have internal predecessors, (309), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:56,895 INFO L93 Difference]: Finished difference Result 262 states and 287 transitions. [2024-11-19 06:54:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:54:56,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 06:54:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:56,907 INFO L225 Difference]: With dead ends: 262 [2024-11-19 06:54:56,907 INFO L226 Difference]: Without dead ends: 260 [2024-11-19 06:54:56,909 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-11-19 06:54:56,912 INFO L432 NwaCegarLoop]: 287 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, 287 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:56,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:54:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-19 06:54:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-19 06:54:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 139 states have (on average 1.9280575539568345) internal successors, (268), 257 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2024-11-19 06:54:56,970 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 5 [2024-11-19 06:54:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:56,970 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2024-11-19 06:54:56,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2024-11-19 06:54:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:54:56,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:56,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:54:56,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:54:56,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:56,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1984159211, now seen corresponding path program 1 times [2024-11-19 06:54:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663135982] [2024-11-19 06:54:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:57,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:57,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663135982] [2024-11-19 06:54:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663135982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217395495] [2024-11-19 06:54:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:57,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:57,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:57,121 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:57,379 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2024-11-19 06:54:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:57,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 06:54:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:57,384 INFO L225 Difference]: With dead ends: 258 [2024-11-19 06:54:57,384 INFO L226 Difference]: Without dead ends: 258 [2024-11-19 06:54:57,385 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-11-19 06:54:57,386 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 6 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:57,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 444 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:54:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-19 06:54:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-19 06:54:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 139 states have (on average 1.9136690647482015) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 283 transitions. [2024-11-19 06:54:57,420 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 283 transitions. Word has length 6 [2024-11-19 06:54:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:57,421 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 283 transitions. [2024-11-19 06:54:57,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2024-11-19 06:54:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:54:57,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:57,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:54:57,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:54:57,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:57,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1984159212, now seen corresponding path program 1 times [2024-11-19 06:54:57,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:57,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934996970] [2024-11-19 06:54:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:57,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:57,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934996970] [2024-11-19 06:54:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934996970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:57,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:57,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728724347] [2024-11-19 06:54:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:57,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:57,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:57,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:57,536 INFO L87 Difference]: Start difference. First operand 258 states and 283 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:57,686 INFO L93 Difference]: Finished difference Result 256 states and 281 transitions. [2024-11-19 06:54:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 06:54:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:57,689 INFO L225 Difference]: With dead ends: 256 [2024-11-19 06:54:57,689 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 06:54:57,689 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-11-19 06:54:57,690 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:57,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 452 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 06:54:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-19 06:54:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2024-11-19 06:54:57,713 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 6 [2024-11-19 06:54:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:57,713 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2024-11-19 06:54:57,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2024-11-19 06:54:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:54:57,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:57,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:54:57,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:54:57,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:57,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1984158653, now seen corresponding path program 1 times [2024-11-19 06:54:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411390119] [2024-11-19 06:54:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411390119] [2024-11-19 06:54:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411390119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:57,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:57,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475263824] [2024-11-19 06:54:57,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:57,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:57,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:57,742 INFO L87 Difference]: Start difference. First operand 256 states and 281 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:57,953 INFO L93 Difference]: Finished difference Result 389 states and 433 transitions. [2024-11-19 06:54:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:57,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 06:54:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:57,955 INFO L225 Difference]: With dead ends: 389 [2024-11-19 06:54:57,956 INFO L226 Difference]: Without dead ends: 388 [2024-11-19 06:54:57,956 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-11-19 06:54:57,957 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 133 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:57,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 394 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:54:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-19 06:54:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 259. [2024-11-19 06:54:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 142 states have (on average 1.8873239436619718) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 285 transitions. [2024-11-19 06:54:57,977 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 285 transitions. Word has length 6 [2024-11-19 06:54:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:57,977 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 285 transitions. [2024-11-19 06:54:57,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 285 transitions. [2024-11-19 06:54:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:54:57,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:57,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:57,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:54:57,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -189393257, now seen corresponding path program 1 times [2024-11-19 06:54:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182546472] [2024-11-19 06:54:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:58,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:58,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182546472] [2024-11-19 06:54:58,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182546472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:58,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:58,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:54:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386625623] [2024-11-19 06:54:58,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:58,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:58,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:58,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:58,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:58,045 INFO L87 Difference]: Start difference. First operand 259 states and 285 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:58,107 INFO L93 Difference]: Finished difference Result 271 states and 296 transitions. [2024-11-19 06:54:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:58,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:54:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:58,109 INFO L225 Difference]: With dead ends: 271 [2024-11-19 06:54:58,109 INFO L226 Difference]: Without dead ends: 270 [2024-11-19 06:54:58,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:58,110 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 12 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:58,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 541 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-19 06:54:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 258. [2024-11-19 06:54:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 141 states have (on average 1.8865248226950355) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 283 transitions. [2024-11-19 06:54:58,118 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 283 transitions. Word has length 8 [2024-11-19 06:54:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:58,118 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 283 transitions. [2024-11-19 06:54:58,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2024-11-19 06:54:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:54:58,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:58,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:58,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:54:58,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:58,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:58,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1387795881, now seen corresponding path program 1 times [2024-11-19 06:54:58,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:58,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367375988] [2024-11-19 06:54:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:58,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:58,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:58,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367375988] [2024-11-19 06:54:58,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367375988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:58,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:58,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:58,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453143376] [2024-11-19 06:54:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:58,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:58,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:58,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:58,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:58,228 INFO L87 Difference]: Start difference. First operand 258 states and 283 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-11-19 06:54:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:58,372 INFO L93 Difference]: Finished difference Result 256 states and 281 transitions. [2024-11-19 06:54:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:58,372 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-11-19 06:54:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:58,374 INFO L225 Difference]: With dead ends: 256 [2024-11-19 06:54:58,374 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 06:54:58,374 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-11-19 06:54:58,375 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 2 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:58,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 443 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 06:54:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-19 06:54:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 141 states have (on average 1.872340425531915) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2024-11-19 06:54:58,387 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 11 [2024-11-19 06:54:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:58,387 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2024-11-19 06:54:58,387 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-11-19 06:54:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2024-11-19 06:54:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:54:58,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:58,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:58,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:54:58,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:58,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1387795880, now seen corresponding path program 1 times [2024-11-19 06:54:58,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:58,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705204128] [2024-11-19 06:54:58,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:58,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705204128] [2024-11-19 06:54:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705204128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:58,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081305784] [2024-11-19 06:54:58,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:58,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:58,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:58,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:58,504 INFO L87 Difference]: Start difference. First operand 256 states and 281 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-11-19 06:54:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:58,633 INFO L93 Difference]: Finished difference Result 254 states and 279 transitions. [2024-11-19 06:54:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:58,634 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-11-19 06:54:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:58,635 INFO L225 Difference]: With dead ends: 254 [2024-11-19 06:54:58,635 INFO L226 Difference]: Without dead ends: 254 [2024-11-19 06:54:58,636 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-11-19 06:54:58,636 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 2 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:58,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 451 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-19 06:54:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-19 06:54:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 141 states have (on average 1.8581560283687943) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2024-11-19 06:54:58,643 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 11 [2024-11-19 06:54:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:58,644 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2024-11-19 06:54:58,644 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-11-19 06:54:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2024-11-19 06:54:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:54:58,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:58,645 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:58,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:54:58,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:58,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash 341691987, now seen corresponding path program 1 times [2024-11-19 06:54:58,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:58,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883995920] [2024-11-19 06:54:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:58,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:58,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883995920] [2024-11-19 06:54:58,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883995920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:58,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:58,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:54:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739071079] [2024-11-19 06:54:58,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:58,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:54:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:58,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:54:58,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:54:58,718 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:58,782 INFO L93 Difference]: Finished difference Result 306 states and 342 transitions. [2024-11-19 06:54:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:54:58,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 06:54:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:58,785 INFO L225 Difference]: With dead ends: 306 [2024-11-19 06:54:58,786 INFO L226 Difference]: Without dead ends: 306 [2024-11-19 06:54:58,786 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-11-19 06:54:58,786 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 114 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:58,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 724 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:54:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-19 06:54:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 254. [2024-11-19 06:54:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 141 states have (on average 1.851063829787234) internal successors, (261), 251 states have internal predecessors, (261), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 278 transitions. [2024-11-19 06:54:58,795 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 278 transitions. Word has length 17 [2024-11-19 06:54:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:58,795 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 278 transitions. [2024-11-19 06:54:58,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 278 transitions. [2024-11-19 06:54:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:54:58,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:58,796 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:58,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:54:58,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:58,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1948105645, now seen corresponding path program 1 times [2024-11-19 06:54:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:58,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280252689] [2024-11-19 06:54:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:58,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280252689] [2024-11-19 06:54:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280252689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:58,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:58,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:54:58,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949690538] [2024-11-19 06:54:58,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:58,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:54:58,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:58,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:54:58,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:58,904 INFO L87 Difference]: Start difference. First operand 254 states and 278 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:59,217 INFO L93 Difference]: Finished difference Result 255 states and 281 transitions. [2024-11-19 06:54:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:54:59,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 06:54:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:59,219 INFO L225 Difference]: With dead ends: 255 [2024-11-19 06:54:59,220 INFO L226 Difference]: Without dead ends: 255 [2024-11-19 06:54:59,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:54:59,220 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 148 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:59,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 544 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:54:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-19 06:54:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2024-11-19 06:54:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 244 states have internal predecessors, (256), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 273 transitions. [2024-11-19 06:54:59,227 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 273 transitions. Word has length 19 [2024-11-19 06:54:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:59,228 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 273 transitions. [2024-11-19 06:54:59,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 273 transitions. [2024-11-19 06:54:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:54:59,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:59,229 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:59,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:54:59,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:59,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:59,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1948105646, now seen corresponding path program 1 times [2024-11-19 06:54:59,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:59,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035041688] [2024-11-19 06:54:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:59,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035041688] [2024-11-19 06:54:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035041688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:59,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:59,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:54:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217861843] [2024-11-19 06:54:59,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:59,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:54:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:59,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:54:59,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:59,430 INFO L87 Difference]: Start difference. First operand 247 states and 273 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:59,794 INFO L93 Difference]: Finished difference Result 334 states and 373 transitions. [2024-11-19 06:54:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:54:59,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 06:54:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:59,796 INFO L225 Difference]: With dead ends: 334 [2024-11-19 06:54:59,796 INFO L226 Difference]: Without dead ends: 334 [2024-11-19 06:54:59,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:54:59,797 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 183 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:59,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 625 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:54:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-19 06:54:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 294. [2024-11-19 06:54:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 190 states have (on average 1.731578947368421) internal successors, (329), 291 states have internal predecessors, (329), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 346 transitions. [2024-11-19 06:54:59,806 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 346 transitions. Word has length 19 [2024-11-19 06:54:59,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:59,806 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 346 transitions. [2024-11-19 06:54:59,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 346 transitions. [2024-11-19 06:54:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:54:59,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:59,807 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:59,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:54:59,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:54:59,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash -465387631, now seen corresponding path program 1 times [2024-11-19 06:54:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558073660] [2024-11-19 06:54:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:59,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:59,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558073660] [2024-11-19 06:54:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558073660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:59,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:54:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19676643] [2024-11-19 06:54:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:59,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:54:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:54:59,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:59,893 INFO L87 Difference]: Start difference. First operand 294 states and 346 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:59,988 INFO L93 Difference]: Finished difference Result 323 states and 359 transitions. [2024-11-19 06:54:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:54:59,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 06:54:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:59,990 INFO L225 Difference]: With dead ends: 323 [2024-11-19 06:54:59,990 INFO L226 Difference]: Without dead ends: 323 [2024-11-19 06:54:59,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:54:59,992 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 181 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:59,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 905 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-19 06:54:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 293. [2024-11-19 06:54:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 190 states have (on average 1.7157894736842105) internal successors, (326), 290 states have internal predecessors, (326), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:54:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 342 transitions. [2024-11-19 06:55:00,000 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 342 transitions. Word has length 21 [2024-11-19 06:55:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:00,001 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 342 transitions. [2024-11-19 06:55:00,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 342 transitions. [2024-11-19 06:55:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:55:00,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:00,004 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:00,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:55:00,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:00,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1687564333, now seen corresponding path program 1 times [2024-11-19 06:55:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:00,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774004921] [2024-11-19 06:55:00,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:00,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:00,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:00,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774004921] [2024-11-19 06:55:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774004921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:00,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:00,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:55:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424938522] [2024-11-19 06:55:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:00,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:55:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:00,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:55:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:55:00,122 INFO L87 Difference]: Start difference. First operand 293 states and 342 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:00,242 INFO L93 Difference]: Finished difference Result 292 states and 339 transitions. [2024-11-19 06:55:00,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:55:00,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 06:55:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:00,243 INFO L225 Difference]: With dead ends: 292 [2024-11-19 06:55:00,243 INFO L226 Difference]: Without dead ends: 292 [2024-11-19 06:55:00,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:55:00,244 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 15 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:00,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 906 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:55:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-19 06:55:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-19 06:55:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 190 states have (on average 1.7052631578947368) internal successors, (324), 289 states have internal predecessors, (324), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 339 transitions. [2024-11-19 06:55:00,254 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 339 transitions. Word has length 28 [2024-11-19 06:55:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:00,255 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 339 transitions. [2024-11-19 06:55:00,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 339 transitions. [2024-11-19 06:55:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:55:00,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:00,256 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:55:00,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash 641781367, now seen corresponding path program 1 times [2024-11-19 06:55:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739613406] [2024-11-19 06:55:00,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:00,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:00,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739613406] [2024-11-19 06:55:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739613406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:00,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:00,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:55:00,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55656652] [2024-11-19 06:55:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:00,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:55:00,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:55:00,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:55:00,366 INFO L87 Difference]: Start difference. First operand 292 states and 339 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:00,506 INFO L93 Difference]: Finished difference Result 291 states and 336 transitions. [2024-11-19 06:55:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:55:00,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 06:55:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:00,508 INFO L225 Difference]: With dead ends: 291 [2024-11-19 06:55:00,508 INFO L226 Difference]: Without dead ends: 291 [2024-11-19 06:55:00,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:55:00,509 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 15 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:00,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 894 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:55:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-19 06:55:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-19 06:55:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 190 states have (on average 1.694736842105263) internal successors, (322), 288 states have internal predecessors, (322), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 336 transitions. [2024-11-19 06:55:00,517 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 336 transitions. Word has length 28 [2024-11-19 06:55:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:00,517 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 336 transitions. [2024-11-19 06:55:00,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 336 transitions. [2024-11-19 06:55:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:55:00,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:00,518 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:00,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:55:00,518 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:00,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash -89400164, now seen corresponding path program 1 times [2024-11-19 06:55:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:00,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073653211] [2024-11-19 06:55:00,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:00,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:00,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:00,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073653211] [2024-11-19 06:55:00,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073653211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:00,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:00,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:55:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816715513] [2024-11-19 06:55:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:00,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:55:00,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:00,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:55:00,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:55:00,934 INFO L87 Difference]: Start difference. First operand 291 states and 336 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:01,463 INFO L93 Difference]: Finished difference Result 320 states and 352 transitions. [2024-11-19 06:55:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:55:01,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 06:55:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:01,465 INFO L225 Difference]: With dead ends: 320 [2024-11-19 06:55:01,465 INFO L226 Difference]: Without dead ends: 320 [2024-11-19 06:55:01,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:55:01,466 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 155 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:01,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1025 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:55:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-19 06:55:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 292. [2024-11-19 06:55:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 191 states have (on average 1.6963350785340314) internal successors, (324), 289 states have internal predecessors, (324), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 338 transitions. [2024-11-19 06:55:01,476 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 338 transitions. Word has length 30 [2024-11-19 06:55:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:01,477 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 338 transitions. [2024-11-19 06:55:01,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 338 transitions. [2024-11-19 06:55:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:55:01,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:01,478 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:55:01,478 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:01,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -89400163, now seen corresponding path program 1 times [2024-11-19 06:55:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035527184] [2024-11-19 06:55:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:01,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:01,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035527184] [2024-11-19 06:55:01,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035527184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:01,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:01,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:55:01,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956027081] [2024-11-19 06:55:01,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:01,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:55:01,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:01,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:55:01,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:55:01,855 INFO L87 Difference]: Start difference. First operand 292 states and 338 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:02,350 INFO L93 Difference]: Finished difference Result 319 states and 351 transitions. [2024-11-19 06:55:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:55:02,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 06:55:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:02,352 INFO L225 Difference]: With dead ends: 319 [2024-11-19 06:55:02,352 INFO L226 Difference]: Without dead ends: 319 [2024-11-19 06:55:02,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:55:02,353 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 154 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:02,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 894 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:55:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-19 06:55:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 292. [2024-11-19 06:55:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 191 states have (on average 1.6910994764397906) internal successors, (323), 289 states have internal predecessors, (323), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 337 transitions. [2024-11-19 06:55:02,359 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 337 transitions. Word has length 30 [2024-11-19 06:55:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:02,359 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 337 transitions. [2024-11-19 06:55:02,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 337 transitions. [2024-11-19 06:55:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:55:02,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:02,364 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:02,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:55:02,364 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1530249595, now seen corresponding path program 1 times [2024-11-19 06:55:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040771723] [2024-11-19 06:55:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:02,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040771723] [2024-11-19 06:55:02,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040771723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:02,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:02,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:55:02,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523545914] [2024-11-19 06:55:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:02,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:55:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:02,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:55:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:55:02,517 INFO L87 Difference]: Start difference. First operand 292 states and 337 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:02,733 INFO L93 Difference]: Finished difference Result 318 states and 349 transitions. [2024-11-19 06:55:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:55:02,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 06:55:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:02,735 INFO L225 Difference]: With dead ends: 318 [2024-11-19 06:55:02,735 INFO L226 Difference]: Without dead ends: 318 [2024-11-19 06:55:02,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:55:02,736 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 154 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:02,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1253 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:55:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-19 06:55:02,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 292. [2024-11-19 06:55:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 191 states have (on average 1.6858638743455496) internal successors, (322), 289 states have internal predecessors, (322), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 336 transitions. [2024-11-19 06:55:02,743 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 336 transitions. Word has length 31 [2024-11-19 06:55:02,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:02,743 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 336 transitions. [2024-11-19 06:55:02,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 336 transitions. [2024-11-19 06:55:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:55:02,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:02,744 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:02,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:55:02,744 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:02,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2006265230, now seen corresponding path program 1 times [2024-11-19 06:55:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:02,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232176443] [2024-11-19 06:55:02,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:02,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:02,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:02,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232176443] [2024-11-19 06:55:02,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232176443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:02,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:02,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:55:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249796573] [2024-11-19 06:55:02,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:02,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:55:02,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:02,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:55:02,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:55:02,923 INFO L87 Difference]: Start difference. First operand 292 states and 336 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:03,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:03,136 INFO L93 Difference]: Finished difference Result 317 states and 347 transitions. [2024-11-19 06:55:03,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:55:03,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 06:55:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:03,139 INFO L225 Difference]: With dead ends: 317 [2024-11-19 06:55:03,139 INFO L226 Difference]: Without dead ends: 317 [2024-11-19 06:55:03,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:55:03,140 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 152 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:03,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1253 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:55:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-19 06:55:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 292. [2024-11-19 06:55:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 191 states have (on average 1.6806282722513088) internal successors, (321), 289 states have internal predecessors, (321), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 335 transitions. [2024-11-19 06:55:03,147 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 335 transitions. Word has length 31 [2024-11-19 06:55:03,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:03,147 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 335 transitions. [2024-11-19 06:55:03,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:03,148 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 335 transitions. [2024-11-19 06:55:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:55:03,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:03,148 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:03,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:55:03,149 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:03,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2004090430, now seen corresponding path program 1 times [2024-11-19 06:55:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:03,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772838481] [2024-11-19 06:55:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:03,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772838481] [2024-11-19 06:55:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772838481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:03,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:03,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:55:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549117613] [2024-11-19 06:55:03,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:03,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:55:03,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:55:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:55:03,381 INFO L87 Difference]: Start difference. First operand 292 states and 335 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:03,902 INFO L93 Difference]: Finished difference Result 316 states and 346 transitions. [2024-11-19 06:55:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:55:03,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 06:55:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:03,904 INFO L225 Difference]: With dead ends: 316 [2024-11-19 06:55:03,904 INFO L226 Difference]: Without dead ends: 316 [2024-11-19 06:55:03,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:55:03,906 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 149 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:03,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1025 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:55:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-19 06:55:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 292. [2024-11-19 06:55:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 191 states have (on average 1.675392670157068) internal successors, (320), 289 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 334 transitions. [2024-11-19 06:55:03,913 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 334 transitions. Word has length 30 [2024-11-19 06:55:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:03,913 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 334 transitions. [2024-11-19 06:55:03,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 334 transitions. [2024-11-19 06:55:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:55:03,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:03,914 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:03,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:55:03,915 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:03,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2004090431, now seen corresponding path program 1 times [2024-11-19 06:55:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54054393] [2024-11-19 06:55:03,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:04,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:04,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54054393] [2024-11-19 06:55:04,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54054393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:04,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:04,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:55:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355810287] [2024-11-19 06:55:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:04,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:55:04,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:04,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:55:04,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:55:04,283 INFO L87 Difference]: Start difference. First operand 292 states and 334 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:04,772 INFO L93 Difference]: Finished difference Result 315 states and 345 transitions. [2024-11-19 06:55:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:55:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 06:55:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:04,774 INFO L225 Difference]: With dead ends: 315 [2024-11-19 06:55:04,774 INFO L226 Difference]: Without dead ends: 315 [2024-11-19 06:55:04,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:55:04,775 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 146 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:04,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 894 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:55:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-19 06:55:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 292. [2024-11-19 06:55:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 191 states have (on average 1.6701570680628273) internal successors, (319), 289 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 333 transitions. [2024-11-19 06:55:04,781 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 333 transitions. Word has length 30 [2024-11-19 06:55:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:04,781 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 333 transitions. [2024-11-19 06:55:04,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2024-11-19 06:55:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:55:04,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:04,782 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:04,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:55:04,782 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:04,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2050037000, now seen corresponding path program 1 times [2024-11-19 06:55:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:04,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144191027] [2024-11-19 06:55:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:05,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144191027] [2024-11-19 06:55:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144191027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:05,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:05,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:55:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874570898] [2024-11-19 06:55:05,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:05,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:55:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:55:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:55:05,245 INFO L87 Difference]: Start difference. First operand 292 states and 333 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:05,680 INFO L93 Difference]: Finished difference Result 314 states and 343 transitions. [2024-11-19 06:55:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:55:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 06:55:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:05,682 INFO L225 Difference]: With dead ends: 314 [2024-11-19 06:55:05,683 INFO L226 Difference]: Without dead ends: 314 [2024-11-19 06:55:05,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:55:05,683 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 144 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:05,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1588 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:55:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-19 06:55:05,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 293. [2024-11-19 06:55:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 192 states have (on average 1.6666666666666667) internal successors, (320), 290 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 334 transitions. [2024-11-19 06:55:05,690 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 334 transitions. Word has length 35 [2024-11-19 06:55:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:05,690 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 334 transitions. [2024-11-19 06:55:05,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 334 transitions. [2024-11-19 06:55:05,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:55:05,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:05,691 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:05,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 06:55:05,691 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:05,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:05,692 INFO L85 PathProgramCache]: Analyzing trace with hash 439445211, now seen corresponding path program 1 times [2024-11-19 06:55:05,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:05,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519251928] [2024-11-19 06:55:05,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:06,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:06,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519251928] [2024-11-19 06:55:06,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519251928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:06,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:55:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475657189] [2024-11-19 06:55:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:06,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:55:06,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:55:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:55:06,111 INFO L87 Difference]: Start difference. First operand 293 states and 334 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:06,543 INFO L93 Difference]: Finished difference Result 313 states and 341 transitions. [2024-11-19 06:55:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:55:06,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 06:55:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:06,545 INFO L225 Difference]: With dead ends: 313 [2024-11-19 06:55:06,545 INFO L226 Difference]: Without dead ends: 313 [2024-11-19 06:55:06,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:55:06,546 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 142 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:06,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1798 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:55:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-19 06:55:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 293. [2024-11-19 06:55:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 192 states have (on average 1.6614583333333333) internal successors, (319), 290 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 333 transitions. [2024-11-19 06:55:06,553 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 333 transitions. Word has length 35 [2024-11-19 06:55:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:06,553 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 333 transitions. [2024-11-19 06:55:06,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 333 transitions. [2024-11-19 06:55:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:55:06,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:06,554 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:06,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:55:06,555 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:06,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:06,555 INFO L85 PathProgramCache]: Analyzing trace with hash 431056901, now seen corresponding path program 1 times [2024-11-19 06:55:06,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:06,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948837725] [2024-11-19 06:55:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:06,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:06,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948837725] [2024-11-19 06:55:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948837725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834902852] [2024-11-19 06:55:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:06,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:06,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:06,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:06,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:55:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:07,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:55:07,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:07,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:07,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:07,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:55:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:07,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:07,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834902852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:07,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:07,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 15 [2024-11-19 06:55:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875745647] [2024-11-19 06:55:07,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:07,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:55:07,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:55:07,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:55:07,342 INFO L87 Difference]: Start difference. First operand 293 states and 333 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:07,755 INFO L93 Difference]: Finished difference Result 367 states and 414 transitions. [2024-11-19 06:55:07,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:55:07,757 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 06:55:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:07,759 INFO L225 Difference]: With dead ends: 367 [2024-11-19 06:55:07,759 INFO L226 Difference]: Without dead ends: 367 [2024-11-19 06:55:07,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:55:07,760 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 75 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:07,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2627 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:55:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-19 06:55:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 309. [2024-11-19 06:55:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 208 states have (on average 1.6153846153846154) internal successors, (336), 306 states have internal predecessors, (336), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 350 transitions. [2024-11-19 06:55:07,769 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 350 transitions. Word has length 35 [2024-11-19 06:55:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:07,769 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 350 transitions. [2024-11-19 06:55:07,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 350 transitions. [2024-11-19 06:55:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:55:07,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:07,770 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:07,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:55:07,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 06:55:07,975 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:07,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1450889018, now seen corresponding path program 1 times [2024-11-19 06:55:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933004569] [2024-11-19 06:55:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:08,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:08,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933004569] [2024-11-19 06:55:08,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933004569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:08,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:08,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:55:08,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112734227] [2024-11-19 06:55:08,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:08,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:55:08,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:08,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:55:08,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:55:08,063 INFO L87 Difference]: Start difference. First operand 309 states and 350 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:08,418 INFO L93 Difference]: Finished difference Result 311 states and 354 transitions. [2024-11-19 06:55:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:55:08,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 06:55:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:08,420 INFO L225 Difference]: With dead ends: 311 [2024-11-19 06:55:08,420 INFO L226 Difference]: Without dead ends: 311 [2024-11-19 06:55:08,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:55:08,420 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 164 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:08,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 642 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:55:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-19 06:55:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2024-11-19 06:55:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 210 states have (on average 1.6095238095238096) internal successors, (338), 306 states have internal predecessors, (338), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 352 transitions. [2024-11-19 06:55:08,427 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 352 transitions. Word has length 37 [2024-11-19 06:55:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:08,427 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 352 transitions. [2024-11-19 06:55:08,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 352 transitions. [2024-11-19 06:55:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:55:08,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:08,428 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:08,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 06:55:08,428 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:08,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1450889019, now seen corresponding path program 1 times [2024-11-19 06:55:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:08,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734937873] [2024-11-19 06:55:08,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:08,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:08,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734937873] [2024-11-19 06:55:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734937873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:08,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:08,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:55:08,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518786073] [2024-11-19 06:55:08,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:08,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:55:08,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:55:08,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:55:08,560 INFO L87 Difference]: Start difference. First operand 309 states and 352 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:08,904 INFO L93 Difference]: Finished difference Result 336 states and 369 transitions. [2024-11-19 06:55:08,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:55:08,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 06:55:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:08,906 INFO L225 Difference]: With dead ends: 336 [2024-11-19 06:55:08,906 INFO L226 Difference]: Without dead ends: 336 [2024-11-19 06:55:08,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:55:08,907 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 89 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:08,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 604 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:55:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-19 06:55:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 315. [2024-11-19 06:55:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 312 states have internal predecessors, (346), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 360 transitions. [2024-11-19 06:55:08,915 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 360 transitions. Word has length 37 [2024-11-19 06:55:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:08,916 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 360 transitions. [2024-11-19 06:55:08,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 360 transitions. [2024-11-19 06:55:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:55:08,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:08,916 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:08,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 06:55:08,917 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:08,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1557976633, now seen corresponding path program 1 times [2024-11-19 06:55:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462108960] [2024-11-19 06:55:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:08,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:08,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462108960] [2024-11-19 06:55:08,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462108960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:08,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:08,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:55:08,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917504948] [2024-11-19 06:55:08,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:08,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:55:08,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:08,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:55:08,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:55:08,983 INFO L87 Difference]: Start difference. First operand 315 states and 360 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:09,149 INFO L93 Difference]: Finished difference Result 312 states and 354 transitions. [2024-11-19 06:55:09,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:55:09,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-19 06:55:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:09,151 INFO L225 Difference]: With dead ends: 312 [2024-11-19 06:55:09,151 INFO L226 Difference]: Without dead ends: 312 [2024-11-19 06:55:09,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:55:09,152 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 49 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:09,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 501 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:55:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-19 06:55:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-19 06:55:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 216 states have (on average 1.5740740740740742) internal successors, (340), 309 states have internal predecessors, (340), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 354 transitions. [2024-11-19 06:55:09,158 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 354 transitions. Word has length 39 [2024-11-19 06:55:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:09,159 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 354 transitions. [2024-11-19 06:55:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 354 transitions. [2024-11-19 06:55:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:55:09,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:09,160 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:09,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 06:55:09,160 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:09,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1557976632, now seen corresponding path program 1 times [2024-11-19 06:55:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:09,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630974195] [2024-11-19 06:55:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:09,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630974195] [2024-11-19 06:55:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630974195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:09,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:55:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365509043] [2024-11-19 06:55:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:09,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:55:09,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:09,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:55:09,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:55:09,288 INFO L87 Difference]: Start difference. First operand 312 states and 354 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:09,596 INFO L93 Difference]: Finished difference Result 322 states and 355 transitions. [2024-11-19 06:55:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:55:09,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-19 06:55:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:09,599 INFO L225 Difference]: With dead ends: 322 [2024-11-19 06:55:09,599 INFO L226 Difference]: Without dead ends: 322 [2024-11-19 06:55:09,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:55:09,600 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 83 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:09,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 611 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:55:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-19 06:55:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 312. [2024-11-19 06:55:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 216 states have (on average 1.5601851851851851) internal successors, (337), 309 states have internal predecessors, (337), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 351 transitions. [2024-11-19 06:55:09,609 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 351 transitions. Word has length 39 [2024-11-19 06:55:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:09,610 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 351 transitions. [2024-11-19 06:55:09,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 351 transitions. [2024-11-19 06:55:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:55:09,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:09,611 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:09,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 06:55:09,611 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:09,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1559957943, now seen corresponding path program 1 times [2024-11-19 06:55:09,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:09,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68072990] [2024-11-19 06:55:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:09,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:09,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68072990] [2024-11-19 06:55:09,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68072990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:09,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:09,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:55:09,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812088144] [2024-11-19 06:55:09,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:09,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:55:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:55:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:55:09,685 INFO L87 Difference]: Start difference. First operand 312 states and 351 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:09,789 INFO L93 Difference]: Finished difference Result 381 states and 423 transitions. [2024-11-19 06:55:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:55:09,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-19 06:55:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:09,791 INFO L225 Difference]: With dead ends: 381 [2024-11-19 06:55:09,791 INFO L226 Difference]: Without dead ends: 381 [2024-11-19 06:55:09,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:55:09,792 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 230 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:09,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1037 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:55:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-19 06:55:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 312. [2024-11-19 06:55:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 309 states have internal predecessors, (336), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:09,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 350 transitions. [2024-11-19 06:55:09,800 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 350 transitions. Word has length 39 [2024-11-19 06:55:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:09,800 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 350 transitions. [2024-11-19 06:55:09,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 350 transitions. [2024-11-19 06:55:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:55:09,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:09,801 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:09,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 06:55:09,802 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:09,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1729224053, now seen corresponding path program 1 times [2024-11-19 06:55:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:09,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337144380] [2024-11-19 06:55:09,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:09,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337144380] [2024-11-19 06:55:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337144380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:09,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:55:09,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274609425] [2024-11-19 06:55:09,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:09,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:55:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:55:09,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:55:09,875 INFO L87 Difference]: Start difference. First operand 312 states and 350 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:09,960 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2024-11-19 06:55:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:55:09,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-19 06:55:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:09,963 INFO L225 Difference]: With dead ends: 323 [2024-11-19 06:55:09,963 INFO L226 Difference]: Without dead ends: 323 [2024-11-19 06:55:09,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:55:09,964 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 173 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:09,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1077 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:55:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-19 06:55:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 312. [2024-11-19 06:55:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 216 states have (on average 1.5509259259259258) internal successors, (335), 309 states have internal predecessors, (335), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 349 transitions. [2024-11-19 06:55:09,969 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 349 transitions. Word has length 41 [2024-11-19 06:55:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:09,969 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 349 transitions. [2024-11-19 06:55:09,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 349 transitions. [2024-11-19 06:55:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:55:09,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:09,970 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:09,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 06:55:09,970 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:09,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash -232116218, now seen corresponding path program 1 times [2024-11-19 06:55:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:09,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308650773] [2024-11-19 06:55:09,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:10,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308650773] [2024-11-19 06:55:10,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308650773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410783163] [2024-11-19 06:55:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:10,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:10,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:10,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:55:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:10,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 06:55:10,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:10,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:10,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:10,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410783163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:10,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 15 [2024-11-19 06:55:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061472349] [2024-11-19 06:55:10,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:10,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:55:10,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:55:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:55:10,935 INFO L87 Difference]: Start difference. First operand 312 states and 349 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:11,250 INFO L93 Difference]: Finished difference Result 363 states and 404 transitions. [2024-11-19 06:55:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:55:11,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-19 06:55:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:11,254 INFO L225 Difference]: With dead ends: 363 [2024-11-19 06:55:11,254 INFO L226 Difference]: Without dead ends: 363 [2024-11-19 06:55:11,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:55:11,255 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 72 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:11,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2431 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:55:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-19 06:55:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 327. [2024-11-19 06:55:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 231 states have (on average 1.5151515151515151) internal successors, (350), 324 states have internal predecessors, (350), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 364 transitions. [2024-11-19 06:55:11,261 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 364 transitions. Word has length 41 [2024-11-19 06:55:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:11,262 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 364 transitions. [2024-11-19 06:55:11,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 364 transitions. [2024-11-19 06:55:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:55:11,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:11,263 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:11,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:55:11,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-19 06:55:11,467 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:11,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:11,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1019662957, now seen corresponding path program 1 times [2024-11-19 06:55:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:11,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109830549] [2024-11-19 06:55:11,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:11,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:11,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109830549] [2024-11-19 06:55:11,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109830549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:11,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009320401] [2024-11-19 06:55:11,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:11,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:11,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:11,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:11,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:55:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:12,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 06:55:12,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:12,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:12,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:12,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009320401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:12,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:12,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 13 [2024-11-19 06:55:12,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096529450] [2024-11-19 06:55:12,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:12,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:55:12,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:12,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:55:12,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:55:12,379 INFO L87 Difference]: Start difference. First operand 327 states and 364 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:12,665 INFO L93 Difference]: Finished difference Result 362 states and 402 transitions. [2024-11-19 06:55:12,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:55:12,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-19 06:55:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:12,667 INFO L225 Difference]: With dead ends: 362 [2024-11-19 06:55:12,667 INFO L226 Difference]: Without dead ends: 362 [2024-11-19 06:55:12,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:55:12,668 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 76 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:12,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1984 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:55:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-19 06:55:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 332. [2024-11-19 06:55:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 236 states have (on average 1.5042372881355932) internal successors, (355), 329 states have internal predecessors, (355), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 369 transitions. [2024-11-19 06:55:12,675 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 369 transitions. Word has length 44 [2024-11-19 06:55:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:12,676 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 369 transitions. [2024-11-19 06:55:12,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 369 transitions. [2024-11-19 06:55:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:55:12,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:12,677 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:12,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:55:12,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:12,882 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1650375377, now seen corresponding path program 2 times [2024-11-19 06:55:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770673568] [2024-11-19 06:55:12,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:12,917 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:55:12,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770673568] [2024-11-19 06:55:13,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770673568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789132438] [2024-11-19 06:55:13,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:13,482 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:13,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:55:13,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:55:13,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:13,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 06:55:13,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:13,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:55:13,681 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:55:13,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:55:13,708 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:55:13,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:55:13,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:55:13,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 06:55:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:13,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:14,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-19 06:55:14,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-19 06:55:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:14,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789132438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:14,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:14,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 24 [2024-11-19 06:55:14,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566502247] [2024-11-19 06:55:14,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:14,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 06:55:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 06:55:14,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:55:14,417 INFO L87 Difference]: Start difference. First operand 332 states and 369 transitions. Second operand has 25 states, 24 states have (on average 4.458333333333333) internal successors, (107), 25 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:15,636 INFO L93 Difference]: Finished difference Result 367 states and 408 transitions. [2024-11-19 06:55:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:55:15,641 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.458333333333333) internal successors, (107), 25 states have internal predecessors, (107), 0 states have call successors, (0), 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 46 [2024-11-19 06:55:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:15,643 INFO L225 Difference]: With dead ends: 367 [2024-11-19 06:55:15,643 INFO L226 Difference]: Without dead ends: 367 [2024-11-19 06:55:15,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 06:55:15,644 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 529 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:15,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2469 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2099 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 06:55:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-19 06:55:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 334. [2024-11-19 06:55:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 238 states have (on average 1.504201680672269) internal successors, (358), 331 states have internal predecessors, (358), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 372 transitions. [2024-11-19 06:55:15,652 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 372 transitions. Word has length 46 [2024-11-19 06:55:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:15,653 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 372 transitions. [2024-11-19 06:55:15,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.458333333333333) internal successors, (107), 25 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 372 transitions. [2024-11-19 06:55:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:55:15,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:15,653 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:15,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:55:15,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:15,854 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:15,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1650375376, now seen corresponding path program 1 times [2024-11-19 06:55:15,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:15,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020051308] [2024-11-19 06:55:15,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:15,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020051308] [2024-11-19 06:55:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020051308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652151031] [2024-11-19 06:55:16,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:16,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:16,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:16,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:16,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:55:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:17,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 06:55:17,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:17,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:55:17,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:55:17,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:17,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:55:17,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:55:17,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:55:17,140 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:55:17,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:55:17,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:55:17,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:17,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 06:55:17,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:55:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:17,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652151031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:18,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:18,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 30 [2024-11-19 06:55:18,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771488692] [2024-11-19 06:55:18,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:18,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 06:55:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:18,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 06:55:18,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2024-11-19 06:55:18,135 INFO L87 Difference]: Start difference. First operand 334 states and 372 transitions. Second operand has 31 states, 30 states have (on average 4.1) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:19,589 INFO L93 Difference]: Finished difference Result 407 states and 448 transitions. [2024-11-19 06:55:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:55:19,590 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.1) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 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 46 [2024-11-19 06:55:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:19,591 INFO L225 Difference]: With dead ends: 407 [2024-11-19 06:55:19,592 INFO L226 Difference]: Without dead ends: 407 [2024-11-19 06:55:19,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 06:55:19,593 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 863 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:19,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2248 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 06:55:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-19 06:55:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 350. [2024-11-19 06:55:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 257 states have (on average 1.4708171206225682) internal successors, (378), 347 states have internal predecessors, (378), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 392 transitions. [2024-11-19 06:55:19,604 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 392 transitions. Word has length 46 [2024-11-19 06:55:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:19,604 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 392 transitions. [2024-11-19 06:55:19,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.1) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 392 transitions. [2024-11-19 06:55:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 06:55:19,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:19,605 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:19,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:55:19,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:19,810 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 783336676, now seen corresponding path program 1 times [2024-11-19 06:55:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461215097] [2024-11-19 06:55:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:20,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:20,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461215097] [2024-11-19 06:55:20,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461215097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:20,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:20,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:55:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807030244] [2024-11-19 06:55:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:20,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:55:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:20,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:55:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:55:20,048 INFO L87 Difference]: Start difference. First operand 350 states and 392 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:20,295 INFO L93 Difference]: Finished difference Result 360 states and 395 transitions. [2024-11-19 06:55:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:55:20,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-19 06:55:20,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:20,297 INFO L225 Difference]: With dead ends: 360 [2024-11-19 06:55:20,297 INFO L226 Difference]: Without dead ends: 360 [2024-11-19 06:55:20,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:55:20,298 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 98 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:20,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1402 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:55:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-19 06:55:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 350. [2024-11-19 06:55:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 257 states have (on average 1.4669260700389104) internal successors, (377), 347 states have internal predecessors, (377), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 391 transitions. [2024-11-19 06:55:20,304 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 391 transitions. Word has length 47 [2024-11-19 06:55:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:20,304 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 391 transitions. [2024-11-19 06:55:20,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 391 transitions. [2024-11-19 06:55:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:55:20,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:20,305 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:20,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 06:55:20,305 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:20,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1490095574, now seen corresponding path program 1 times [2024-11-19 06:55:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:20,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826226161] [2024-11-19 06:55:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826226161] [2024-11-19 06:55:20,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826226161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:20,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:20,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:55:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174873782] [2024-11-19 06:55:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:20,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:55:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:55:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:55:20,441 INFO L87 Difference]: Start difference. First operand 350 states and 391 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:20,828 INFO L93 Difference]: Finished difference Result 382 states and 426 transitions. [2024-11-19 06:55:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:55:20,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-19 06:55:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:20,831 INFO L225 Difference]: With dead ends: 382 [2024-11-19 06:55:20,831 INFO L226 Difference]: Without dead ends: 382 [2024-11-19 06:55:20,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:55:20,831 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 62 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:20,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1188 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:55:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-19 06:55:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 365. [2024-11-19 06:55:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 274 states have (on average 1.4343065693430657) internal successors, (393), 362 states have internal predecessors, (393), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 407 transitions. [2024-11-19 06:55:20,838 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 407 transitions. Word has length 48 [2024-11-19 06:55:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:20,838 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 407 transitions. [2024-11-19 06:55:20,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 407 transitions. [2024-11-19 06:55:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:55:20,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:20,839 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:20,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 06:55:20,840 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:20,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1490095573, now seen corresponding path program 1 times [2024-11-19 06:55:20,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:20,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93363354] [2024-11-19 06:55:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:20,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93363354] [2024-11-19 06:55:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93363354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:21,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:21,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:55:21,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687243471] [2024-11-19 06:55:21,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:21,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:55:21,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:21,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:55:21,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:55:21,133 INFO L87 Difference]: Start difference. First operand 365 states and 407 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:21,616 INFO L93 Difference]: Finished difference Result 395 states and 436 transitions. [2024-11-19 06:55:21,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:55:21,616 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-19 06:55:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:21,618 INFO L225 Difference]: With dead ends: 395 [2024-11-19 06:55:21,618 INFO L226 Difference]: Without dead ends: 395 [2024-11-19 06:55:21,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:55:21,619 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 195 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:21,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1364 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:55:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-19 06:55:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 368. [2024-11-19 06:55:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 277 states have (on average 1.4296028880866427) internal successors, (396), 365 states have internal predecessors, (396), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 410 transitions. [2024-11-19 06:55:21,627 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 410 transitions. Word has length 48 [2024-11-19 06:55:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:21,627 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 410 transitions. [2024-11-19 06:55:21,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 410 transitions. [2024-11-19 06:55:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:55:21,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:21,628 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:21,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 06:55:21,628 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:21,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1983673006, now seen corresponding path program 1 times [2024-11-19 06:55:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:21,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906459575] [2024-11-19 06:55:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:55:21,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906459575] [2024-11-19 06:55:21,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906459575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:21,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688494682] [2024-11-19 06:55:21,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:21,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:21,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:21,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:21,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:55:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:22,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:55:22,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:22,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:55:22,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:55:22,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:55:22,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:55:22,088 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:55:22,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:55:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 06:55:22,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 06:55:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688494682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:22,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 8 [2024-11-19 06:55:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104954208] [2024-11-19 06:55:22,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:55:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:55:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:55:22,204 INFO L87 Difference]: Start difference. First operand 368 states and 410 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:22,408 INFO L93 Difference]: Finished difference Result 366 states and 404 transitions. [2024-11-19 06:55:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:55:22,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-19 06:55:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:22,410 INFO L225 Difference]: With dead ends: 366 [2024-11-19 06:55:22,410 INFO L226 Difference]: Without dead ends: 366 [2024-11-19 06:55:22,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:55:22,410 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 425 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:22,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 413 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:55:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-19 06:55:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-19 06:55:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 277 states have (on average 1.4151624548736461) internal successors, (392), 363 states have internal predecessors, (392), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 404 transitions. [2024-11-19 06:55:22,418 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 404 transitions. Word has length 52 [2024-11-19 06:55:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:22,418 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 404 transitions. [2024-11-19 06:55:22,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 404 transitions. [2024-11-19 06:55:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:55:22,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:22,419 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:22,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:55:22,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:22,620 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:22,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash -171571792, now seen corresponding path program 2 times [2024-11-19 06:55:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:22,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458173806] [2024-11-19 06:55:22,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:22,636 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:55:22,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:55:22,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:22,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458173806] [2024-11-19 06:55:22,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458173806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:22,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:55:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488105201] [2024-11-19 06:55:22,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:22,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:55:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:22,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:55:22,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:55:22,801 INFO L87 Difference]: Start difference. First operand 366 states and 404 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:22,914 INFO L93 Difference]: Finished difference Result 383 states and 422 transitions. [2024-11-19 06:55:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:55:22,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-19 06:55:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:22,915 INFO L225 Difference]: With dead ends: 383 [2024-11-19 06:55:22,915 INFO L226 Difference]: Without dead ends: 383 [2024-11-19 06:55:22,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:55:22,916 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 52 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:22,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 856 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:55:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-19 06:55:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 366. [2024-11-19 06:55:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 277 states have (on average 1.4115523465703972) internal successors, (391), 363 states have internal predecessors, (391), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 403 transitions. [2024-11-19 06:55:22,923 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 403 transitions. Word has length 52 [2024-11-19 06:55:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:22,923 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 403 transitions. [2024-11-19 06:55:22,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 403 transitions. [2024-11-19 06:55:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:55:22,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:22,924 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:22,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 06:55:22,925 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1248991168, now seen corresponding path program 1 times [2024-11-19 06:55:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:22,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028551316] [2024-11-19 06:55:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:23,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:23,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028551316] [2024-11-19 06:55:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028551316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:23,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:23,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:55:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824844533] [2024-11-19 06:55:23,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:23,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:55:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:23,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:55:23,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:55:23,214 INFO L87 Difference]: Start difference. First operand 366 states and 403 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:23,517 INFO L93 Difference]: Finished difference Result 373 states and 410 transitions. [2024-11-19 06:55:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:55:23,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-19 06:55:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:23,519 INFO L225 Difference]: With dead ends: 373 [2024-11-19 06:55:23,519 INFO L226 Difference]: Without dead ends: 373 [2024-11-19 06:55:23,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:55:23,520 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 46 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:23,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1818 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:55:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-19 06:55:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 365. [2024-11-19 06:55:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 276 states have (on average 1.4094202898550725) internal successors, (389), 362 states have internal predecessors, (389), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 401 transitions. [2024-11-19 06:55:23,526 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 401 transitions. Word has length 52 [2024-11-19 06:55:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:23,526 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 401 transitions. [2024-11-19 06:55:23,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 401 transitions. [2024-11-19 06:55:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 06:55:23,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:23,527 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:23,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 06:55:23,528 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:23,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 812393603, now seen corresponding path program 2 times [2024-11-19 06:55:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:23,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697558371] [2024-11-19 06:55:23,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:23,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:23,545 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:55:23,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:55:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:23,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697558371] [2024-11-19 06:55:23,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697558371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:23,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:23,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:55:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729433434] [2024-11-19 06:55:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:23,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:55:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:23,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:55:23,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:55:23,665 INFO L87 Difference]: Start difference. First operand 365 states and 401 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:23,795 INFO L93 Difference]: Finished difference Result 372 states and 408 transitions. [2024-11-19 06:55:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:55:23,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-19 06:55:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:23,796 INFO L225 Difference]: With dead ends: 372 [2024-11-19 06:55:23,796 INFO L226 Difference]: Without dead ends: 372 [2024-11-19 06:55:23,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:55:23,797 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 49 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:23,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1058 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:55:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-19 06:55:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 345. [2024-11-19 06:55:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 256 states have (on average 1.4375) internal successors, (368), 342 states have internal predecessors, (368), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 380 transitions. [2024-11-19 06:55:23,803 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 380 transitions. Word has length 55 [2024-11-19 06:55:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:23,803 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 380 transitions. [2024-11-19 06:55:23,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 380 transitions. [2024-11-19 06:55:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 06:55:23,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:23,804 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:23,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 06:55:23,804 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:23,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1396585463, now seen corresponding path program 1 times [2024-11-19 06:55:23,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:23,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297050095] [2024-11-19 06:55:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:23,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:23,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297050095] [2024-11-19 06:55:23,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297050095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:23,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:55:23,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151670261] [2024-11-19 06:55:23,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:23,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:55:23,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:23,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:55:23,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:55:23,885 INFO L87 Difference]: Start difference. First operand 345 states and 380 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:23,973 INFO L93 Difference]: Finished difference Result 344 states and 377 transitions. [2024-11-19 06:55:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:55:23,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-19 06:55:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:23,975 INFO L225 Difference]: With dead ends: 344 [2024-11-19 06:55:23,975 INFO L226 Difference]: Without dead ends: 344 [2024-11-19 06:55:23,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:55:23,976 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 3 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:23,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 879 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:55:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-19 06:55:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-11-19 06:55:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 256 states have (on average 1.4296875) internal successors, (366), 341 states have internal predecessors, (366), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 377 transitions. [2024-11-19 06:55:23,981 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 377 transitions. Word has length 55 [2024-11-19 06:55:23,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:23,981 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 377 transitions. [2024-11-19 06:55:23,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 377 transitions. [2024-11-19 06:55:23,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 06:55:23,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:23,982 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:23,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-19 06:55:23,982 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:23,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash -889279014, now seen corresponding path program 1 times [2024-11-19 06:55:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167574300] [2024-11-19 06:55:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:23,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:24,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:25,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167574300] [2024-11-19 06:55:25,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167574300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:25,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625612392] [2024-11-19 06:55:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:25,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:25,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:25,002 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:25,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:55:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:25,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-19 06:55:25,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:25,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:55:25,231 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:55:25,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 06:55:25,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:55:25,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-19 06:55:25,400 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-19 06:55:25,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-19 06:55:25,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 06:55:25,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 06:55:25,519 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-11-19 06:55:25,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2024-11-19 06:55:25,601 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:55:25,602 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 34 treesize of output 29 [2024-11-19 06:55:25,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-19 06:55:25,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 52 [2024-11-19 06:55:25,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:55:26,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:55:27,402 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-11-19 06:55:27,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 102 [2024-11-19 06:55:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:27,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:28,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:28,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2024-11-19 06:55:29,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:29,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2024-11-19 06:55:29,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:29,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 92 [2024-11-19 06:55:29,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:29,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 108 [2024-11-19 06:55:29,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-19 06:55:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625612392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:32,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:32,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 21] total 55 [2024-11-19 06:55:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869360364] [2024-11-19 06:55:32,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:32,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-19 06:55:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-19 06:55:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2876, Unknown=14, NotChecked=0, Total=3080 [2024-11-19 06:55:32,439 INFO L87 Difference]: Start difference. First operand 344 states and 377 transitions. Second operand has 56 states, 55 states have (on average 2.9272727272727272) internal successors, (161), 56 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:37,871 INFO L93 Difference]: Finished difference Result 402 states and 433 transitions. [2024-11-19 06:55:37,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:55:37,872 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.9272727272727272) internal successors, (161), 56 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-19 06:55:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:37,873 INFO L225 Difference]: With dead ends: 402 [2024-11-19 06:55:37,873 INFO L226 Difference]: Without dead ends: 402 [2024-11-19 06:55:37,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=529, Invalid=4859, Unknown=14, NotChecked=0, Total=5402 [2024-11-19 06:55:37,875 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 906 mSDsluCounter, 5707 mSDsCounter, 0 mSdLazyCounter, 4798 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 5957 SdHoareTripleChecker+Invalid, 4827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:37,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 5957 Invalid, 4827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4798 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-19 06:55:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-19 06:55:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 345. [2024-11-19 06:55:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 257 states have (on average 1.4319066147859922) internal successors, (368), 342 states have internal predecessors, (368), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:55:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 379 transitions. [2024-11-19 06:55:37,883 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 379 transitions. Word has length 57 [2024-11-19 06:55:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:37,883 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 379 transitions. [2024-11-19 06:55:37,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.9272727272727272) internal successors, (161), 56 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:55:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 379 transitions. [2024-11-19 06:55:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 06:55:37,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:37,884 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:37,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 06:55:38,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:38,085 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-11-19 06:55:38,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash -889279013, now seen corresponding path program 1 times [2024-11-19 06:55:38,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:38,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335549357] [2024-11-19 06:55:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:38,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:39,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:39,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335549357] [2024-11-19 06:55:39,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335549357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:39,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692262067] [2024-11-19 06:55:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:39,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:39,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:39,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:55:39,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:55:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:39,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-19 06:55:39,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:39,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:55:39,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:55:39,866 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:55:39,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:55:39,883 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:55:39,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 06:55:39,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:55:39,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:55:39,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:55:39,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-19 06:55:40,050 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:55:40,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-19 06:55:40,076 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-19 06:55:40,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-19 06:55:40,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:55:40,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-19 06:55:40,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-19 06:55:40,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:55:40,222 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:55:40,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-19 06:55:40,241 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-19 06:55:40,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 06:55:40,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:55:40,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2024-11-19 06:55:40,413 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:55:40,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 48 [2024-11-19 06:55:40,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:40,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 06:55:41,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:41,598 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:41,607 INFO L349 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2024-11-19 06:55:41,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 49 [2024-11-19 06:55:41,618 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:55:41,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2024-11-19 06:55:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:41,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:00,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:00,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 100 [2024-11-19 06:56:00,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:00,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 74 [2024-11-19 06:56:00,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:00,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 798 treesize of output 788 [2024-11-19 06:56:00,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:00,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3246 treesize of output 3172 [2024-11-19 06:56:00,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 680 treesize of output 668 [2024-11-19 06:56:00,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 628 treesize of output 616 [2024-11-19 06:56:00,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:00,720 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 353 treesize of output 353 [2024-11-19 06:56:01,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:01,195 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 1170 treesize of output 1148 [2024-11-19 06:56:04,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:04,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-11-19 06:56:04,591 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:56:04,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 236 [2024-11-19 06:56:04,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 217 [2024-11-19 06:56:04,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:04,614 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 162 treesize of output 164 [2024-11-19 06:56:04,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 298 [2024-11-19 06:56:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692262067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:07,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:07,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 20] total 53 [2024-11-19 06:56:07,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724003290] [2024-11-19 06:56:07,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:07,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-19 06:56:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:07,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-19 06:56:07,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2662, Unknown=8, NotChecked=0, Total=2862 [2024-11-19 06:56:07,203 INFO L87 Difference]: Start difference. First operand 345 states and 379 transitions. Second operand has 54 states, 53 states have (on average 3.0754716981132075) internal successors, (163), 54 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)