./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c -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 e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:37:33,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:37:33,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:37:33,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:37:33,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:37:33,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:37:33,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:37:33,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:37:33,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:37:33,626 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:37:33,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:37:33,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:37:33,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:37:33,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:37:33,628 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:37:33,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:37:33,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:37:33,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:37:33,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:37:33,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:37:33,629 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:37:33,630 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:37:33,630 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:37:33,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:37:33,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:37:33,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:37:33,631 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:37:33,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:37:33,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:37:33,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:37:33,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:37:33,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:37:33,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:37:33,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:37:33,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:37:33,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:37:33,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:37:33,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:37:33,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:37:33,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:37:33,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:37:33,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:37:33,638 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 -> e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f [2024-10-13 10:37:33,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:37:33,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:37:33,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:37:33,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:37:33,905 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:37:33,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2024-10-13 10:37:35,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:37:35,256 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:37:35,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2024-10-13 10:37:35,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3cdac278/c3e245de68bd4d3ab9bfd5f473d119ae/FLAG51a12e827 [2024-10-13 10:37:35,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3cdac278/c3e245de68bd4d3ab9bfd5f473d119ae [2024-10-13 10:37:35,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:37:35,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:37:35,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:37:35,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:37:35,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:37:35,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1998f6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35, skipping insertion in model container [2024-10-13 10:37:35,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:37:35,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:37:35,460 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:37:35,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:37:35,493 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:37:35,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35 WrapperNode [2024-10-13 10:37:35,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:37:35,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:37:35,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:37:35,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:37:35,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,533 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2024-10-13 10:37:35,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:37:35,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:37:35,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:37:35,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:37:35,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,566 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 4 writes are split as follows [0, 4]. [2024-10-13 10:37:35,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:37:35,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:37:35,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:37:35,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:37:35,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (1/1) ... [2024-10-13 10:37:35,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:37:35,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:35,616 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-10-13 10:37:35,622 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-10-13 10:37:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:37:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:37:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:37:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:37:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:37:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2024-10-13 10:37:35,656 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2024-10-13 10:37:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:37:35,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:37:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:37:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:37:35,725 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:37:35,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:37:35,960 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-13 10:37:35,960 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:37:35,997 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:37:35,997 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 10:37:35,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:35 BoogieIcfgContainer [2024-10-13 10:37:35,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:37:35,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:37:35,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:37:36,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:37:36,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:37:35" (1/3) ... [2024-10-13 10:37:36,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a20f02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:37:36, skipping insertion in model container [2024-10-13 10:37:36,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:35" (2/3) ... [2024-10-13 10:37:36,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a20f02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:37:36, skipping insertion in model container [2024-10-13 10:37:36,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:35" (3/3) ... [2024-10-13 10:37:36,003 INFO L112 eAbstractionObserver]: Analyzing ICFG test22-1.c [2024-10-13 10:37:36,015 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:37:36,015 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-13 10:37:36,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:37:36,051 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;@72892cb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:37:36,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-10-13 10:37:36,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 39 states have internal predecessors, (44), 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-10-13 10:37:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:37:36,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:36,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:37:36,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash 3974, now seen corresponding path program 1 times [2024-10-13 10:37:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:36,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094358471] [2024-10-13 10:37:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:36,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094358471] [2024-10-13 10:37:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094358471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:36,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:37:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118980023] [2024-10-13 10:37:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:36,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:36,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:36,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:36,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:36,287 INFO L87 Difference]: Start difference. First operand has 44 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:37:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:36,332 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-10-13 10:37:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:37:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:36,341 INFO L225 Difference]: With dead ends: 42 [2024-10-13 10:37:36,341 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 10:37:36,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:36,347 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:36,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 25 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:36,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 10:37:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 10:37:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 36 states have internal predecessors, (39), 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-10-13 10:37:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-10-13 10:37:36,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 2 [2024-10-13 10:37:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:36,374 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-10-13 10:37:36,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:37:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-10-13 10:37:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:37:36,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:36,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:37:36,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:37:36,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash 3975, now seen corresponding path program 1 times [2024-10-13 10:37:36,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:36,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365993890] [2024-10-13 10:37:36,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:36,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:36,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:36,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365993890] [2024-10-13 10:37:36,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365993890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:36,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:36,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:37:36,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131413813] [2024-10-13 10:37:36,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:36,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:36,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:36,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:36,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:36,460 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:37:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:36,499 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-10-13 10:37:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:36,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:37:36,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:36,504 INFO L225 Difference]: With dead ends: 39 [2024-10-13 10:37:36,504 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 10:37:36,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:36,505 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:36,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 10:37:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-13 10:37:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 34 states have internal predecessors, (37), 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-10-13 10:37:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-10-13 10:37:36,515 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 2 [2024-10-13 10:37:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:36,515 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-10-13 10:37:36,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:37:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-10-13 10:37:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:37:36,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:36,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:37:36,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:37:36,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:36,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash 3907626, now seen corresponding path program 1 times [2024-10-13 10:37:36,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:36,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713990311] [2024-10-13 10:37:36,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:36,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713990311] [2024-10-13 10:37:36,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713990311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:36,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:36,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:37:36,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645353092] [2024-10-13 10:37:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:36,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:36,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:36,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:36,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:36,606 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:37:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:36,634 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-10-13 10:37:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:36,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:37:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:36,636 INFO L225 Difference]: With dead ends: 37 [2024-10-13 10:37:36,636 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 10:37:36,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:36,637 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:36,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:36,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 10:37:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-13 10:37:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 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-10-13 10:37:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-10-13 10:37:36,646 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 4 [2024-10-13 10:37:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:36,646 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-13 10:37:36,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:37:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-10-13 10:37:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:37:36,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:36,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:37:36,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:37:36,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:36,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash 3907627, now seen corresponding path program 1 times [2024-10-13 10:37:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720064471] [2024-10-13 10:37:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:37:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720064471] [2024-10-13 10:37:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720064471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:36,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:37:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436516539] [2024-10-13 10:37:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:36,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:36,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:36,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:36,728 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:37:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:36,753 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-13 10:37:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:36,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:37:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:36,754 INFO L225 Difference]: With dead ends: 35 [2024-10-13 10:37:36,755 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 10:37:36,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:36,756 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:36,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 24 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 10:37:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 10:37:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 30 states have internal predecessors, (33), 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-10-13 10:37:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-13 10:37:36,761 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 4 [2024-10-13 10:37:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:36,761 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-13 10:37:36,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:37:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-13 10:37:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:37:36,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:36,762 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:36,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:37:36,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:36,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:36,763 INFO L85 PathProgramCache]: Analyzing trace with hash -149086896, now seen corresponding path program 1 times [2024-10-13 10:37:36,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:36,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979285784] [2024-10-13 10:37:36,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:36,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:36,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:37,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:37:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979285784] [2024-10-13 10:37:37,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979285784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386214135] [2024-10-13 10:37:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:37,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:37,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:37,058 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-10-13 10:37:37,059 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-10-13 10:37:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:37,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:37:37,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:37:37,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:37:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386214135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:37,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:37,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 9] total 18 [2024-10-13 10:37:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615489408] [2024-10-13 10:37:37,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:37,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:37:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:37,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:37:37,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:37:37,661 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 19 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-13 10:37:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:37,800 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-10-13 10:37:37,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:37:37,800 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 19 [2024-10-13 10:37:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:37,801 INFO L225 Difference]: With dead ends: 36 [2024-10-13 10:37:37,801 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 10:37:37,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:37:37,802 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 113 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:37,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 77 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 10:37:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-10-13 10:37:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 28 states have internal predecessors, (31), 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-10-13 10:37:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-10-13 10:37:37,805 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2024-10-13 10:37:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:37,806 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-10-13 10:37:37,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-13 10:37:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-10-13 10:37:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:37:37,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:37,807 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:37,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:37:38,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:38,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:38,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:38,012 INFO L85 PathProgramCache]: Analyzing trace with hash -149086895, now seen corresponding path program 1 times [2024-10-13 10:37:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:38,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796311889] [2024-10-13 10:37:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:38,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:38,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:37:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796311889] [2024-10-13 10:37:38,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796311889] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693214117] [2024-10-13 10:37:38,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:38,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:38,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:38,397 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-10-13 10:37:38,397 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-10-13 10:37:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:38,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:37:38,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:37:38,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:37:39,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693214117] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:39,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:39,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 8] total 19 [2024-10-13 10:37:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370348240] [2024-10-13 10:37:39,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:39,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 10:37:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:39,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 10:37:39,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:37:39,248 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 20 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 17 states have internal predecessors, (36), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-13 10:37:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:39,477 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-10-13 10:37:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:37:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 17 states have internal predecessors, (36), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 19 [2024-10-13 10:37:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:39,480 INFO L225 Difference]: With dead ends: 34 [2024-10-13 10:37:39,480 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 10:37:39,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:37:39,481 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 134 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:39,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 79 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 10:37:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-13 10:37:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 26 states have internal predecessors, (29), 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-10-13 10:37:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-13 10:37:39,487 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2024-10-13 10:37:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:39,487 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-13 10:37:39,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 17 states have internal predecessors, (36), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-13 10:37:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-13 10:37:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:37:39,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:39,488 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:39,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:37:39,694 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,SelfDestructingSolverStorable5 [2024-10-13 10:37:39,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:39,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1538396517, now seen corresponding path program 1 times [2024-10-13 10:37:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890307826] [2024-10-13 10:37:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:39,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890307826] [2024-10-13 10:37:39,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890307826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:39,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:39,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:37:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464028367] [2024-10-13 10:37:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:39,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:39,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:39,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:39,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:39,743 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:39,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:39,761 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-10-13 10:37:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:39,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-10-13 10:37:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:39,762 INFO L225 Difference]: With dead ends: 32 [2024-10-13 10:37:39,762 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 10:37:39,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:39,763 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:39,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 10:37:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 10:37:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 27 states have internal predecessors, (30), 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-10-13 10:37:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-13 10:37:39,766 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2024-10-13 10:37:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:39,766 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-13 10:37:39,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-13 10:37:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:37:39,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:39,767 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:39,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:37:39,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:39,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1538365701, now seen corresponding path program 1 times [2024-10-13 10:37:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129871872] [2024-10-13 10:37:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:39,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:39,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129871872] [2024-10-13 10:37:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129871872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:37:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760275725] [2024-10-13 10:37:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:39,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:39,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:39,805 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:39,821 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-10-13 10:37:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:39,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-10-13 10:37:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:39,821 INFO L225 Difference]: With dead ends: 31 [2024-10-13 10:37:39,821 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 10:37:39,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:39,822 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:39,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 10:37:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 10:37:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 23 states have internal predecessors, (24), 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-10-13 10:37:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-10-13 10:37:39,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2024-10-13 10:37:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:39,824 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-13 10:37:39,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-10-13 10:37:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:37:39,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:39,825 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:39,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:37:39,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:39,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash -449495937, now seen corresponding path program 1 times [2024-10-13 10:37:39,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:39,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964489821] [2024-10-13 10:37:39,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:39,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:39,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:39,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964489821] [2024-10-13 10:37:39,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964489821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:39,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:39,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:37:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939563134] [2024-10-13 10:37:39,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:39,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:37:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:37:39,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:37:39,906 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:39,945 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-13 10:37:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:37:39,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-10-13 10:37:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:39,946 INFO L225 Difference]: With dead ends: 27 [2024-10-13 10:37:39,946 INFO L226 Difference]: Without dead ends: 27 [2024-10-13 10:37:39,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:37:39,946 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:39,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-13 10:37:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-13 10:37:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 22 states have internal predecessors, (23), 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-10-13 10:37:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-10-13 10:37:39,949 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2024-10-13 10:37:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:39,949 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-10-13 10:37:39,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-10-13 10:37:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:37:39,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:39,950 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:39,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:37:39,950 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:39,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash -449495936, now seen corresponding path program 1 times [2024-10-13 10:37:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:39,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275200650] [2024-10-13 10:37:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:37:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:40,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275200650] [2024-10-13 10:37:40,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275200650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:40,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965408685] [2024-10-13 10:37:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:40,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:40,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:40,184 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-10-13 10:37:40,185 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-10-13 10:37:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:37:40,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:40,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:37:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965408685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:40,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:37:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-13 10:37:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363029602] [2024-10-13 10:37:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:40,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:37:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:37:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:37:40,393 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:40,452 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-10-13 10:37:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:37:40,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-10-13 10:37:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:40,453 INFO L225 Difference]: With dead ends: 26 [2024-10-13 10:37:40,453 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 10:37:40,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:37:40,454 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:40,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 55 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 10:37:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-13 10:37:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 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-10-13 10:37:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-10-13 10:37:40,457 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2024-10-13 10:37:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:40,457 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-13 10:37:40,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-10-13 10:37:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:37:40,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:40,458 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:40,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:37:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:40,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:40,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash 774594780, now seen corresponding path program 1 times [2024-10-13 10:37:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216577935] [2024-10-13 10:37:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:40,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:40,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216577935] [2024-10-13 10:37:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216577935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:40,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:40,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:37:40,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871760913] [2024-10-13 10:37:40,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:40,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:37:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:40,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:37:40,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:37:40,769 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:40,815 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-10-13 10:37:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:37:40,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-13 10:37:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:40,816 INFO L225 Difference]: With dead ends: 28 [2024-10-13 10:37:40,816 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 10:37:40,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:37:40,816 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:40,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 10:37:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 10:37:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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-10-13 10:37:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-10-13 10:37:40,819 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2024-10-13 10:37:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:40,819 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-13 10:37:40,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-10-13 10:37:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:37:40,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:40,821 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:40,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:37:40,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:40,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1357754019, now seen corresponding path program 1 times [2024-10-13 10:37:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:40,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545685086] [2024-10-13 10:37:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:40,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:40,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545685086] [2024-10-13 10:37:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545685086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839622436] [2024-10-13 10:37:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:40,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:40,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:40,994 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-10-13 10:37:40,994 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-10-13 10:37:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:41,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 10:37:41,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:41,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:37:41,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839622436] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:41,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:37:41,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 6] total 16 [2024-10-13 10:37:41,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367905694] [2024-10-13 10:37:41,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:41,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:37:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:41,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:37:41,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:37:41,244 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:41,272 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-13 10:37:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:37:41,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-13 10:37:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:41,272 INFO L225 Difference]: With dead ends: 27 [2024-10-13 10:37:41,272 INFO L226 Difference]: Without dead ends: 27 [2024-10-13 10:37:41,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:37:41,273 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:41,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-13 10:37:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-13 10:37:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 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-10-13 10:37:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-10-13 10:37:41,275 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 27 [2024-10-13 10:37:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:41,275 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-10-13 10:37:41,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:41,275 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-10-13 10:37:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:37:41,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:41,276 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:41,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 10:37:41,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:41,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:41,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1357754018, now seen corresponding path program 1 times [2024-10-13 10:37:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:41,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172083929] [2024-10-13 10:37:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:41,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:41,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:41,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:41,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:41,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172083929] [2024-10-13 10:37:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172083929] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:41,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126622444] [2024-10-13 10:37:41,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:41,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:41,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:41,569 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-10-13 10:37:41,570 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-10-13 10:37:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:41,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:37:41,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:37:41,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:37:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126622444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:41,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:37:41,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2024-10-13 10:37:41,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087124656] [2024-10-13 10:37:41,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:41,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:37:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:37:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:37:41,639 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:41,658 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-10-13 10:37:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:37:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-13 10:37:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:41,659 INFO L225 Difference]: With dead ends: 26 [2024-10-13 10:37:41,659 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 10:37:41,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:37:41,660 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:41,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 10:37:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-13 10:37:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-10-13 10:37:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-10-13 10:37:41,662 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 27 [2024-10-13 10:37:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:41,664 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-13 10:37:41,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-10-13 10:37:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:37:41,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:41,665 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:41,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:37:41,865 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,SelfDestructingSolverStorable12 [2024-10-13 10:37:41,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:41,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash -868405904, now seen corresponding path program 1 times [2024-10-13 10:37:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:41,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544557939] [2024-10-13 10:37:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544557939] [2024-10-13 10:37:42,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544557939] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771582223] [2024-10-13 10:37:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:42,056 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-10-13 10:37:42,057 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-10-13 10:37:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:37:42,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:42,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 10:37:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:42,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:42,297 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 10:37:42,297 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 13 treesize of output 13 [2024-10-13 10:37:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:42,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771582223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:42,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:42,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2024-10-13 10:37:42,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779604023] [2024-10-13 10:37:42,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:42,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 10:37:42,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:42,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 10:37:42,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:37:42,319 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:42,497 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-10-13 10:37:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:37:42,498 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-13 10:37:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:42,498 INFO L225 Difference]: With dead ends: 32 [2024-10-13 10:37:42,499 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 10:37:42,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:37:42,499 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:42,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 103 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 10:37:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 10:37:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-10-13 10:37:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-10-13 10:37:42,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2024-10-13 10:37:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:42,502 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-10-13 10:37:42,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-10-13 10:37:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 10:37:42,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:42,502 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:42,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:37:42,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:42,704 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:42,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash 90796805, now seen corresponding path program 2 times [2024-10-13 10:37:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:42,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14366027] [2024-10-13 10:37:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:42,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14366027] [2024-10-13 10:37:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14366027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:42,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751067094] [2024-10-13 10:37:42,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:37:42,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:42,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:42,923 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-10-13 10:37:42,924 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-10-13 10:37:42,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:37:42,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:37:42,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:37:42,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:43,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 10:37:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:43,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:43,348 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 10:37:43,348 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 13 treesize of output 13 [2024-10-13 10:37:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:43,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751067094] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:43,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:43,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2024-10-13 10:37:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721694192] [2024-10-13 10:37:43,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:43,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-13 10:37:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-13 10:37:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:37:43,375 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:43,707 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2024-10-13 10:37:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 10:37:43,708 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-13 10:37:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:43,708 INFO L225 Difference]: With dead ends: 44 [2024-10-13 10:37:43,708 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 10:37:43,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=462, Invalid=1260, Unknown=0, NotChecked=0, Total=1722 [2024-10-13 10:37:43,709 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:43,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 111 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 10:37:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-13 10:37:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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-10-13 10:37:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-10-13 10:37:43,712 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 35 [2024-10-13 10:37:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:43,712 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-10-13 10:37:43,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-10-13 10:37:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 10:37:43,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:43,716 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:43,729 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-10-13 10:37:43,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:43,917 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-13 10:37:43,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2143159023, now seen corresponding path program 3 times [2024-10-13 10:37:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:43,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637009196] [2024-10-13 10:37:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:37:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 10:37:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:44,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:37:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:37:44,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:44,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637009196] [2024-10-13 10:37:44,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637009196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:44,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301435596] [2024-10-13 10:37:44,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:37:44,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:44,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:44,457 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-10-13 10:37:44,465 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-10-13 10:37:44,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 10:37:44,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:37:44,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 10:37:44,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-13 10:37:44,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:45,007 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 10:37:45,007 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 47 treesize of output 30 [2024-10-13 10:37:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-13 10:37:45,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301435596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:45,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:45,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 11] total 33 [2024-10-13 10:37:45,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992180073] [2024-10-13 10:37:45,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:45,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 10:37:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:45,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 10:37:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 10:37:45,074 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 33 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:45,723 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-10-13 10:37:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-13 10:37:45,724 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-10-13 10:37:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:45,725 INFO L225 Difference]: With dead ends: 42 [2024-10-13 10:37:45,726 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 10:37:45,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=328, Invalid=2642, Unknown=0, NotChecked=0, Total=2970 [2024-10-13 10:37:45,729 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:45,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 103 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:37:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 10:37:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 10:37:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:37:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 10:37:45,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-10-13 10:37:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:45,730 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 10:37:45,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:37:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 10:37:45,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 10:37:45,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 18 remaining) [2024-10-13 10:37:45,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2024-10-13 10:37:45,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2024-10-13 10:37:45,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2024-10-13 10:37:45,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2024-10-13 10:37:45,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2024-10-13 10:37:45,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2024-10-13 10:37:45,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2024-10-13 10:37:45,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2024-10-13 10:37:45,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2024-10-13 10:37:45,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2024-10-13 10:37:45,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2024-10-13 10:37:45,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2024-10-13 10:37:45,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2024-10-13 10:37:45,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2024-10-13 10:37:45,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2024-10-13 10:37:45,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (1 of 18 remaining) [2024-10-13 10:37:45,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2024-10-13 10:37:45,750 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-10-13 10:37:45,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 10:37:45,944 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:45,946 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:37:45,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:37:45 BoogieIcfgContainer [2024-10-13 10:37:45,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:37:45,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:37:45,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:37:45,948 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:37:45,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:35" (3/4) ... [2024-10-13 10:37:45,950 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:37:45,952 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2024-10-13 10:37:45,955 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-13 10:37:45,956 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 10:37:45,956 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 10:37:45,956 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 10:37:46,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:37:46,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:37:46,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:37:46,018 INFO L158 Benchmark]: Toolchain (without parser) took 10737.68ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 136.7MB in the beginning and 103.9MB in the end (delta: 32.8MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2024-10-13 10:37:46,018 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:37:46,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.00ms. Allocated memory is still 169.9MB. Free memory was 135.8MB in the beginning and 123.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:37:46,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.93ms. Allocated memory is still 169.9MB. Free memory was 123.2MB in the beginning and 122.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:37:46,018 INFO L158 Benchmark]: Boogie Preprocessor took 49.25ms. Allocated memory is still 169.9MB. Free memory was 122.1MB in the beginning and 120.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:37:46,019 INFO L158 Benchmark]: RCFGBuilder took 412.89ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 126.4MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 10:37:46,019 INFO L158 Benchmark]: TraceAbstraction took 9948.68ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 126.4MB in the beginning and 109.9MB in the end (delta: 16.5MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. [2024-10-13 10:37:46,019 INFO L158 Benchmark]: Witness Printer took 69.41ms. Allocated memory is still 257.9MB. Free memory was 109.9MB in the beginning and 103.9MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:37:46,020 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.00ms. Allocated memory is still 169.9MB. Free memory was 135.8MB in the beginning and 123.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.93ms. Allocated memory is still 169.9MB. Free memory was 123.2MB in the beginning and 122.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.25ms. Allocated memory is still 169.9MB. Free memory was 122.1MB in the beginning and 120.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.89ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 126.4MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9948.68ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 126.4MB in the beginning and 109.9MB in the end (delta: 16.5MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. * Witness Printer took 69.41ms. Allocated memory is still 257.9MB. Free memory was 109.9MB in the beginning and 103.9MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 32]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 854 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 577 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1633 IncrementalHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 277 mSDtfsCounter, 1633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 551 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 697 ConstructedInterpolants, 0 QuantifiedInterpolants, 4898 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1414 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 328/562 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:37:46,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE