./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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_update_all.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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:45:50,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:45:50,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:45:50,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:45:50,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:45:50,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:45:50,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:45:50,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:45:50,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:45:50,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:45:50,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:45:50,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:45:50,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:45:50,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:45:50,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:45:50,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:45:50,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:45:50,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:45:50,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:45:50,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:45:50,571 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:45:50,574 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:45:50,575 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:45:50,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:45:50,575 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:45:50,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:45:50,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:45:50,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:45:50,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:45:50,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:45:50,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:45:50,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:45:50,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:45:50,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:45:50,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:45:50,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:45:50,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:45:50,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:45:50,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:45:50,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:45:50,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:45:50,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:45:50,581 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2024-11-17 00:45:50,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:45:50,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:45:50,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:45:50,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:45:50,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:45:50,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2024-11-17 00:45:52,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:45:52,590 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:45:52,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2024-11-17 00:45:52,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83aa5642/918167c390834792ab9b7657cdbe04b9/FLAG69a81f6af [2024-11-17 00:45:52,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83aa5642/918167c390834792ab9b7657cdbe04b9 [2024-11-17 00:45:52,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:45:52,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:45:52,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:45:52,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:45:52,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:45:52,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:45:52" (1/1) ... [2024-11-17 00:45:52,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe48518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:52, skipping insertion in model container [2024-11-17 00:45:52,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:45:52" (1/1) ... [2024-11-17 00:45:52,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:45:52,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:45:52,960 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:45:53,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:45:53,102 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:45:53,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53 WrapperNode [2024-11-17 00:45:53,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:45:53,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:45:53,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:45:53,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:45:53,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,149 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-17 00:45:53,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:45:53,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:45:53,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:45:53,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:45:53,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,181 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-11-17 00:45:53,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:45:53,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:45:53,200 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:45:53,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:45:53,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (1/1) ... [2024-11-17 00:45:53,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:45:53,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:53,246 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-17 00:45:53,256 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-17 00:45:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:45:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:45:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:45:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:45:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-17 00:45:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-17 00:45:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:45:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:45:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:45:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:45:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:45:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:45:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:45:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:45:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:45:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:45:53,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:45:53,438 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:45:53,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:45:53,630 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L617: havoc dll_circular_get_data_at_#t~mem11#1; [2024-11-17 00:45:53,655 INFO L1250 $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-17 00:45:53,671 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-17 00:45:53,671 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:45:53,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:45:53,682 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:45:53,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:45:53 BoogieIcfgContainer [2024-11-17 00:45:53,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:45:53,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:45:53,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:45:53,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:45:53,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:45:52" (1/3) ... [2024-11-17 00:45:53,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7de09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:45:53, skipping insertion in model container [2024-11-17 00:45:53,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:53" (2/3) ... [2024-11-17 00:45:53,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7de09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:45:53, skipping insertion in model container [2024-11-17 00:45:53,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:45:53" (3/3) ... [2024-11-17 00:45:53,688 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2024-11-17 00:45:53,700 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:45:53,701 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-17 00:45:53,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:45:53,744 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;@51831726, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:45:53,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2024-11-17 00:45:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 100 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:45:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:45:53,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:53,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:45:53,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:53,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash -35230698, now seen corresponding path program 1 times [2024-11-17 00:45:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626240403] [2024-11-17 00:45:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,970 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-17 00:45:53,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:53,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626240403] [2024-11-17 00:45:53,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626240403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:53,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:53,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:45:53,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280755505] [2024-11-17 00:45:53,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:53,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:45:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:54,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:45:54,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:45:54,003 INFO L87 Difference]: Start difference. First operand has 104 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 100 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 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-17 00:45:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:54,085 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-17 00:45:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:45:54,087 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-17 00:45:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:54,092 INFO L225 Difference]: With dead ends: 100 [2024-11-17 00:45:54,092 INFO L226 Difference]: Without dead ends: 96 [2024-11-17 00:45:54,094 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-17 00:45:54,096 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:54,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:45:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-17 00:45:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-17 00:45:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:45:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2024-11-17 00:45:54,125 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 6 [2024-11-17 00:45:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:54,125 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2024-11-17 00:45:54,126 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-17 00:45:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2024-11-17 00:45:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:45:54,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:54,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:45:54,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:45:54,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:54,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash -35230697, now seen corresponding path program 1 times [2024-11-17 00:45:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:54,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193409814] [2024-11-17 00:45:54,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,226 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-17 00:45:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:54,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193409814] [2024-11-17 00:45:54,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193409814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:54,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:54,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:45:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996976280] [2024-11-17 00:45:54,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:54,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:45:54,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:54,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:45:54,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:45:54,230 INFO L87 Difference]: Start difference. First operand 96 states and 104 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-17 00:45:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:54,284 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-17 00:45:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:45:54,285 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-17 00:45:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:54,286 INFO L225 Difference]: With dead ends: 93 [2024-11-17 00:45:54,286 INFO L226 Difference]: Without dead ends: 93 [2024-11-17 00:45:54,286 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-17 00:45:54,287 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:54,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 170 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:45:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-17 00:45:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-17 00:45:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.564516129032258) internal successors, (97), 89 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:45:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-17 00:45:54,301 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 6 [2024-11-17 00:45:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:54,301 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-17 00:45:54,302 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-17 00:45:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-17 00:45:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:45:54,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:54,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:54,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:45:54,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:54,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash 635046295, now seen corresponding path program 1 times [2024-11-17 00:45:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:54,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307556748] [2024-11-17 00:45:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,415 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-17 00:45:54,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:54,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307556748] [2024-11-17 00:45:54,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307556748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:54,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:54,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:45:54,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949029180] [2024-11-17 00:45:54,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:54,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:45:54,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:54,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:45:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:45:54,418 INFO L87 Difference]: Start difference. First operand 93 states and 101 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-17 00:45:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:54,528 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2024-11-17 00:45:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:45:54,529 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-17 00:45:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:54,530 INFO L225 Difference]: With dead ends: 105 [2024-11-17 00:45:54,530 INFO L226 Difference]: Without dead ends: 105 [2024-11-17 00:45:54,530 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-17 00:45:54,531 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 10 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:54,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 245 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:45:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-17 00:45:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2024-11-17 00:45:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.546875) internal successors, (99), 91 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:45:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-11-17 00:45:54,545 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 15 [2024-11-17 00:45:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:54,545 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-11-17 00:45:54,545 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-17 00:45:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-11-17 00:45:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:45:54,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:54,546 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-17 00:45:54,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:45:54,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:54,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2134221608, now seen corresponding path program 1 times [2024-11-17 00:45:54,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706621369] [2024-11-17 00:45:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,760 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-17 00:45:54,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:54,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706621369] [2024-11-17 00:45:54,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706621369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:54,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:54,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:45:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649965874] [2024-11-17 00:45:54,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:54,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:45:54,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:54,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:45:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:45:54,766 INFO L87 Difference]: Start difference. First operand 95 states and 103 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-17 00:45:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:54,932 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-11-17 00:45:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:54,933 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-17 00:45:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:54,933 INFO L225 Difference]: With dead ends: 94 [2024-11-17 00:45:54,933 INFO L226 Difference]: Without dead ends: 94 [2024-11-17 00:45:54,934 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-17 00:45:54,935 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:54,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 376 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:45:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-17 00:45:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-17 00:45:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.53125) internal successors, (98), 90 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:45:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2024-11-17 00:45:54,945 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 25 [2024-11-17 00:45:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:54,946 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2024-11-17 00:45:54,946 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-17 00:45:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2024-11-17 00:45:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:45:54,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:54,948 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-17 00:45:54,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:45:54,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:54,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2134221607, now seen corresponding path program 1 times [2024-11-17 00:45:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678476526] [2024-11-17 00:45:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:55,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:55,240 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-17 00:45:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678476526] [2024-11-17 00:45:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678476526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:55,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:55,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:45:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626983833] [2024-11-17 00:45:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:55,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:45:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:45:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:45:55,244 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 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-17 00:45:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:55,354 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-17 00:45:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:55,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 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-17 00:45:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:55,356 INFO L225 Difference]: With dead ends: 93 [2024-11-17 00:45:55,357 INFO L226 Difference]: Without dead ends: 93 [2024-11-17 00:45:55,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-17 00:45:55,358 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:55,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:45:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-17 00:45:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-17 00:45:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.515625) internal successors, (97), 89 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:45:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-17 00:45:55,368 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 25 [2024-11-17 00:45:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:55,369 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-17 00:45:55,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 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-17 00:45:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-17 00:45:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:45:55,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:55,369 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-17 00:45:55,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:45:55,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:55,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:55,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2007404437, now seen corresponding path program 1 times [2024-11-17 00:45:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104413950] [2024-11-17 00:45:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:55,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:55,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:55,665 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-17 00:45:55,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:55,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104413950] [2024-11-17 00:45:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104413950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:55,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464358656] [2024-11-17 00:45:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:55,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:55,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:55,674 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-17 00:45:55,675 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-17 00:45:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:55,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:45:55,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:55,817 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-17 00:45:55,873 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-17 00:45:55,929 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:45:55,929 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-17 00:45:55,937 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-17 00:45:55,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:55,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464358656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:55,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:55,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-17 00:45:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434597376] [2024-11-17 00:45:55,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:55,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:45:55,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:45:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-17 00:45:55,999 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:45:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:56,192 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2024-11-17 00:45:56,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:56,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-17 00:45:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:56,193 INFO L225 Difference]: With dead ends: 98 [2024-11-17 00:45:56,194 INFO L226 Difference]: Without dead ends: 98 [2024-11-17 00:45:56,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-17 00:45:56,194 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:56,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 102 Unchecked, 0.1s Time] [2024-11-17 00:45:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-17 00:45:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-17 00:45:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 93 states have internal predecessors, (103), 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-17 00:45:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2024-11-17 00:45:56,202 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 27 [2024-11-17 00:45:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:56,202 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2024-11-17 00:45:56,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:45:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2024-11-17 00:45:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:45:56,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:56,203 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-17 00:45:56,216 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-17 00:45:56,407 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-17 00:45:56,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:56,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2007404438, now seen corresponding path program 1 times [2024-11-17 00:45:56,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:56,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935133340] [2024-11-17 00:45:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:56,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:56,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:56,841 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-17 00:45:56,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935133340] [2024-11-17 00:45:56,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935133340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503578240] [2024-11-17 00:45:56,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:56,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:56,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:56,844 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-17 00:45:56,845 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-17 00:45:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:56,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 00:45:56,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:56,975 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-17 00:45:56,980 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-17 00:45:57,067 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-17 00:45:57,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:45:57,113 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-17 00:45:57,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:45:57,119 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-17 00:45:57,129 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-17 00:45:57,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503578240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:57,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:57,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2024-11-17 00:45:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49619679] [2024-11-17 00:45:57,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:57,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:45:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:57,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:45:57,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2024-11-17 00:45:57,282 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:45:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:57,812 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-11-17 00:45:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:45:57,813 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-17 00:45:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:57,814 INFO L225 Difference]: With dead ends: 98 [2024-11-17 00:45:57,814 INFO L226 Difference]: Without dead ends: 98 [2024-11-17 00:45:57,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2024-11-17 00:45:57,815 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:57,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 101 Unchecked, 0.4s Time] [2024-11-17 00:45:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-17 00:45:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-17 00:45:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.5) internal successors, (102), 93 states have internal predecessors, (102), 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-17 00:45:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2024-11-17 00:45:57,821 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 27 [2024-11-17 00:45:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:57,821 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2024-11-17 00:45:57,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:45:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2024-11-17 00:45:57,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:45:57,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:57,822 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-17 00:45:57,839 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-17 00:45:58,026 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-17 00:45:58,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:58,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash -538074738, now seen corresponding path program 1 times [2024-11-17 00:45:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116233523] [2024-11-17 00:45:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:58,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:58,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:58,149 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-17 00:45:58,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:58,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116233523] [2024-11-17 00:45:58,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116233523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:58,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879249593] [2024-11-17 00:45:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:58,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:58,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:58,156 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-17 00:45:58,159 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-17 00:45:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:58,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:45:58,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:58,274 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-17 00:45:58,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:58,308 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-17 00:45:58,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879249593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:45:58,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:45:58,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-17 00:45:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012194301] [2024-11-17 00:45:58,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:58,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:45:58,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:58,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:45:58,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:45:58,311 INFO L87 Difference]: Start difference. First operand 98 states and 108 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-17 00:45:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:58,383 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2024-11-17 00:45:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:58,384 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-17 00:45:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:58,385 INFO L225 Difference]: With dead ends: 98 [2024-11-17 00:45:58,385 INFO L226 Difference]: Without dead ends: 98 [2024-11-17 00:45:58,385 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-17 00:45:58,386 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:58,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 482 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:45:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-17 00:45:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-17 00:45:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 93 states have internal predecessors, (101), 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-17 00:45:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-17 00:45:58,393 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 30 [2024-11-17 00:45:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:58,394 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-17 00:45:58,394 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-17 00:45:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-17 00:45:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:45:58,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:58,396 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-17 00:45:58,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:45:58,600 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-17 00:45:58,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:58,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash 471461812, now seen corresponding path program 1 times [2024-11-17 00:45:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:58,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725820466] [2024-11-17 00:45:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:58,704 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-17 00:45:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725820466] [2024-11-17 00:45:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725820466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346744693] [2024-11-17 00:45:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:58,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:58,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:58,706 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-17 00:45:58,708 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-17 00:45:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:58,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:45:58,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:58,811 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-17 00:45:58,860 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-17 00:45:58,903 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:45:58,903 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-17 00:45:58,913 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-17 00:45:58,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:58,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346744693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:58,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:58,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-11-17 00:45:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685756696] [2024-11-17 00:45:58,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:58,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:45:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:45:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-11-17 00:45:58,963 INFO L87 Difference]: Start difference. First operand 98 states and 107 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-17 00:45:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:59,145 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2024-11-17 00:45:59,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:45:59,146 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-17 00:45:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:59,146 INFO L225 Difference]: With dead ends: 97 [2024-11-17 00:45:59,146 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 00:45:59,147 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-17 00:45:59,147 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:59,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 468 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2024-11-17 00:45:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 00:45:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-17 00:45:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 92 states have internal predecessors, (100), 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-17 00:45:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2024-11-17 00:45:59,150 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 31 [2024-11-17 00:45:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:59,150 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2024-11-17 00:45:59,151 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-17 00:45:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2024-11-17 00:45:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:45:59,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:59,151 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-17 00:45:59,167 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-17 00:45:59,355 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-17 00:45:59,356 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:45:59,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:59,356 INFO L85 PathProgramCache]: Analyzing trace with hash 471461813, now seen corresponding path program 1 times [2024-11-17 00:45:59,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253616672] [2024-11-17 00:45:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:59,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:59,535 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-17 00:45:59,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253616672] [2024-11-17 00:45:59,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253616672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104696492] [2024-11-17 00:45:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:59,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:59,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:59,541 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-17 00:45:59,542 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-17 00:45:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:59,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-17 00:45:59,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:59,655 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-17 00:45:59,659 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-17 00:45:59,775 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-17 00:45:59,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:45:59,801 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-17 00:45:59,807 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:45:59,808 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-17 00:45:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-17 00:45:59,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:59,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104696492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:59,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:59,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-17 00:45:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268767863] [2024-11-17 00:45:59,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:59,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 00:45:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 00:45:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-17 00:45:59,927 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 12 states have internal predecessors, (52), 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-17 00:46:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:00,181 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2024-11-17 00:46:00,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:46:00,182 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 12 states have internal predecessors, (52), 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 31 [2024-11-17 00:46:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:00,186 INFO L225 Difference]: With dead ends: 116 [2024-11-17 00:46:00,187 INFO L226 Difference]: Without dead ends: 116 [2024-11-17 00:46:00,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-17 00:46:00,187 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 16 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:00,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 773 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 392 Invalid, 0 Unknown, 123 Unchecked, 0.2s Time] [2024-11-17 00:46:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-17 00:46:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2024-11-17 00:46:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 103 states have internal predecessors, (116), 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-17 00:46:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2024-11-17 00:46:00,195 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 31 [2024-11-17 00:46:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:00,195 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2024-11-17 00:46:00,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 12 states have internal predecessors, (52), 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-17 00:46:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2024-11-17 00:46:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:46:00,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:00,196 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-17 00:46:00,224 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-17 00:46:00,396 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-17 00:46:00,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:00,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1730414344, now seen corresponding path program 1 times [2024-11-17 00:46:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105698816] [2024-11-17 00:46:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:00,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:00,490 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-17 00:46:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105698816] [2024-11-17 00:46:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105698816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:46:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284889096] [2024-11-17 00:46:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:46:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:00,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:46:00,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:46:00,492 INFO L87 Difference]: Start difference. First operand 109 states and 124 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-17 00:46:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:00,629 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2024-11-17 00:46:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:46:00,629 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-17 00:46:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:00,630 INFO L225 Difference]: With dead ends: 108 [2024-11-17 00:46:00,630 INFO L226 Difference]: Without dead ends: 108 [2024-11-17 00:46:00,630 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-17 00:46:00,631 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 7 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:00,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 427 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-17 00:46:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-17 00:46:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 102 states have internal predecessors, (115), 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-17 00:46:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2024-11-17 00:46:00,634 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 32 [2024-11-17 00:46:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:00,634 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2024-11-17 00:46:00,635 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-17 00:46:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2024-11-17 00:46:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:46:00,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:00,635 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-17 00:46:00,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:46:00,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:00,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1730414345, now seen corresponding path program 1 times [2024-11-17 00:46:00,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:00,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320181586] [2024-11-17 00:46:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:00,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:00,863 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-17 00:46:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:00,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320181586] [2024-11-17 00:46:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320181586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:00,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:46:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624916673] [2024-11-17 00:46:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:00,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:46:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:46:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:46:00,866 INFO L87 Difference]: Start difference. First operand 108 states and 123 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-17 00:46:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:00,978 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2024-11-17 00:46:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:46:00,978 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-17 00:46:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:00,979 INFO L225 Difference]: With dead ends: 107 [2024-11-17 00:46:00,979 INFO L226 Difference]: Without dead ends: 107 [2024-11-17 00:46:00,979 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-17 00:46:00,980 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:00,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 459 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-17 00:46:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-17 00:46:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 101 states have internal predecessors, (114), 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-17 00:46:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2024-11-17 00:46:00,982 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 32 [2024-11-17 00:46:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:00,983 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-11-17 00:46:00,983 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-17 00:46:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2024-11-17 00:46:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:46:00,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:00,985 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:00,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:46:00,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:00,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:00,985 INFO L85 PathProgramCache]: Analyzing trace with hash 85178853, now seen corresponding path program 1 times [2024-11-17 00:46:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485991492] [2024-11-17 00:46:00,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,131 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-17 00:46:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:01,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485991492] [2024-11-17 00:46:01,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485991492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:01,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:46:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975062345] [2024-11-17 00:46:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:01,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:46:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:46:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:46:01,133 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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-17 00:46:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:01,322 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2024-11-17 00:46:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:46:01,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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 39 [2024-11-17 00:46:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:01,323 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:46:01,323 INFO L226 Difference]: Without dead ends: 111 [2024-11-17 00:46:01,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:46:01,324 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 48 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:01,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 522 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:46:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-17 00:46:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-17 00:46:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 105 states have internal predecessors, (121), 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-17 00:46:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2024-11-17 00:46:01,327 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 39 [2024-11-17 00:46:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:01,328 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2024-11-17 00:46:01,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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-17 00:46:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2024-11-17 00:46:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:46:01,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:01,329 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:01,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:46:01,331 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:01,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash 85178854, now seen corresponding path program 1 times [2024-11-17 00:46:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:01,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487662636] [2024-11-17 00:46:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:01,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,586 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-17 00:46:01,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:01,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487662636] [2024-11-17 00:46:01,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487662636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:01,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:01,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:46:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613773018] [2024-11-17 00:46:01,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:01,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:46:01,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:01,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:46:01,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:46:01,589 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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-17 00:46:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:01,769 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2024-11-17 00:46:01,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:46:01,770 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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 39 [2024-11-17 00:46:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:01,770 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:46:01,770 INFO L226 Difference]: Without dead ends: 111 [2024-11-17 00:46:01,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:46:01,771 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:01,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 587 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:46:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-17 00:46:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-17 00:46:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 105 states have internal predecessors, (119), 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-17 00:46:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2024-11-17 00:46:01,774 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 39 [2024-11-17 00:46:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:01,774 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2024-11-17 00:46:01,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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-17 00:46:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2024-11-17 00:46:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:46:01,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:01,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:01,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:46:01,775 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:01,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1432299093, now seen corresponding path program 1 times [2024-11-17 00:46:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568964686] [2024-11-17 00:46:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568964686] [2024-11-17 00:46:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568964686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:46:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097928931] [2024-11-17 00:46:01,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:01,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:46:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:01,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:46:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:46:01,850 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:01,907 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2024-11-17 00:46:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:46:01,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-17 00:46:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:01,908 INFO L225 Difference]: With dead ends: 145 [2024-11-17 00:46:01,908 INFO L226 Difference]: Without dead ends: 145 [2024-11-17 00:46:01,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:46:01,910 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 68 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:01,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 263 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-17 00:46:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 115. [2024-11-17 00:46:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 109 states have internal predecessors, (123), 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-17 00:46:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2024-11-17 00:46:01,913 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 42 [2024-11-17 00:46:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:01,913 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2024-11-17 00:46:01,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2024-11-17 00:46:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:46:01,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:01,915 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-17 00:46:01,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:46:01,915 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:01,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1005243854, now seen corresponding path program 1 times [2024-11-17 00:46:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502715615] [2024-11-17 00:46:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-17 00:46:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,041 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-17 00:46:02,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502715615] [2024-11-17 00:46:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502715615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939698366] [2024-11-17 00:46:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:02,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:02,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:02,046 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-17 00:46:02,048 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-17 00:46:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:46:02,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:02,221 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-17 00:46:02,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:46:02,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939698366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:02,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:46:02,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-17 00:46:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449878922] [2024-11-17 00:46:02,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:02,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:46:02,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:02,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:46:02,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:46:02,223 INFO L87 Difference]: Start difference. First operand 115 states and 131 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-17 00:46:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:02,232 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-17 00:46:02,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:46:02,232 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-17 00:46:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:02,233 INFO L225 Difference]: With dead ends: 95 [2024-11-17 00:46:02,233 INFO L226 Difference]: Without dead ends: 95 [2024-11-17 00:46:02,233 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-17 00:46:02,233 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:02,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:46:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-17 00:46:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-17 00:46:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 91 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-17 00:46:02,236 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 43 [2024-11-17 00:46:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:02,236 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-17 00:46:02,236 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-17 00:46:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-17 00:46:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:46:02,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:02,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:02,255 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-17 00:46:02,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 00:46:02,437 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:02,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2127839289, now seen corresponding path program 1 times [2024-11-17 00:46:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957632778] [2024-11-17 00:46:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:02,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957632778] [2024-11-17 00:46:02,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957632778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:02,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:02,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:46:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031062980] [2024-11-17 00:46:02,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:02,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:46:02,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:02,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:46:02,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:46:02,508 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:02,558 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2024-11-17 00:46:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:46:02,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-17 00:46:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:02,559 INFO L225 Difference]: With dead ends: 115 [2024-11-17 00:46:02,560 INFO L226 Difference]: Without dead ends: 115 [2024-11-17 00:46:02,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-17 00:46:02,560 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 22 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:02,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 302 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:46:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-17 00:46:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2024-11-17 00:46:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 93 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2024-11-17 00:46:02,562 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 43 [2024-11-17 00:46:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:02,563 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2024-11-17 00:46:02,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-11-17 00:46:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:46:02,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:02,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:02,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:46:02,564 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:02,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2110521135, now seen corresponding path program 1 times [2024-11-17 00:46:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:02,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944063809] [2024-11-17 00:46:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:02,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:46:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944063809] [2024-11-17 00:46:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944063809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:46:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497577331] [2024-11-17 00:46:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:02,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:46:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:46:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:46:02,700 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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-17 00:46:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:02,869 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2024-11-17 00:46:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:46:02,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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 48 [2024-11-17 00:46:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:02,870 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:46:02,870 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:46:02,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:46:02,871 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 35 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:02,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 488 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:46:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:46:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-17 00:46:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 97 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-11-17 00:46:02,873 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 48 [2024-11-17 00:46:02,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:02,873 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-11-17 00:46:02,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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-17 00:46:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-11-17 00:46:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:46:02,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:02,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:02,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:46:02,874 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:02,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2110521134, now seen corresponding path program 1 times [2024-11-17 00:46:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:02,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430281951] [2024-11-17 00:46:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430281951] [2024-11-17 00:46:02,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430281951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676885591] [2024-11-17 00:46:02,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:02,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:02,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:02,978 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-17 00:46:02,983 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-17 00:46:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:03,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:46:03,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:03,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676885591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:03,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:03,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-17 00:46:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151612399] [2024-11-17 00:46:03,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:03,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:46:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:46:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:46:03,229 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:46:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:03,295 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2024-11-17 00:46:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:46:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-11-17 00:46:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:03,296 INFO L225 Difference]: With dead ends: 127 [2024-11-17 00:46:03,296 INFO L226 Difference]: Without dead ends: 127 [2024-11-17 00:46:03,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:46:03,297 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 93 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:03,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 416 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-17 00:46:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2024-11-17 00:46:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 115 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2024-11-17 00:46:03,299 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 48 [2024-11-17 00:46:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:03,299 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2024-11-17 00:46:03,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:46:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2024-11-17 00:46:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:46:03,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:03,300 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:03,314 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-17 00:46:03,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:03,501 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:03,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash -286116661, now seen corresponding path program 1 times [2024-11-17 00:46:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:03,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127490105] [2024-11-17 00:46:03,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:04,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:04,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:46:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:04,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127490105] [2024-11-17 00:46:04,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127490105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:04,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150354364] [2024-11-17 00:46:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:04,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:04,177 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-17 00:46:04,181 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-17 00:46:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:04,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-17 00:46:04,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:04,379 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-17 00:46:04,490 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:46:04,490 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-17 00:46:04,553 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-17 00:46:04,601 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-17 00:46:04,683 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-17 00:46:04,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-17 00:46:04,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:04,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:04,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:04,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2024-11-17 00:46:04,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:04,967 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 38 treesize of output 16 [2024-11-17 00:46:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:46:04,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:05,839 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2213 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2213) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2024-11-17 00:46:05,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2213 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2213) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2024-11-17 00:46:05,855 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2024-11-17 00:46:05,856 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 22 treesize of output 21 [2024-11-17 00:46:09,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:09,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-17 00:46:09,944 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 122 treesize of output 110 [2024-11-17 00:46:09,953 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 15 treesize of output 13 [2024-11-17 00:46:09,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-17 00:46:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-17 00:46:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150354364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:10,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 48 [2024-11-17 00:46:10,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24690102] [2024-11-17 00:46:10,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:10,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-17 00:46:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:10,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-17 00:46:10,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2016, Unknown=23, NotChecked=182, Total=2352 [2024-11-17 00:46:10,282 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 49 states, 48 states have (on average 2.125) internal successors, (102), 41 states have internal predecessors, (102), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:46:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:11,467 INFO L93 Difference]: Finished difference Result 180 states and 219 transitions. [2024-11-17 00:46:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 00:46:11,472 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 41 states have internal predecessors, (102), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-11-17 00:46:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:11,472 INFO L225 Difference]: With dead ends: 180 [2024-11-17 00:46:11,472 INFO L226 Difference]: Without dead ends: 180 [2024-11-17 00:46:11,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=219, Invalid=3305, Unknown=24, NotChecked=234, Total=3782 [2024-11-17 00:46:11,474 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 142 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:11,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1918 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1360 Invalid, 0 Unknown, 184 Unchecked, 0.7s Time] [2024-11-17 00:46:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-17 00:46:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 131. [2024-11-17 00:46:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 127 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2024-11-17 00:46:11,488 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 49 [2024-11-17 00:46:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:11,488 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2024-11-17 00:46:11,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 41 states have internal predecessors, (102), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:46:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2024-11-17 00:46:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:46:11,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:11,493 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:11,515 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-17 00:46:11,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:11,694 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:11,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash -286116660, now seen corresponding path program 1 times [2024-11-17 00:46:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:11,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380046503] [2024-11-17 00:46:11,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:11,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:46:12,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380046503] [2024-11-17 00:46:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380046503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916049571] [2024-11-17 00:46:12,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:12,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:12,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:12,790 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-17 00:46:12,791 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-17 00:46:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-17 00:46:12,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:12,990 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-17 00:46:12,997 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-17 00:46:13,311 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:46:13,311 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-17 00:46:13,322 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:46:13,322 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-17 00:46:13,405 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-17 00:46:13,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:46:13,483 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:46:13,484 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 57 treesize of output 50 [2024-11-17 00:46:13,493 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 31 treesize of output 16 [2024-11-17 00:46:13,635 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:46:13,635 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 33 treesize of output 24 [2024-11-17 00:46:13,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:13,646 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-17 00:46:13,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-17 00:46:13,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:46:13,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:13,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:13,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 29 [2024-11-17 00:46:13,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:13,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:46:14,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-17 00:46:14,113 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 7 treesize of output 3 [2024-11-17 00:46:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:46:14,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:14,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2416 (Array Int Int))) (or (forall ((v_ArrVal_2414 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_2414)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= (store .cse1 .cse0 (select v_ArrVal_2416 .cse0)) v_ArrVal_2416)))) (forall ((v_ArrVal_2416 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 9)) (not (= (store .cse1 .cse0 (select v_ArrVal_2416 .cse0)) v_ArrVal_2416)))))) is different from false [2024-11-17 00:46:14,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:14,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2024-11-17 00:46:14,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:14,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-17 00:46:14,948 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 116 treesize of output 108 [2024-11-17 00:46:14,954 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 334 treesize of output 314 [2024-11-17 00:46:14,959 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 70 treesize of output 66 [2024-11-17 00:46:14,963 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 34 treesize of output 32 [2024-11-17 00:46:14,968 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 64 treesize of output 60 [2024-11-17 00:46:14,973 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 30 treesize of output 28 [2024-11-17 00:46:15,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:15,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-17 00:46:15,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:15,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:15,010 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 18 treesize of output 10 [2024-11-17 00:46:15,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916049571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:15,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:15,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2024-11-17 00:46:15,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244006947] [2024-11-17 00:46:15,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:15,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-17 00:46:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:15,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-17 00:46:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2815, Unknown=3, NotChecked=106, Total=3080 [2024-11-17 00:46:15,243 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 43 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 37 states have internal predecessors, (87), 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-17 00:46:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:16,567 INFO L93 Difference]: Finished difference Result 192 states and 234 transitions. [2024-11-17 00:46:16,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 00:46:16,567 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 37 states have internal predecessors, (87), 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 49 [2024-11-17 00:46:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:16,568 INFO L225 Difference]: With dead ends: 192 [2024-11-17 00:46:16,568 INFO L226 Difference]: Without dead ends: 192 [2024-11-17 00:46:16,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=258, Invalid=4435, Unknown=3, NotChecked=134, Total=4830 [2024-11-17 00:46:16,570 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 131 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:16,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1814 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:46:16,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-17 00:46:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 141. [2024-11-17 00:46:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 137 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 168 transitions. [2024-11-17 00:46:16,573 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 168 transitions. Word has length 49 [2024-11-17 00:46:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:16,573 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 168 transitions. [2024-11-17 00:46:16,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 37 states have internal predecessors, (87), 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-17 00:46:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 168 transitions. [2024-11-17 00:46:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 00:46:16,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:16,574 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:16,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-17 00:46:16,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:16,779 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash 266753965, now seen corresponding path program 2 times [2024-11-17 00:46:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:16,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145329632] [2024-11-17 00:46:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:16,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:16,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:16,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:16,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145329632] [2024-11-17 00:46:16,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145329632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:16,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24135992] [2024-11-17 00:46:16,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:46:16,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:16,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:16,879 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-17 00:46:16,883 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-17 00:46:17,118 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:46:17,118 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:46:17,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:46:17,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 00:46:17,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 00:46:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24135992] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:17,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:17,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-11-17 00:46:17,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912993473] [2024-11-17 00:46:17,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:17,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:46:17,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:17,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:46:17,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:46:17,196 INFO L87 Difference]: Start difference. First operand 141 states and 168 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:46:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:17,280 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2024-11-17 00:46:17,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:46:17,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-11-17 00:46:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:17,281 INFO L225 Difference]: With dead ends: 133 [2024-11-17 00:46:17,282 INFO L226 Difference]: Without dead ends: 133 [2024-11-17 00:46:17,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:46:17,282 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 90 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:17,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 377 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-17 00:46:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2024-11-17 00:46:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 121 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2024-11-17 00:46:17,285 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 53 [2024-11-17 00:46:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:17,285 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2024-11-17 00:46:17,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:46:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2024-11-17 00:46:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:46:17,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:17,286 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:17,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:17,489 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,SelfDestructingSolverStorable21 [2024-11-17 00:46:17,489 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:17,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1845628494, now seen corresponding path program 2 times [2024-11-17 00:46:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862852866] [2024-11-17 00:46:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:17,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862852866] [2024-11-17 00:46:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862852866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619221730] [2024-11-17 00:46:17,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:46:17,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:17,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:17,609 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-17 00:46:17,610 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-17 00:46:17,804 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:46:17,804 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:46:17,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-17 00:46:17,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:17,821 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-17 00:46:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:46:18,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:46:18,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619221730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:18,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:46:18,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 14 [2024-11-17 00:46:18,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266420470] [2024-11-17 00:46:18,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:18,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:46:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:18,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:46:18,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:46:18,027 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-17 00:46:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:18,192 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2024-11-17 00:46:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:46:18,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 54 [2024-11-17 00:46:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:18,194 INFO L225 Difference]: With dead ends: 125 [2024-11-17 00:46:18,194 INFO L226 Difference]: Without dead ends: 125 [2024-11-17 00:46:18,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:46:18,195 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:18,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 509 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-17 00:46:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-17 00:46:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 121 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2024-11-17 00:46:18,198 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 54 [2024-11-17 00:46:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:18,198 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2024-11-17 00:46:18,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-17 00:46:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2024-11-17 00:46:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-17 00:46:18,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:18,199 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:18,215 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-17 00:46:18,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-17 00:46:18,402 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:18,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1753265007, now seen corresponding path program 1 times [2024-11-17 00:46:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:18,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957543731] [2024-11-17 00:46:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:18,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-17 00:46:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957543731] [2024-11-17 00:46:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957543731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:18,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:46:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441020566] [2024-11-17 00:46:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:18,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:46:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:46:18,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:46:18,626 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:18,690 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-11-17 00:46:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:46:18,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2024-11-17 00:46:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:18,692 INFO L225 Difference]: With dead ends: 123 [2024-11-17 00:46:18,692 INFO L226 Difference]: Without dead ends: 123 [2024-11-17 00:46:18,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-17 00:46:18,692 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 15 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:18,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 292 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-17 00:46:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-17 00:46:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 115 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-17 00:46:18,695 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 58 [2024-11-17 00:46:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:18,696 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-17 00:46:18,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-17 00:46:18,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-17 00:46:18,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:18,697 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:18,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-17 00:46:18,697 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:18,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1576585265, now seen corresponding path program 3 times [2024-11-17 00:46:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:18,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925540675] [2024-11-17 00:46:18,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:18,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:46:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925540675] [2024-11-17 00:46:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925540675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37006966] [2024-11-17 00:46:18,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:46:18,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:18,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:18,817 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-17 00:46:18,818 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-17 00:46:19,370 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-17 00:46:19,370 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:46:19,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:46:19,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:46:19,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:46:19,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37006966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:19,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:19,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-17 00:46:19,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663203547] [2024-11-17 00:46:19,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:19,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:46:19,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:19,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:46:19,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:46:19,510 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:46:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:19,609 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2024-11-17 00:46:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:46:19,609 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2024-11-17 00:46:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:19,610 INFO L225 Difference]: With dead ends: 115 [2024-11-17 00:46:19,610 INFO L226 Difference]: Without dead ends: 115 [2024-11-17 00:46:19,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:46:19,611 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 98 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:19,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 464 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-17 00:46:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2024-11-17 00:46:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 103 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2024-11-17 00:46:19,613 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 59 [2024-11-17 00:46:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:19,613 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2024-11-17 00:46:19,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:46:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2024-11-17 00:46:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:46:19,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:19,613 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:19,628 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-17 00:46:19,814 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,SelfDestructingSolverStorable24 [2024-11-17 00:46:19,814 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:19,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:19,815 INFO L85 PathProgramCache]: Analyzing trace with hash 135654405, now seen corresponding path program 1 times [2024-11-17 00:46:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:19,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643737473] [2024-11-17 00:46:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:19,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:19,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:19,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643737473] [2024-11-17 00:46:19,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643737473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:19,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938125348] [2024-11-17 00:46:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:19,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:19,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:19,908 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-17 00:46:19,909 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-17 00:46:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:20,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:46:20,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:20,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:20,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938125348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:20,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:20,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-17 00:46:20,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146539844] [2024-11-17 00:46:20,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:20,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:46:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:20,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:46:20,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:20,168 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:20,234 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2024-11-17 00:46:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:46:20,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-11-17 00:46:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:20,235 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:46:20,235 INFO L226 Difference]: Without dead ends: 111 [2024-11-17 00:46:20,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:46:20,235 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 50 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:20,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 386 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-17 00:46:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2024-11-17 00:46:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2024-11-17 00:46:20,237 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 60 [2024-11-17 00:46:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:20,237 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2024-11-17 00:46:20,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2024-11-17 00:46:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-17 00:46:20,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:20,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:20,251 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-17 00:46:20,438 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,SelfDestructingSolverStorable25 [2024-11-17 00:46:20,439 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:20,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash -378763293, now seen corresponding path program 1 times [2024-11-17 00:46:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820781512] [2024-11-17 00:46:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:20,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:46:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820781512] [2024-11-17 00:46:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820781512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253685792] [2024-11-17 00:46:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:21,726 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-17 00:46:21,728 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-17 00:46:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:21,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-17 00:46:21,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:22,007 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-17 00:46:22,190 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:46:22,191 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-17 00:46:22,251 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-17 00:46:22,308 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:46:22,309 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 32 treesize of output 31 [2024-11-17 00:46:22,423 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:46:22,424 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 25 treesize of output 26 [2024-11-17 00:46:22,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-17 00:46:22,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 00:46:22,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-17 00:46:22,790 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-17 00:46:22,978 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 18 treesize of output 13 [2024-11-17 00:46:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:23,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:23,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3496 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3496) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-17 00:46:23,379 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3496 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3496) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-17 00:46:23,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3496 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3496) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-17 00:46:23,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:23,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-17 00:46:23,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:23,459 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 64 treesize of output 63 [2024-11-17 00:46:23,463 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 25 treesize of output 21 [2024-11-17 00:46:23,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3489 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3489) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-17 00:46:23,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3489 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3489) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-17 00:46:27,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:27,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-17 00:46:27,865 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 65 treesize of output 57 [2024-11-17 00:46:27,869 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 6 treesize of output 4 [2024-11-17 00:46:27,872 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 6 treesize of output 4 [2024-11-17 00:46:27,877 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 6 treesize of output 4 [2024-11-17 00:46:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2024-11-17 00:46:28,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253685792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:28,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:28,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 28] total 75 [2024-11-17 00:46:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32409458] [2024-11-17 00:46:28,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:28,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-17 00:46:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:28,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-17 00:46:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4556, Unknown=53, NotChecked=700, Total=5550 [2024-11-17 00:46:28,346 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 75 states, 74 states have (on average 2.135135135135135) internal successors, (158), 66 states have internal predecessors, (158), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:30,334 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2024-11-17 00:46:30,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-17 00:46:30,334 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.135135135135135) internal successors, (158), 66 states have internal predecessors, (158), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 64 [2024-11-17 00:46:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:30,335 INFO L225 Difference]: With dead ends: 107 [2024-11-17 00:46:30,335 INFO L226 Difference]: Without dead ends: 107 [2024-11-17 00:46:30,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=465, Invalid=7510, Unknown=55, NotChecked=900, Total=8930 [2024-11-17 00:46:30,337 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 136 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:30,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 2342 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1454 Invalid, 0 Unknown, 345 Unchecked, 0.9s Time] [2024-11-17 00:46:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-17 00:46:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-17 00:46:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 103 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2024-11-17 00:46:30,340 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 64 [2024-11-17 00:46:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:30,340 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2024-11-17 00:46:30,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.135135135135135) internal successors, (158), 66 states have internal predecessors, (158), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2024-11-17 00:46:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 00:46:30,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:30,341 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:30,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:30,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:30,542 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:46:30,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash -434667726, now seen corresponding path program 1 times [2024-11-17 00:46:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:30,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114268480] [2024-11-17 00:46:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:31,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:46:31,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114268480] [2024-11-17 00:46:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114268480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680529357] [2024-11-17 00:46:31,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:31,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:31,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:31,443 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-17 00:46:31,444 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-17 00:46:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:31,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-17 00:46:31,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:31,712 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-17 00:46:31,857 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:46:31,858 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-17 00:46:31,922 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-17 00:46:31,970 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:46:31,970 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-17 00:46:32,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-17 00:46:32,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-17 00:46:32,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:32,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:32,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:32,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2024-11-17 00:46:32,527 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:46:32,527 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 47 treesize of output 42 [2024-11-17 00:46:32,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:32,691 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 38 treesize of output 16 [2024-11-17 00:46:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 00:46:32,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:32,868 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3699 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3699) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-17 00:46:57,632 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3698 Int) (v_ArrVal_3699 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3694))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8) v_ArrVal_3698)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3699))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-17 00:46:57,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3698 Int) (v_ArrVal_3699 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3694))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8) v_ArrVal_3698)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3699))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1))) is different from false [2024-11-17 00:46:57,700 INFO L349 Elim1Store]: treesize reduction 5, result has 90.4 percent of original size [2024-11-17 00:46:57,700 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 56 treesize of output 55 [2024-11-17 00:46:57,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3693 (Array Int Int)) (v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3698 Int) (v_ArrVal_3699 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3693) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3694))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8) v_ArrVal_3698)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3699))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-17 00:46:57,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:57,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 66 [2024-11-17 00:46:57,749 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 215 treesize of output 207 [2024-11-17 00:46:57,759 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:57,761 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 181 treesize of output 169 [2024-11-17 00:46:57,768 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:57,769 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 165 treesize of output 157 [2024-11-17 00:46:57,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:57,785 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 115 treesize of output 109 [2024-11-17 00:46:57,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-17 00:46:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 22 refuted. 2 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-17 00:46:58,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680529357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:58,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:58,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 26] total 61 [2024-11-17 00:46:58,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908930047] [2024-11-17 00:46:58,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:58,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-17 00:46:58,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:58,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-17 00:46:58,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2914, Unknown=198, NotChecked=460, Total=3782 [2024-11-17 00:46:58,227 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 62 states, 61 states have (on average 2.4754098360655736) internal successors, (151), 54 states have internal predecessors, (151), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:47:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:07,974 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2024-11-17 00:47:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:47:07,974 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.4754098360655736) internal successors, (151), 54 states have internal predecessors, (151), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 70 [2024-11-17 00:47:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:07,975 INFO L225 Difference]: With dead ends: 112 [2024-11-17 00:47:07,975 INFO L226 Difference]: Without dead ends: 112 [2024-11-17 00:47:07,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=339, Invalid=4723, Unknown=210, NotChecked=580, Total=5852 [2024-11-17 00:47:07,976 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:07,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1644 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1302 Invalid, 0 Unknown, 319 Unchecked, 0.9s Time] [2024-11-17 00:47:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-17 00:47:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-17 00:47:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 108 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:47:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2024-11-17 00:47:07,979 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 70 [2024-11-17 00:47:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:07,979 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2024-11-17 00:47:07,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.4754098360655736) internal successors, (151), 54 states have internal predecessors, (151), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:47:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-17 00:47:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 00:47:07,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:07,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:07,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-17 00:47:08,183 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-17 00:47:08,184 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:47:08,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:08,184 INFO L85 PathProgramCache]: Analyzing trace with hash -434667725, now seen corresponding path program 1 times [2024-11-17 00:47:08,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:08,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074325167] [2024-11-17 00:47:08,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:08,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:47:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:09,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074325167] [2024-11-17 00:47:09,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074325167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:09,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172174650] [2024-11-17 00:47:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:09,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:09,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:09,584 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-17 00:47:09,585 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-17 00:47:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:09,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-17 00:47:09,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:09,851 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-17 00:47:09,855 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-17 00:47:10,244 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:47:10,245 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-17 00:47:10,260 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:47:10,261 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-17 00:47:10,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:47:10,433 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-17 00:47:10,516 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:47:10,516 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 57 treesize of output 50 [2024-11-17 00:47:10,521 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 31 treesize of output 16 [2024-11-17 00:47:10,662 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:47:10,663 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 33 treesize of output 24 [2024-11-17 00:47:10,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:10,672 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-17 00:47:10,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:47:10,729 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 35 treesize of output 26 [2024-11-17 00:47:11,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:11,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:47:11,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:11,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:11,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 29 [2024-11-17 00:47:11,341 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:47:11,342 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 63 treesize of output 54 [2024-11-17 00:47:11,349 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-17 00:47:11,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-17 00:47:11,538 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 7 treesize of output 3 [2024-11-17 00:47:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 00:47:11,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:12,006 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3912 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3911 (Array Int Int)) (v_ArrVal_3912 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3911) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2024-11-17 00:47:12,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3908 (Array Int Int))) (or (not (= v_ArrVal_3908 (store .cse0 .cse1 (select v_ArrVal_3908 .cse1)))) (forall ((v_ArrVal_3910 Int) (v_ArrVal_3912 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3908) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse1 v_ArrVal_3910)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))))) (forall ((v_ArrVal_3908 (Array Int Int))) (or (not (= v_ArrVal_3908 (store .cse0 .cse1 (select v_ArrVal_3908 .cse1)))) (forall ((v_ArrVal_3910 Int) (v_ArrVal_3911 (Array Int Int)) (v_ArrVal_3912 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse1 v_ArrVal_3910)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3908) .cse3 v_ArrVal_3912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_3911) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))) is different from false [2024-11-17 00:47:12,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| Int)) (or (forall ((v_ArrVal_3908 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| 8))) (or (forall ((v_ArrVal_3910 Int) (v_ArrVal_3911 (Array Int Int)) (v_ArrVal_3912 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3908) .cse0 v_ArrVal_3912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse1 .cse2 v_ArrVal_3910)) .cse0 v_ArrVal_3911) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= (store .cse3 .cse2 (select v_ArrVal_3908 .cse2)) v_ArrVal_3908))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3908 (Array Int Int))) (or (not (= (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| 8))) (store .cse3 .cse4 (select v_ArrVal_3908 .cse4))) v_ArrVal_3908)) (forall ((v_ArrVal_3912 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3908) .cse0 v_ArrVal_3912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))))))))) is different from false [2024-11-17 00:47:12,508 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| Int)) (or (forall ((v_ArrVal_3908 (Array Int Int))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| 8))) (store .cse0 .cse1 (select v_ArrVal_3908 .cse1))) v_ArrVal_3908)) (forall ((v_ArrVal_3912 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3908) .cse2 v_ArrVal_3912) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| Int)) (or (forall ((v_ArrVal_3908 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| 8))) (or (not (= (store .cse0 .cse3 (select v_ArrVal_3908 .cse3)) v_ArrVal_3908)) (forall ((v_ArrVal_3910 Int) (v_ArrVal_3911 (Array Int Int)) (v_ArrVal_3912 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3908) .cse2 v_ArrVal_3912) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse4 .cse3 v_ArrVal_3910)) .cse2 v_ArrVal_3911) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))) is different from false [2024-11-17 00:47:12,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3908 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| 8))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3908 .cse1)) v_ArrVal_3908)) (forall ((v_ArrVal_3910 Int) (v_ArrVal_3911 (Array Int Int)) (v_ArrVal_3912 (Array Int Int))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3908) .cse2 v_ArrVal_3912) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_ArrVal_3910)) .cse2 v_ArrVal_3911) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| Int)) (or (forall ((v_ArrVal_3908 (Array Int Int))) (or (not (= (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| 8))) (store .cse0 .cse4 (select v_ArrVal_3908 .cse4))) v_ArrVal_3908)) (forall ((v_ArrVal_3912 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3908) .cse2 v_ArrVal_3912) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2024-11-17 00:47:12,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_3908 (Array Int Int)) (v_ArrVal_3910 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| Int) (v_ArrVal_3911 (Array Int Int)) (v_ArrVal_3912 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| 8))) (or (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3908) .cse0 v_ArrVal_3912) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 11) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store .cse1 .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_3910)) .cse0 v_ArrVal_3911) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_3908 (store (store .cse4 .cse2 (select v_ArrVal_3908 .cse2)) .cse3 (select v_ArrVal_3908 .cse3))))))) (forall ((v_ArrVal_3908 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| Int) (v_ArrVal_3912 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3908) .cse0 v_ArrVal_3912) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= v_ArrVal_3908 (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_59| 8))) (store (store .cse4 .cse2 (select v_ArrVal_3908 .cse2)) .cse5 (select v_ArrVal_3908 .cse5)))))))))) is different from false [2024-11-17 00:47:13,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:13,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 98 [2024-11-17 00:47:13,281 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 129 treesize of output 125 [2024-11-17 00:47:13,288 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:13,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 107 [2024-11-17 00:47:13,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,321 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:13,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 99 [2024-11-17 00:47:13,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:13,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 71 [2024-11-17 00:47:13,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:13,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-11-17 00:47:13,376 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 260 treesize of output 240 [2024-11-17 00:47:13,393 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 96 treesize of output 88 [2024-11-17 00:47:13,402 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 88 treesize of output 84 [2024-11-17 00:47:13,413 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 40 treesize of output 38 [2024-11-17 00:47:13,478 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,479 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 25 treesize of output 17 [2024-11-17 00:47:13,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,501 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 25 treesize of output 17 [2024-11-17 00:47:13,524 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,525 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 25 treesize of output 17 [2024-11-17 00:47:13,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,543 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 25 treesize of output 17 [2024-11-17 00:47:13,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-17 00:47:13,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2024-11-17 00:47:13,587 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 23 treesize of output 19 [2024-11-17 00:47:13,595 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:13,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 222 [2024-11-17 00:47:13,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:13,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 178 [2024-11-17 00:47:13,620 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,621 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,623 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 60 treesize of output 52 [2024-11-17 00:47:13,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,629 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 33 treesize of output 29 [2024-11-17 00:47:13,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,635 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 42 treesize of output 34 [2024-11-17 00:47:13,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:47:13,645 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 16 treesize of output 12 [2024-11-17 00:47:13,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172174650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:13,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:13,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 47 [2024-11-17 00:47:13,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358535617] [2024-11-17 00:47:13,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:13,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-17 00:47:13,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:13,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-17 00:47:13,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3363, Unknown=105, NotChecked=738, Total=4422 [2024-11-17 00:47:13,939 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 48 states, 47 states have (on average 2.574468085106383) internal successors, (121), 42 states have internal predecessors, (121), 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-17 00:47:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:15,712 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2024-11-17 00:47:15,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:47:15,712 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.574468085106383) internal successors, (121), 42 states have internal predecessors, (121), 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 70 [2024-11-17 00:47:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:15,713 INFO L225 Difference]: With dead ends: 112 [2024-11-17 00:47:15,713 INFO L226 Difference]: Without dead ends: 112 [2024-11-17 00:47:15,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=356, Invalid=5555, Unknown=119, NotChecked=942, Total=6972 [2024-11-17 00:47:15,715 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 85 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:15,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 2034 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:47:15,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-17 00:47:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-17 00:47:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 107 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:47:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2024-11-17 00:47:15,717 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 70 [2024-11-17 00:47:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:15,718 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2024-11-17 00:47:15,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.574468085106383) internal successors, (121), 42 states have internal predecessors, (121), 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-17 00:47:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2024-11-17 00:47:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 00:47:15,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:15,718 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:15,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-17 00:47:15,922 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-17 00:47:15,922 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:47:15,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2066273032, now seen corresponding path program 1 times [2024-11-17 00:47:15,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:15,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940946079] [2024-11-17 00:47:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:15,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:15,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:47:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:47:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940946079] [2024-11-17 00:47:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940946079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451039118] [2024-11-17 00:47:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:16,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:16,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:16,010 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-17 00:47:16,012 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-17 00:47:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:16,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:47:16,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:47:16,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:47:16,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451039118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:47:16,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:47:16,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-17 00:47:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936042004] [2024-11-17 00:47:16,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:16,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:47:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:47:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:47:16,334 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:47:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:16,415 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2024-11-17 00:47:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:47:16,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2024-11-17 00:47:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:16,416 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:47:16,416 INFO L226 Difference]: Without dead ends: 111 [2024-11-17 00:47:16,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:47:16,417 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 36 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:16,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 420 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-17 00:47:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-17 00:47:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 107 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:47:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2024-11-17 00:47:16,419 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 72 [2024-11-17 00:47:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:16,420 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2024-11-17 00:47:16,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:47:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2024-11-17 00:47:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-17 00:47:16,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:16,420 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:16,434 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-17 00:47:16,621 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-17 00:47:16,624 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:47:16,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash 83438036, now seen corresponding path program 2 times [2024-11-17 00:47:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:16,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340562658] [2024-11-17 00:47:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:16,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:16,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:47:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:47:16,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340562658] [2024-11-17 00:47:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340562658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134930122] [2024-11-17 00:47:16,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:47:16,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:16,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:16,738 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-17 00:47:16,746 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-17 00:47:17,116 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:47:17,116 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:47:17,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:47:17,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-17 00:47:17,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-17 00:47:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134930122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:47:17,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:47:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-11-17 00:47:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260823764] [2024-11-17 00:47:17,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:17,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:47:17,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:17,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:47:17,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:47:17,231 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:47:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:17,363 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2024-11-17 00:47:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:47:17,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2024-11-17 00:47:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:17,364 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:47:17,364 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:47:17,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:47:17,365 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 38 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:17,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 378 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:47:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-17 00:47:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:47:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2024-11-17 00:47:17,367 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 74 [2024-11-17 00:47:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:17,367 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2024-11-17 00:47:17,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:47:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2024-11-17 00:47:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 00:47:17,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:17,368 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:17,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-17 00:47:17,568 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-17 00:47:17,569 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:47:17,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1749703978, now seen corresponding path program 1 times [2024-11-17 00:47:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511886066] [2024-11-17 00:47:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:47:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:47:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511886066] [2024-11-17 00:47:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511886066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979706573] [2024-11-17 00:47:19,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:19,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:19,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:19,278 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-17 00:47:19,279 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-17 00:47:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:19,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-17 00:47:19,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:19,625 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-17 00:47:19,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:47:19,859 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-17 00:47:19,935 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-17 00:47:19,993 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:47:19,993 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 32 treesize of output 31 [2024-11-17 00:47:20,086 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:47:20,087 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 24 treesize of output 17 [2024-11-17 00:47:20,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-17 00:47:20,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:20,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:20,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 24 [2024-11-17 00:47:20,699 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:47:20,700 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 81 treesize of output 70 [2024-11-17 00:47:20,708 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 25 treesize of output 17 [2024-11-17 00:47:20,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:20,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-11-17 00:47:21,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-17 00:47:21,130 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 21 treesize of output 13 [2024-11-17 00:47:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:47:21,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:21,762 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 76 treesize of output 56 [2024-11-17 00:47:21,769 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4502 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4502) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_4501 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4501) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2024-11-17 00:47:21,788 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4501 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4501) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_4502 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4502) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2024-11-17 00:47:21,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:21,800 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 38 treesize of output 37 [2024-11-17 00:47:21,803 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 13 treesize of output 11 [2024-11-17 00:47:22,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4496 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4496) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2024-11-17 00:47:22,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4495) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4496) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-17 00:47:22,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:47:22,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-17 00:47:22,452 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 65 treesize of output 57 [2024-11-17 00:47:22,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-17 00:47:22,459 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 6 treesize of output 4 [2024-11-17 00:47:22,471 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 6 treesize of output 4 [2024-11-17 00:47:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-17 00:47:23,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979706573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:47:23,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:47:23,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 31] total 88 [2024-11-17 00:47:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835898404] [2024-11-17 00:47:23,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:23,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-11-17 00:47:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-11-17 00:47:23,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=6686, Unknown=25, NotChecked=668, Total=7656 [2024-11-17 00:47:23,069 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 88 states, 87 states have (on average 2.2758620689655173) internal successors, (198), 79 states have internal predecessors, (198), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:47:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:25,769 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2024-11-17 00:47:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-17 00:47:25,769 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 2.2758620689655173) internal successors, (198), 79 states have internal predecessors, (198), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 76 [2024-11-17 00:47:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:25,770 INFO L225 Difference]: With dead ends: 97 [2024-11-17 00:47:25,770 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 00:47:25,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 112 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2477 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=556, Invalid=11425, Unknown=25, NotChecked=876, Total=12882 [2024-11-17 00:47:25,771 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 95 mSDsluCounter, 2850 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:25,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 2911 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2068 Invalid, 0 Unknown, 259 Unchecked, 1.3s Time] [2024-11-17 00:47:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 00:47:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-17 00:47:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.144578313253012) internal successors, (95), 93 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:47:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2024-11-17 00:47:25,774 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 76 [2024-11-17 00:47:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:25,774 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2024-11-17 00:47:25,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 87 states have (on average 2.2758620689655173) internal successors, (198), 79 states have internal predecessors, (198), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:47:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2024-11-17 00:47:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 00:47:25,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:25,775 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:25,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-17 00:47:25,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:25,980 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:47:25,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2051039062, now seen corresponding path program 1 times [2024-11-17 00:47:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:25,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276886996] [2024-11-17 00:47:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:26,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:47:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 00:47:26,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:26,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276886996] [2024-11-17 00:47:26,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276886996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:26,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:26,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:47:26,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588437461] [2024-11-17 00:47:26,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:26,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:47:26,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:26,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:47:26,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:47:26,184 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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-17 00:47:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:26,340 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2024-11-17 00:47:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:47:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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 78 [2024-11-17 00:47:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:26,343 INFO L225 Difference]: With dead ends: 114 [2024-11-17 00:47:26,343 INFO L226 Difference]: Without dead ends: 114 [2024-11-17 00:47:26,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:47:26,343 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 20 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:26,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 358 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:47:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-17 00:47:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2024-11-17 00:47:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:47:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-17 00:47:26,347 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 78 [2024-11-17 00:47:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:26,348 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-17 00:47:26,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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-17 00:47:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-17 00:47:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 00:47:26,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:26,348 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:26,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-17 00:47:26,349 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2024-11-17 00:47:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2051039061, now seen corresponding path program 1 times [2024-11-17 00:47:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240978879] [2024-11-17 00:47:26,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat