./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/list-simple/dll2c_insert_equal.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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:26:58,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:26:58,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:26:58,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:26:58,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:26:58,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:26:58,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:26:58,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:26:58,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:26:58,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:26:58,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:26:58,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:26:58,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:26:58,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:26:58,813 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:26:58,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:26:58,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:26:58,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:26:58,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:26:58,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:26:58,819 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:26:58,820 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:26:58,820 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:26:58,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:26:58,821 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:26:58,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:26:58,821 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:26:58,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:26:58,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:26:58,822 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:26:58,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:26:58,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:26:58,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:26:58,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:26:58,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:26:58,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:26:58,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:26:58,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:26:58,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:26:58,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:26:58,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:26:58,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:26:58,826 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2024-11-10 15:26:59,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:26:59,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:26:59,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:26:59,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:26:59,109 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:26:59,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2024-11-10 15:27:00,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:27:00,854 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:27:00,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2024-11-10 15:27:00,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9e559fd/d2b2a4cf29e24425987fc0d14943a7a5/FLAGcbd4417da [2024-11-10 15:27:01,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9e559fd/d2b2a4cf29e24425987fc0d14943a7a5 [2024-11-10 15:27:01,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:27:01,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:27:01,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:27:01,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:27:01,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:27:01,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a21417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01, skipping insertion in model container [2024-11-10 15:27:01,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:27:01,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:27:01,539 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:27:01,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:27:01,623 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:27:01,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01 WrapperNode [2024-11-10 15:27:01,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:27:01,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:27:01,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:27:01,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:27:01,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,672 INFO L138 Inliner]: procedures = 127, calls = 54, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 160 [2024-11-10 15:27:01,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:27:01,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:27:01,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:27:01,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:27:01,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,706 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 22, 11]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-10 15:27:01,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:27:01,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:27:01,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:27:01,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:27:01,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (1/1) ... [2024-11-10 15:27:01,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:27:01,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:01,764 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-10 15:27:01,766 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-10 15:27:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:27:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:27:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 15:27:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:27:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:27:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:27:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-10 15:27:01,808 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-10 15:27:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:27:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:27:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:27:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:27:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:27:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:27:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:27:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:27:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:27:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:27:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:27:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:27:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 15:27:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:27:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:27:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:27:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:27:01,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:27:01,941 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:27:01,943 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:27:02,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-10 15:27:02,404 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-10 15:27:02,435 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-10 15:27:02,435 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:27:02,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:27:02,452 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:27:02,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:27:02 BoogieIcfgContainer [2024-11-10 15:27:02,453 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:27:02,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:27:02,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:27:02,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:27:02,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:27:01" (1/3) ... [2024-11-10 15:27:02,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158c9a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:27:02, skipping insertion in model container [2024-11-10 15:27:02,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:01" (2/3) ... [2024-11-10 15:27:02,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158c9a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:27:02, skipping insertion in model container [2024-11-10 15:27:02,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:27:02" (3/3) ... [2024-11-10 15:27:02,462 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2024-11-10 15:27:02,476 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:27:02,476 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2024-11-10 15:27:02,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:27:02,521 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;@1137897c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:27:02,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2024-11-10 15:27:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 88 states have (on average 2.0) internal successors, (176), 160 states have internal predecessors, (176), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:27:02,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:02,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:27:02,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1621502420, now seen corresponding path program 1 times [2024-11-10 15:27:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:02,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237131158] [2024-11-10 15:27:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:02,761 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-10 15:27:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:02,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237131158] [2024-11-10 15:27:02,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237131158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:02,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:02,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:27:02,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158461431] [2024-11-10 15:27:02,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:02,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:27:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:02,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:27:02,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:02,793 INFO L87 Difference]: Start difference. First operand has 165 states, 88 states have (on average 2.0) internal successors, (176), 160 states have internal predecessors, (176), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10 15:27:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:02,949 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2024-11-10 15:27:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:27:02,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-10 15:27:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:02,959 INFO L225 Difference]: With dead ends: 161 [2024-11-10 15:27:02,960 INFO L226 Difference]: Without dead ends: 157 [2024-11-10 15:27:02,961 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-10 15:27:02,967 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 3 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:02,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 255 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-10 15:27:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-10 15:27:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 84 states have (on average 1.9166666666666667) internal successors, (161), 152 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2024-11-10 15:27:03,012 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 6 [2024-11-10 15:27:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:03,013 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2024-11-10 15:27:03,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10 15:27:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2024-11-10 15:27:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:27:03,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:03,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:27:03,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:27:03,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:03,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1621502421, now seen corresponding path program 1 times [2024-11-10 15:27:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:03,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769473925] [2024-11-10 15:27:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:03,151 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-10 15:27:03,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:03,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769473925] [2024-11-10 15:27:03,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769473925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:03,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:03,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:27:03,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148877157] [2024-11-10 15:27:03,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:03,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:27:03,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:03,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:27:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:03,157 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10 15:27:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:03,355 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2024-11-10 15:27:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:27:03,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-10 15:27:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:03,357 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:27:03,357 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 15:27:03,357 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-10 15:27:03,358 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 3 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:03,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 257 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:27:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 15:27:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-10 15:27:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 84 states have (on average 1.880952380952381) internal successors, (158), 149 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2024-11-10 15:27:03,381 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 6 [2024-11-10 15:27:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:03,382 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2024-11-10 15:27:03,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10 15:27:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2024-11-10 15:27:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:27:03,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:03,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:03,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:27:03,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:03,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash 242414803, now seen corresponding path program 1 times [2024-11-10 15:27:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:03,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290621561] [2024-11-10 15:27:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:03,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:03,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:03,601 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-10 15:27:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290621561] [2024-11-10 15:27:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290621561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:03,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:03,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:27:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320098836] [2024-11-10 15:27:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:03,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:27:03,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:03,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:27:03,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:27:03,611 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:27:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:03,790 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2024-11-10 15:27:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:27:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 15:27:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:03,793 INFO L225 Difference]: With dead ends: 166 [2024-11-10 15:27:03,793 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 15:27:03,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:27:03,796 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 10 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:03,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 375 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:27:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 15:27:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2024-11-10 15:27:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 86 states have (on average 1.8604651162790697) internal successors, (160), 151 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2024-11-10 15:27:03,810 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 15 [2024-11-10 15:27:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:03,811 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2024-11-10 15:27:03,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:27:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2024-11-10 15:27:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:27:03,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:03,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:03,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:27:03,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:03,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:03,814 INFO L85 PathProgramCache]: Analyzing trace with hash 407076121, now seen corresponding path program 1 times [2024-11-10 15:27:03,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:03,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157625070] [2024-11-10 15:27:03,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:03,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:04,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:04,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157625070] [2024-11-10 15:27:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157625070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:04,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:04,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:27:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802753816] [2024-11-10 15:27:04,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:04,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:27:04,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:04,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:27:04,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:27:04,173 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:27:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:04,446 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2024-11-10 15:27:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:27:04,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-10 15:27:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:04,448 INFO L225 Difference]: With dead ends: 155 [2024-11-10 15:27:04,450 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 15:27:04,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:27:04,451 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 9 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:04,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 625 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:27:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 15:27:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-10 15:27:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 86 states have (on average 1.8488372093023255) internal successors, (159), 150 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2024-11-10 15:27:04,462 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 25 [2024-11-10 15:27:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:04,463 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2024-11-10 15:27:04,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:27:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2024-11-10 15:27:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:27:04,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:04,467 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:04,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:27:04,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:04,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash 407076120, now seen corresponding path program 1 times [2024-11-10 15:27:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:04,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861969783] [2024-11-10 15:27:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:27:04,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:04,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861969783] [2024-11-10 15:27:04,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861969783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:04,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:04,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:27:04,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44429489] [2024-11-10 15:27:04,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:04,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:27:04,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:04,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:27:04,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:04,651 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:27:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:04,945 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2024-11-10 15:27:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:27:04,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-10 15:27:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:04,947 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:27:04,947 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 15:27:04,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:04,948 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 7 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:04,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 534 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:27:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 15:27:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-10 15:27:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 86 states have (on average 1.8372093023255813) internal successors, (158), 149 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2024-11-10 15:27:04,954 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 25 [2024-11-10 15:27:04,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:04,954 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2024-11-10 15:27:04,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:27:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2024-11-10 15:27:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:27:04,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:04,956 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:04,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:27:04,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:04,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash 358131413, now seen corresponding path program 1 times [2024-11-10 15:27:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:04,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097651064] [2024-11-10 15:27:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:05,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:05,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:05,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097651064] [2024-11-10 15:27:05,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097651064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:05,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443569259] [2024-11-10 15:27:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:05,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:05,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:05,247 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-10 15:27:05,248 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-10 15:27:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:05,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 15:27:05,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:05,418 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-10 15:27:05,533 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:27:05,533 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-10 15:27:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:05,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:05,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443569259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:05,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:05,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2024-11-10 15:27:05,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531260794] [2024-11-10 15:27:05,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:05,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 15:27:05,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:05,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 15:27:05,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:27:05,962 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:27:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:06,585 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2024-11-10 15:27:06,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:27:06,585 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-11-10 15:27:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:06,587 INFO L225 Difference]: With dead ends: 159 [2024-11-10 15:27:06,587 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 15:27:06,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:27:06,589 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:06,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1002 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:27:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 15:27:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-10 15:27:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.8222222222222222) internal successors, (164), 153 states have internal predecessors, (164), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:27:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2024-11-10 15:27:06,596 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 27 [2024-11-10 15:27:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:06,596 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2024-11-10 15:27:06,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:27:06,597 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2024-11-10 15:27:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:27:06,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:06,598 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:06,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:27:06,802 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,SelfDestructingSolverStorable5 [2024-11-10 15:27:06,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 358131414, now seen corresponding path program 1 times [2024-11-10 15:27:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876665503] [2024-11-10 15:27:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:07,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:07,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876665503] [2024-11-10 15:27:07,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876665503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:07,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274660946] [2024-11-10 15:27:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:07,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:07,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:07,172 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-10 15:27:07,174 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-10 15:27:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:07,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:27:07,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:07,324 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-10 15:27:07,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:27:07,505 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-10 15:27:07,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:07,563 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-10 15:27:07,571 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:27:07,571 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-10 15:27:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-10 15:27:07,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:07,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274660946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:07,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:27:07,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-10 15:27:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983218392] [2024-11-10 15:27:07,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:07,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 15:27:07,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 15:27:07,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2024-11-10 15:27:07,736 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:27:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:08,350 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2024-11-10 15:27:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:27:08,350 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-10 15:27:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:08,351 INFO L225 Difference]: With dead ends: 159 [2024-11-10 15:27:08,352 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 15:27:08,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2024-11-10 15:27:08,353 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:08,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 840 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 759 Invalid, 0 Unknown, 164 Unchecked, 0.5s Time] [2024-11-10 15:27:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 15:27:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-10 15:27:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.8111111111111111) internal successors, (163), 153 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:27:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2024-11-10 15:27:08,358 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 27 [2024-11-10 15:27:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:08,358 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2024-11-10 15:27:08,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:27:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2024-11-10 15:27:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:27:08,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:08,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:08,377 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-10 15:27:08,560 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,SelfDestructingSolverStorable6 [2024-11-10 15:27:08,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:08,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash 395189126, now seen corresponding path program 1 times [2024-11-10 15:27:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:08,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307271609] [2024-11-10 15:27:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:08,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:08,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:08,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:08,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:08,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307271609] [2024-11-10 15:27:08,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307271609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:08,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155148882] [2024-11-10 15:27:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:08,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:08,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:08,695 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-10 15:27:08,697 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-10 15:27:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:08,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:27:08,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:08,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:08,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155148882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:08,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-10 15:27:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275653122] [2024-11-10 15:27:08,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:08,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:27:08,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:08,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:27:08,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:08,883 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:27:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:09,047 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2024-11-10 15:27:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:27:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-10 15:27:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:09,048 INFO L225 Difference]: With dead ends: 159 [2024-11-10 15:27:09,048 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 15:27:09,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:09,049 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:09,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 801 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:27:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 15:27:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-10 15:27:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.8) internal successors, (162), 153 states have internal predecessors, (162), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:27:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2024-11-10 15:27:09,054 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 30 [2024-11-10 15:27:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:09,054 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2024-11-10 15:27:09,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:27:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2024-11-10 15:27:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:27:09,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:09,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:09,074 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-10 15:27:09,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:09,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:09,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash -662129420, now seen corresponding path program 1 times [2024-11-10 15:27:09,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:09,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489055840] [2024-11-10 15:27:09,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:09,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:09,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:09,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:27:09,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:09,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489055840] [2024-11-10 15:27:09,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489055840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282782877] [2024-11-10 15:27:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:09,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:09,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:09,352 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-10 15:27:09,353 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-10 15:27:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:09,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:27:09,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:09,491 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-10 15:27:09,545 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-10 15:27:09,589 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:27:09,590 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-10 15:27:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2024-11-10 15:27:09,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282782877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:09,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:27:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-11-10 15:27:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769906481] [2024-11-10 15:27:09,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:09,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:27:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:27:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:27:09,654 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:27:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:09,974 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2024-11-10 15:27:09,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:27:09,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-11-10 15:27:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:09,977 INFO L225 Difference]: With dead ends: 158 [2024-11-10 15:27:09,977 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 15:27:09,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-11-10 15:27:09,979 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 9 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:09,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 618 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 481 Invalid, 0 Unknown, 162 Unchecked, 0.3s Time] [2024-11-10 15:27:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 15:27:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-10 15:27:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 90 states have (on average 1.788888888888889) internal successors, (161), 152 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:27:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2024-11-10 15:27:09,988 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 31 [2024-11-10 15:27:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:09,988 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2024-11-10 15:27:09,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:27:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2024-11-10 15:27:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:27:09,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:09,989 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:10,010 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-10 15:27:10,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:10,190 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:10,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash -662129419, now seen corresponding path program 1 times [2024-11-10 15:27:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:10,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264856839] [2024-11-10 15:27:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:10,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:10,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264856839] [2024-11-10 15:27:10,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264856839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:10,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543327727] [2024-11-10 15:27:10,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:10,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:10,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:10,449 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-10 15:27:10,451 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-10 15:27:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:10,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 15:27:10,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:10,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:10,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:27:10,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-10 15:27:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:10,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543327727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:10,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:10,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-11-10 15:27:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47138268] [2024-11-10 15:27:10,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:10,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:27:10,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:27:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:27:10,864 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:27:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:11,154 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2024-11-10 15:27:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:27:11,155 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-11-10 15:27:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:11,157 INFO L225 Difference]: With dead ends: 166 [2024-11-10 15:27:11,157 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 15:27:11,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:27:11,158 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 9 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:11,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1072 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:27:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 15:27:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2024-11-10 15:27:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 94 states have (on average 1.7659574468085106) internal successors, (166), 156 states have internal predecessors, (166), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:27:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2024-11-10 15:27:11,164 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 31 [2024-11-10 15:27:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:11,164 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2024-11-10 15:27:11,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:27:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2024-11-10 15:27:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:27:11,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:11,169 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:11,187 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-10 15:27:11,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 15:27:11,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:11,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash 948824576, now seen corresponding path program 1 times [2024-11-10 15:27:11,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:11,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735603966] [2024-11-10 15:27:11,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:27:11,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735603966] [2024-11-10 15:27:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735603966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:11,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:11,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:27:11,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291479379] [2024-11-10 15:27:11,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:11,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:27:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:11,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:27:11,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:27:11,548 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:27:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:11,885 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2024-11-10 15:27:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:27:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-10 15:27:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:11,887 INFO L225 Difference]: With dead ends: 161 [2024-11-10 15:27:11,887 INFO L226 Difference]: Without dead ends: 161 [2024-11-10 15:27:11,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:27:11,888 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 7 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:11,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 608 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:27:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-10 15:27:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-10 15:27:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 155 states have internal predecessors, (165), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:27:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2024-11-10 15:27:11,893 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 32 [2024-11-10 15:27:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:11,894 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2024-11-10 15:27:11,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:27:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2024-11-10 15:27:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:27:11,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:11,895 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:11,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:27:11,895 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:11,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash 948824577, now seen corresponding path program 1 times [2024-11-10 15:27:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:11,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394790467] [2024-11-10 15:27:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:12,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:12,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:12,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394790467] [2024-11-10 15:27:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394790467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:12,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:12,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:27:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145719337] [2024-11-10 15:27:12,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:12,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:27:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:12,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:27:12,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:27:12,129 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:27:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:12,439 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2024-11-10 15:27:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:27:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-10 15:27:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:12,441 INFO L225 Difference]: With dead ends: 160 [2024-11-10 15:27:12,441 INFO L226 Difference]: Without dead ends: 160 [2024-11-10 15:27:12,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:27:12,442 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 6 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:12,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 643 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:27:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-10 15:27:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-10 15:27:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 94 states have (on average 1.7446808510638299) internal successors, (164), 154 states have internal predecessors, (164), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:27:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2024-11-10 15:27:12,446 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 32 [2024-11-10 15:27:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:12,447 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2024-11-10 15:27:12,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:27:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2024-11-10 15:27:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 15:27:12,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:12,449 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:12,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:27:12,450 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:12,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1806843254, now seen corresponding path program 1 times [2024-11-10 15:27:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:12,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187134927] [2024-11-10 15:27:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:12,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:12,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:12,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 15:27:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 15:27:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187134927] [2024-11-10 15:27:12,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187134927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:12,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200045433] [2024-11-10 15:27:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:12,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:12,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:12,605 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-10 15:27:12,607 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-10 15:27:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:12,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:27:12,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:27:12,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:27:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200045433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:12,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:27:12,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-10 15:27:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134938092] [2024-11-10 15:27:12,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:12,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:27:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:12,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:27:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:27:12,827 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:12,848 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2024-11-10 15:27:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:27:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-10 15:27:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:12,851 INFO L225 Difference]: With dead ends: 148 [2024-11-10 15:27:12,851 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 15:27:12,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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-10 15:27:12,851 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:12,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 15:27:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-10 15:27:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 86 states have (on average 1.744186046511628) internal successors, (150), 143 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2024-11-10 15:27:12,856 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 43 [2024-11-10 15:27:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:12,857 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2024-11-10 15:27:12,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2024-11-10 15:27:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:27:12,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:12,860 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:12,878 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-10 15:27:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:13,061 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:13,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1533704123, now seen corresponding path program 1 times [2024-11-10 15:27:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599710230] [2024-11-10 15:27:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 15:27:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599710230] [2024-11-10 15:27:13,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599710230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997308305] [2024-11-10 15:27:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:13,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:13,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:13,531 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-10 15:27:13,532 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-10 15:27:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:13,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 15:27:13,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:13,735 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-10 15:27:13,743 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 5 treesize of output 3 [2024-11-10 15:27:13,763 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-10 15:27:13,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:13,805 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-10 15:27:13,816 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-10 15:27:13,842 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:27:13,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:27:13,896 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:27:13,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:27:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2024-11-10 15:27:13,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:14,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997308305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:14,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:27:14,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-10 15:27:14,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882883247] [2024-11-10 15:27:14,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:14,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:27:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:27:14,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2024-11-10 15:27:14,164 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:27:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:14,571 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2024-11-10 15:27:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:27:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2024-11-10 15:27:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:14,572 INFO L225 Difference]: With dead ends: 160 [2024-11-10 15:27:14,572 INFO L226 Difference]: Without dead ends: 160 [2024-11-10 15:27:14,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2024-11-10 15:27:14,573 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 283 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:14,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 316 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 386 Invalid, 0 Unknown, 322 Unchecked, 0.3s Time] [2024-11-10 15:27:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-10 15:27:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2024-11-10 15:27:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.627906976744186) internal successors, (140), 133 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2024-11-10 15:27:14,577 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 45 [2024-11-10 15:27:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:14,577 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2024-11-10 15:27:14,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:27:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2024-11-10 15:27:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:27:14,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:14,578 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:14,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 15:27:14,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:14,779 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:14,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1533704124, now seen corresponding path program 1 times [2024-11-10 15:27:14,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:14,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232993329] [2024-11-10 15:27:14,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:15,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:15,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:15,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:15,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232993329] [2024-11-10 15:27:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232993329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276153223] [2024-11-10 15:27:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:15,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:15,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:15,447 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-10 15:27:15,448 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-10 15:27:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:15,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 15:27:15,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:15,661 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-10 15:27:15,685 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 5 treesize of output 3 [2024-11-10 15:27:15,701 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-10 15:27:15,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:15,755 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-10 15:27:15,780 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 5 treesize of output 3 [2024-11-10 15:27:15,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:15,820 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-10 15:27:15,890 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 5 treesize of output 3 [2024-11-10 15:27:15,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:15,932 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-10 15:27:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:15,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:27:15,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276153223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:15,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:27:15,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-10 15:27:15,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298527220] [2024-11-10 15:27:15,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:15,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:27:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:15,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:27:15,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-10 15:27:15,939 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:16,102 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2024-11-10 15:27:16,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:27:16,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-11-10 15:27:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:16,103 INFO L225 Difference]: With dead ends: 132 [2024-11-10 15:27:16,103 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 15:27:16,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:27:16,104 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 53 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:16,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 308 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 171 Unchecked, 0.1s Time] [2024-11-10 15:27:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 15:27:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2024-11-10 15:27:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 126 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2024-11-10 15:27:16,108 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 45 [2024-11-10 15:27:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:16,108 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2024-11-10 15:27:16,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2024-11-10 15:27:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:27:16,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:16,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10 15:27:16,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 15:27:16,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 15:27:16,310 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:16,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:16,311 INFO L85 PathProgramCache]: Analyzing trace with hash 768892179, now seen corresponding path program 1 times [2024-11-10 15:27:16,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:16,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118363695] [2024-11-10 15:27:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:16,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 15:27:16,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:16,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118363695] [2024-11-10 15:27:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118363695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:16,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638615267] [2024-11-10 15:27:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:16,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:16,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:16,711 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:16,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:27:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:17,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 15:27:17,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:17,256 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 9 treesize of output 3 [2024-11-10 15:27:17,272 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-10 15:27:17,310 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-10 15:27:17,310 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 23 treesize of output 24 [2024-11-10 15:27:17,318 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-10 15:27:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:27:17,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:27:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638615267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:17,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:27:17,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-10 15:27:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033696203] [2024-11-10 15:27:17,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:17,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:27:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:27:17,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-10 15:27:17,325 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:17,625 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2024-11-10 15:27:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:27:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2024-11-10 15:27:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:17,626 INFO L225 Difference]: With dead ends: 176 [2024-11-10 15:27:17,626 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 15:27:17,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2024-11-10 15:27:17,627 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 142 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:17,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 544 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 441 Invalid, 0 Unknown, 255 Unchecked, 0.3s Time] [2024-11-10 15:27:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 15:27:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2024-11-10 15:27:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.6063829787234043) internal successors, (151), 134 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2024-11-10 15:27:17,631 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 49 [2024-11-10 15:27:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:17,631 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2024-11-10 15:27:17,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2024-11-10 15:27:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:27:17,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:17,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10 15:27:17,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 15:27:17,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 15:27:17,833 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:17,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash 768892180, now seen corresponding path program 1 times [2024-11-10 15:27:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956697227] [2024-11-10 15:27:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:18,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:18,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:18,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:27:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956697227] [2024-11-10 15:27:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956697227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781378162] [2024-11-10 15:27:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:18,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:18,474 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:18,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:27:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:18,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 15:27:18,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:18,972 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-10 15:27:19,244 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 9 treesize of output 3 [2024-11-10 15:27:19,247 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 9 treesize of output 3 [2024-11-10 15:27:19,292 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-11-10 15:27:19,339 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:27:19,340 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 15 treesize of output 15 [2024-11-10 15:27:19,345 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 18 treesize of output 13 [2024-11-10 15:27:19,393 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-10 15:27:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-10 15:27:19,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781378162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:19,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:27:19,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2024-11-10 15:27:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312171240] [2024-11-10 15:27:19,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:19,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:27:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:19,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:27:19,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=787, Unknown=1, NotChecked=56, Total=930 [2024-11-10 15:27:19,553 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 27 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 23 states have internal predecessors, (74), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:27:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:20,687 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2024-11-10 15:27:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:27:20,688 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 23 states have internal predecessors, (74), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2024-11-10 15:27:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:20,689 INFO L225 Difference]: With dead ends: 184 [2024-11-10 15:27:20,689 INFO L226 Difference]: Without dead ends: 184 [2024-11-10 15:27:20,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=1483, Unknown=1, NotChecked=78, Total=1722 [2024-11-10 15:27:20,690 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 264 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:20,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1363 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1699 Invalid, 0 Unknown, 187 Unchecked, 0.9s Time] [2024-11-10 15:27:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-10 15:27:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2024-11-10 15:27:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 141 states have internal predecessors, (156), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2024-11-10 15:27:20,694 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 49 [2024-11-10 15:27:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:20,694 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2024-11-10 15:27:20,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 23 states have internal predecessors, (74), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:27:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2024-11-10 15:27:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:27:20,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:20,695 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10 15:27:20,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 15:27:20,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 15:27:20,896 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:20,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1934148192, now seen corresponding path program 1 times [2024-11-10 15:27:20,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:20,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328881248] [2024-11-10 15:27:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:20,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:20,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:20,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:20,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328881248] [2024-11-10 15:27:20,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328881248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:20,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:20,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:27:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666125634] [2024-11-10 15:27:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:20,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:27:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:20,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:27:20,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:27:20,980 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:21,078 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2024-11-10 15:27:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:27:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-10 15:27:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:21,080 INFO L225 Difference]: With dead ends: 143 [2024-11-10 15:27:21,080 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 15:27:21,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:27:21,081 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:21,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 15:27:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-10 15:27:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 137 states have internal predecessors, (145), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2024-11-10 15:27:21,084 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 50 [2024-11-10 15:27:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:21,085 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2024-11-10 15:27:21,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2024-11-10 15:27:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:27:21,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:21,085 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10 15:27:21,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:27:21,086 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:21,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:21,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1004499718, now seen corresponding path program 1 times [2024-11-10 15:27:21,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:21,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266564775] [2024-11-10 15:27:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:21,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:21,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:21,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:27:21,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:21,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266564775] [2024-11-10 15:27:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266564775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:21,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:27:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948640409] [2024-11-10 15:27:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:21,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:27:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:27:21,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:21,222 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:21,437 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2024-11-10 15:27:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:27:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-10 15:27:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:21,438 INFO L225 Difference]: With dead ends: 137 [2024-11-10 15:27:21,438 INFO L226 Difference]: Without dead ends: 137 [2024-11-10 15:27:21,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:21,439 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 33 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:21,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 398 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:27:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-10 15:27:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-10 15:27:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 131 states have internal predecessors, (139), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2024-11-10 15:27:21,443 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 52 [2024-11-10 15:27:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:21,443 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2024-11-10 15:27:21,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2024-11-10 15:27:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:27:21,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:21,444 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10 15:27:21,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:27:21,444 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:21,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1004499719, now seen corresponding path program 1 times [2024-11-10 15:27:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:21,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86397098] [2024-11-10 15:27:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 15:27:21,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86397098] [2024-11-10 15:27:21,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86397098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337228366] [2024-11-10 15:27:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:21,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:21,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:21,720 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:21,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:27:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:21,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:27:21,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:22,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:27:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337228366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:22,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:27:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2024-11-10 15:27:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056942770] [2024-11-10 15:27:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:22,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:27:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:27:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:27:22,015 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:22,033 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2024-11-10 15:27:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:27:22,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-11-10 15:27:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:22,034 INFO L225 Difference]: With dead ends: 140 [2024-11-10 15:27:22,034 INFO L226 Difference]: Without dead ends: 140 [2024-11-10 15:27:22,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:27:22,035 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 76 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:22,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 292 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-10 15:27:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2024-11-10 15:27:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 130 states have internal predecessors, (137), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2024-11-10 15:27:22,038 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 52 [2024-11-10 15:27:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:22,038 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2024-11-10 15:27:22,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2024-11-10 15:27:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:27:22,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:22,040 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 15:27:22,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 15:27:22,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:22,240 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:22,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1133988533, now seen corresponding path program 1 times [2024-11-10 15:27:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:22,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150196838] [2024-11-10 15:27:22,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:22,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 15:27:22,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:22,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150196838] [2024-11-10 15:27:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150196838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404089703] [2024-11-10 15:27:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:22,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:22,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:22,448 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:22,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:27:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:22,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:27:22,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:22,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:27:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404089703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:22,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:27:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-10 15:27:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57408679] [2024-11-10 15:27:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:22,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:27:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:22,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:27:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:22,754 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:22,773 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2024-11-10 15:27:22,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:27:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2024-11-10 15:27:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:22,774 INFO L225 Difference]: With dead ends: 137 [2024-11-10 15:27:22,774 INFO L226 Difference]: Without dead ends: 137 [2024-11-10 15:27:22,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:27:22,775 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:22,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 294 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-10 15:27:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-10 15:27:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 95 states have (on average 1.4) internal successors, (133), 127 states have internal predecessors, (133), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2024-11-10 15:27:22,779 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 53 [2024-11-10 15:27:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:22,779 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2024-11-10 15:27:22,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:22,779 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2024-11-10 15:27:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:27:22,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:22,780 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10 15:27:22,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-10 15:27:22,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-10 15:27:22,981 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:22,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash 793904190, now seen corresponding path program 1 times [2024-11-10 15:27:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837046495] [2024-11-10 15:27:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:22,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:23,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:23,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837046495] [2024-11-10 15:27:23,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837046495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:23,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:23,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:27:23,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135733056] [2024-11-10 15:27:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:23,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:27:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:27:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:23,088 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:23,207 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2024-11-10 15:27:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:27:23,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-10 15:27:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:23,208 INFO L225 Difference]: With dead ends: 132 [2024-11-10 15:27:23,208 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 15:27:23,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:23,209 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:23,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 320 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 15:27:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-10 15:27:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 126 states have internal predecessors, (132), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2024-11-10 15:27:23,214 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 54 [2024-11-10 15:27:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:23,215 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2024-11-10 15:27:23,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2024-11-10 15:27:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:27:23,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:23,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10 15:27:23,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 15:27:23,216 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:23,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash 793904191, now seen corresponding path program 1 times [2024-11-10 15:27:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:23,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231948627] [2024-11-10 15:27:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:23,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231948627] [2024-11-10 15:27:23,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231948627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:23,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:23,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:27:23,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253450861] [2024-11-10 15:27:23,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:23,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:27:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:23,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:27:23,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:23,367 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:23,488 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2024-11-10 15:27:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:27:23,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-10 15:27:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:23,489 INFO L225 Difference]: With dead ends: 131 [2024-11-10 15:27:23,489 INFO L226 Difference]: Without dead ends: 131 [2024-11-10 15:27:23,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:23,490 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 2 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:23,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 318 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-10 15:27:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-10 15:27:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 125 states have internal predecessors, (131), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2024-11-10 15:27:23,493 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 54 [2024-11-10 15:27:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:23,494 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2024-11-10 15:27:23,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2024-11-10 15:27:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:27:23,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:23,494 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:23,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 15:27:23,495 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1158773838, now seen corresponding path program 1 times [2024-11-10 15:27:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722425230] [2024-11-10 15:27:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:27:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722425230] [2024-11-10 15:27:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722425230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:23,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:23,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:27:23,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391271191] [2024-11-10 15:27:23,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:23,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:27:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:23,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:27:23,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:23,730 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:23,892 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2024-11-10 15:27:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:27:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-10 15:27:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:23,893 INFO L225 Difference]: With dead ends: 125 [2024-11-10 15:27:23,893 INFO L226 Difference]: Without dead ends: 125 [2024-11-10 15:27:23,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:23,893 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 26 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:23,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 410 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:27:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-10 15:27:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-10 15:27:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 119 states have internal predecessors, (125), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2024-11-10 15:27:23,897 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 55 [2024-11-10 15:27:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:23,897 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2024-11-10 15:27:23,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2024-11-10 15:27:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:27:23,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:23,898 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10 15:27:23,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 15:27:23,898 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:23,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:23,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1185128210, now seen corresponding path program 1 times [2024-11-10 15:27:23,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:23,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850910364] [2024-11-10 15:27:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:27:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850910364] [2024-11-10 15:27:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850910364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908719390] [2024-11-10 15:27:25,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:25,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:25,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:25,242 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:25,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:27:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:25,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-11-10 15:27:25,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:25,635 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-10 15:27:25,667 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-10 15:27:25,702 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-10 15:27:26,032 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:27:26,033 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 16 treesize of output 15 [2024-11-10 15:27:26,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:27:26,048 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-10 15:27:26,158 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-10 15:27:26,163 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 11 treesize of output 7 [2024-11-10 15:27:26,238 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:27:26,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2024-11-10 15:27:26,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-10 15:27:26,436 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:27:26,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:27:26,525 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-10 15:27:26,623 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 30 treesize of output 14 [2024-11-10 15:27:26,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:27:26,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:26,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-10 15:27:26,919 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-10 15:27:26,920 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 36 treesize of output 52 [2024-11-10 15:27:27,052 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 66 treesize of output 38 [2024-11-10 15:27:27,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:27:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:27,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:27,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908719390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:27,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:27:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 31] total 55 [2024-11-10 15:27:27,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525698864] [2024-11-10 15:27:27,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-10 15:27:27,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:27,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-10 15:27:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3689, Unknown=0, NotChecked=0, Total=3906 [2024-11-10 15:27:27,855 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand has 56 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 48 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:27:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:30,132 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2024-11-10 15:27:30,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-10 15:27:30,133 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 48 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2024-11-10 15:27:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:30,134 INFO L225 Difference]: With dead ends: 126 [2024-11-10 15:27:30,134 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 15:27:30,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=500, Invalid=6982, Unknown=0, NotChecked=0, Total=7482 [2024-11-10 15:27:30,136 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 130 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:30,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1877 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 15:27:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 15:27:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-10 15:27:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.305263157894737) internal successors, (124), 118 states have internal predecessors, (124), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2024-11-10 15:27:30,139 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 57 [2024-11-10 15:27:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:30,139 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2024-11-10 15:27:30,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 48 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:27:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2024-11-10 15:27:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:27:30,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:30,140 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-10 15:27:30,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-10 15:27:30,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-10 15:27:30,341 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:30,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1185128209, now seen corresponding path program 1 times [2024-11-10 15:27:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:30,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504043532] [2024-11-10 15:27:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:31,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:27:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504043532] [2024-11-10 15:27:32,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504043532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957244790] [2024-11-10 15:27:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:32,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:32,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:32,192 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:32,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 15:27:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:32,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-11-10 15:27:32,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:32,515 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-10 15:27:32,518 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-10 15:27:32,730 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:27:32,730 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-10 15:27:32,743 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:27:32,744 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-10 15:27:32,853 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 11 treesize of output 7 [2024-11-10 15:27:32,865 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 11 treesize of output 7 [2024-11-10 15:27:32,944 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-10 15:27:32,949 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-10 15:27:33,078 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:27:33,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-10 15:27:33,083 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 24 treesize of output 11 [2024-11-10 15:27:33,135 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-10 15:27:33,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:27:33,252 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 30 treesize of output 14 [2024-11-10 15:27:33,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-10 15:27:33,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:27:33,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:27:33,546 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:27:33,546 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 20 treesize of output 23 [2024-11-10 15:27:33,563 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:27:33,563 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 15 treesize of output 15 [2024-11-10 15:27:33,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-10 15:27:33,583 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-10 15:27:33,584 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 20 treesize of output 22 [2024-11-10 15:27:33,776 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 56 treesize of output 32 [2024-11-10 15:27:33,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:27:33,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-10 15:27:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:34,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:34,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957244790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:34,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:27:34,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2024-11-10 15:27:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734733277] [2024-11-10 15:27:34,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:34,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-10 15:27:34,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:34,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-10 15:27:34,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2697, Unknown=0, NotChecked=0, Total=2862 [2024-11-10 15:27:34,477 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 48 states, 44 states have (on average 2.0) internal successors, (88), 40 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:27:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:36,695 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2024-11-10 15:27:36,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:27:36,695 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 2.0) internal successors, (88), 40 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2024-11-10 15:27:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:36,696 INFO L225 Difference]: With dead ends: 124 [2024-11-10 15:27:36,696 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 15:27:36,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=315, Invalid=4797, Unknown=0, NotChecked=0, Total=5112 [2024-11-10 15:27:36,699 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 101 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:36,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1829 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 15:27:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 15:27:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-10 15:27:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 117 states have internal predecessors, (123), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2024-11-10 15:27:36,709 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 57 [2024-11-10 15:27:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:36,709 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2024-11-10 15:27:36,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 2.0) internal successors, (88), 40 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:27:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2024-11-10 15:27:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 15:27:36,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:36,710 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:36,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-10 15:27:36,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:36,915 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:36,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash -741875092, now seen corresponding path program 1 times [2024-11-10 15:27:36,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:36,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010828112] [2024-11-10 15:27:36,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:36,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 15:27:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010828112] [2024-11-10 15:27:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010828112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:37,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:27:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669198891] [2024-11-10 15:27:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:27:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:27:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:37,154 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:37,278 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2024-11-10 15:27:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:27:37,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-10 15:27:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:37,279 INFO L225 Difference]: With dead ends: 121 [2024-11-10 15:27:37,280 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 15:27:37,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:27:37,281 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 112 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:37,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 248 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 15:27:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-10 15:27:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.263157894736842) internal successors, (120), 114 states have internal predecessors, (120), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2024-11-10 15:27:37,284 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 59 [2024-11-10 15:27:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:37,285 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2024-11-10 15:27:37,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:27:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2024-11-10 15:27:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:27:37,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:37,286 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:37,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 15:27:37,286 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:37,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:37,286 INFO L85 PathProgramCache]: Analyzing trace with hash 700845334, now seen corresponding path program 1 times [2024-11-10 15:27:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:37,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090066110] [2024-11-10 15:27:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090066110] [2024-11-10 15:27:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090066110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:37,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904880622] [2024-11-10 15:27:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:37,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:37,513 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:37,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 15:27:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:27:37,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:37,863 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-10 15:27:37,952 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 9 treesize of output 3 [2024-11-10 15:27:38,019 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:27:38,019 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 18 treesize of output 21 [2024-11-10 15:27:38,105 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-10 15:27:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:27:38,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:38,371 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 18 treesize of output 10 [2024-11-10 15:27:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:27:38,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904880622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:38,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:38,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 24 [2024-11-10 15:27:38,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453028556] [2024-11-10 15:27:38,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:38,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 15:27:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:38,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 15:27:38,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:27:38,409 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand has 25 states, 24 states have (on average 4.0) internal successors, (96), 19 states have internal predecessors, (96), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:27:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:38,960 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2024-11-10 15:27:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:27:38,961 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 19 states have internal predecessors, (96), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 62 [2024-11-10 15:27:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:38,961 INFO L225 Difference]: With dead ends: 148 [2024-11-10 15:27:38,962 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 15:27:38,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2024-11-10 15:27:38,962 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 151 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:38,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1053 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:27:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 15:27:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 124. [2024-11-10 15:27:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.25) internal successors, (125), 118 states have internal predecessors, (125), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2024-11-10 15:27:38,965 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 62 [2024-11-10 15:27:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:38,966 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2024-11-10 15:27:38,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 19 states have internal predecessors, (96), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:27:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2024-11-10 15:27:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:27:38,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:38,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:38,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-10 15:27:39,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 15:27:39,172 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:39,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash 700845335, now seen corresponding path program 1 times [2024-11-10 15:27:39,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:39,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81543013] [2024-11-10 15:27:39,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:39,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:39,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:27:40,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81543013] [2024-11-10 15:27:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81543013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896365876] [2024-11-10 15:27:40,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:40,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:40,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:40,035 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:40,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 15:27:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:40,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-10 15:27:40,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:40,408 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-10 15:27:40,597 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 9 treesize of output 3 [2024-11-10 15:27:40,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 9 treesize of output 3 [2024-11-10 15:27:40,758 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:27:40,759 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 15 treesize of output 15 [2024-11-10 15:27:40,765 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 18 treesize of output 13 [2024-11-10 15:27:40,858 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-10 15:27:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:27:40,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896365876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:41,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:27:41,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 26 [2024-11-10 15:27:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825261631] [2024-11-10 15:27:41,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:27:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:41,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:27:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2024-11-10 15:27:41,103 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 27 states, 25 states have (on average 3.44) internal successors, (86), 23 states have internal predecessors, (86), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:27:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:42,098 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2024-11-10 15:27:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:27:42,099 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.44) internal successors, (86), 23 states have internal predecessors, (86), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2024-11-10 15:27:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:42,099 INFO L225 Difference]: With dead ends: 146 [2024-11-10 15:27:42,099 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 15:27:42,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 15:27:42,100 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 149 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:42,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1161 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:27:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 15:27:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2024-11-10 15:27:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 120 states have internal predecessors, (127), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2024-11-10 15:27:42,104 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 62 [2024-11-10 15:27:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:42,104 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2024-11-10 15:27:42,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.44) internal successors, (86), 23 states have internal predecessors, (86), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:27:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2024-11-10 15:27:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 15:27:42,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:42,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:42,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-10 15:27:42,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 15:27:42,306 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:42,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash 266344612, now seen corresponding path program 1 times [2024-11-10 15:27:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:42,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681942164] [2024-11-10 15:27:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:42,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:42,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:42,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681942164] [2024-11-10 15:27:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681942164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909110056] [2024-11-10 15:27:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:42,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:42,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:42,489 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:42,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 15:27:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:42,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 15:27:42,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:42,896 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-10 15:27:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:42,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:27:43,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909110056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:43,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:43,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 15:27:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238038682] [2024-11-10 15:27:43,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:43,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:27:43,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:43,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:27:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:27:43,083 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:43,210 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2024-11-10 15:27:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:27:43,211 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 63 [2024-11-10 15:27:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:43,212 INFO L225 Difference]: With dead ends: 110 [2024-11-10 15:27:43,212 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 15:27:43,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:27:43,213 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 30 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:43,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 548 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 15:27:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-10 15:27:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:27:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2024-11-10 15:27:43,216 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 63 [2024-11-10 15:27:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:43,217 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2024-11-10 15:27:43,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:27:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2024-11-10 15:27:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 15:27:43,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:43,218 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:43,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-10 15:27:43,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:43,418 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:27:43,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1011848224, now seen corresponding path program 1 times [2024-11-10 15:27:43,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:43,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379213249] [2024-11-10 15:27:43,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:43,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:27:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:27:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:43,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:27:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 15:27:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379213249] [2024-11-10 15:27:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379213249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27325365] [2024-11-10 15:27:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:43,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:43,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:43,748 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:43,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-10 15:27:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:44,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:27:44,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:44,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:27:44,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:27:44,312 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 16 treesize of output 11 [2024-11-10 15:27:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:27:44,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:44,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:27:44,404 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 17 treesize of output 17 [2024-11-10 15:27:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 15:27:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27325365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:44,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:44,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 28 [2024-11-10 15:27:44,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492064317] [2024-11-10 15:27:44,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:44,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 15:27:44,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:44,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 15:27:44,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2024-11-10 15:27:44,573 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 28 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 24 states have internal predecessors, (97), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-10 15:27:48,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:27:52,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:27:56,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:28:00,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:28:04,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:28:08,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:28:12,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:28:16,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:28:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:17,130 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-10 15:28:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:28:17,130 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 24 states have internal predecessors, (97), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 63 [2024-11-10 15:28:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:17,131 INFO L225 Difference]: With dead ends: 102 [2024-11-10 15:28:17,131 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 15:28:17,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 15:28:17,132 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 142 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:17,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1291 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 639 Invalid, 8 Unknown, 0 Unchecked, 32.4s Time] [2024-11-10 15:28:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 15:28:17,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-10 15:28:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:28:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-10 15:28:17,136 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 63 [2024-11-10 15:28:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:17,137 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-10 15:28:17,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 24 states have internal predecessors, (97), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-10 15:28:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-10 15:28:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 15:28:17,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:17,138 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:17,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-10 15:28:17,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:17,339 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-10 15:28:17,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1891993853, now seen corresponding path program 1 times [2024-11-10 15:28:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:17,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455809654] [2024-11-10 15:28:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:19,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:28:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 15:28:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:28:19,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455809654] [2024-11-10 15:28:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455809654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310533328] [2024-11-10 15:28:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:19,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:19,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:19,671 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:19,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-10 15:28:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:20,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-10 15:28:20,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:20,488 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-10 15:28:20,635 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-10 15:28:20,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:20,746 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-10 15:28:20,848 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 11 treesize of output 7 [2024-11-10 15:28:20,861 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-10 15:28:20,934 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-10 15:28:20,942 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-10 15:28:21,083 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:21,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-10 15:28:21,090 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 24 treesize of output 11 [2024-11-10 15:28:21,145 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 24 treesize of output 12 [2024-11-10 15:28:21,149 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-10 15:28:21,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-10 15:28:21,283 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 9 treesize of output 3 [2024-11-10 15:28:21,286 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 8 [2024-11-10 15:28:21,572 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:28:21,573 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 20 treesize of output 23 [2024-11-10 15:28:21,592 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:28:21,592 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 25 treesize of output 28 [2024-11-10 15:28:21,597 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 10 treesize of output 8 [2024-11-10 15:28:21,608 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:28:21,608 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 15 treesize of output 15