./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:06:36,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:06:36,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:06:36,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:06:36,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:06:36,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:06:36,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:06:36,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:06:36,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:06:36,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:06:36,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:06:36,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:06:36,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:06:36,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:06:36,647 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:06:36,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:06:36,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:06:36,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:06:36,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:06:36,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:06:36,649 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:06:36,649 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:06:36,650 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:06:36,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:06:36,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:06:36,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:06:36,651 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:06:36,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:06:36,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:06:36,652 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:06:36,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:06:36,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:06:36,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:06:36,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:06:36,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:06:36,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:06:36,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:06:36,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:06:36,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:06:36,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:06:36,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:06:36,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:06:36,657 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-11-10 15:06:36,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:06:36,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:06:36,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:06:36,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:06:36,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:06:36,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-10 15:06:38,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:06:38,504 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:06:38,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-10 15:06:38,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6c6d06b3/f600783037ab49ec8dd0e1279c43ed1e/FLAGef49db0dd [2024-11-10 15:06:38,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6c6d06b3/f600783037ab49ec8dd0e1279c43ed1e [2024-11-10 15:06:38,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:06:38,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:06:38,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:06:38,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:06:38,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:06:38,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136ff899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38, skipping insertion in model container [2024-11-10 15:06:38,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:06:38,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:06:38,768 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:06:38,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:06:38,806 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:06:38,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38 WrapperNode [2024-11-10 15:06:38,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:06:38,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:06:38,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:06:38,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:06:38,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,842 INFO L138 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2024-11-10 15:06:38,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:06:38,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:06:38,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:06:38,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:06:38,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,869 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-10 15:06:38,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:06:38,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:06:38,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:06:38,888 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:06:38,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (1/1) ... [2024-11-10 15:06:38,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:06:38,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:06:38,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:06:38,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:06:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:06:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 15:06:38,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 15:06:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:06:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:06:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-10 15:06:38,987 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-10 15:06:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:06:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:06:38,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:06:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:06:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:06:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 15:06:38,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 15:06:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:06:39,094 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:06:39,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:06:39,390 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-10 15:06:39,390 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:06:39,410 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:06:39,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:06:39,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:39 BoogieIcfgContainer [2024-11-10 15:06:39,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:06:39,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:06:39,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:06:39,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:06:39,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:06:38" (1/3) ... [2024-11-10 15:06:39,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8cb23b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:06:39, skipping insertion in model container [2024-11-10 15:06:39,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:38" (2/3) ... [2024-11-10 15:06:39,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8cb23b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:06:39, skipping insertion in model container [2024-11-10 15:06:39,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:39" (3/3) ... [2024-11-10 15:06:39,422 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-11-10 15:06:39,440 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:06:39,441 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-11-10 15:06:39,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:06:39,504 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;@44dcd93a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:06:39,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-10 15:06:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 56 states have internal predecessors, (60), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:06:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:06:39,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:39,517 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:39,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:39,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2047846124, now seen corresponding path program 1 times [2024-11-10 15:06:39,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:39,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467327895] [2024-11-10 15:06:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:40,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:40,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:06:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467327895] [2024-11-10 15:06:40,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467327895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:40,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:40,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:06:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907377889] [2024-11-10 15:06:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:40,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:06:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:06:40,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:06:40,077 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 56 states have internal predecessors, (60), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:06:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:40,278 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2024-11-10 15:06:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:06:40,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-10 15:06:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:40,287 INFO L225 Difference]: With dead ends: 111 [2024-11-10 15:06:40,287 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 15:06:40,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:06:40,292 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 42 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:40,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 338 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 15:06:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 87. [2024-11-10 15:06:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 69 states have internal predecessors, (80), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 15:06:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2024-11-10 15:06:40,339 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 22 [2024-11-10 15:06:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:40,340 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2024-11-10 15:06:40,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:06:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2024-11-10 15:06:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:06:40,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:40,345 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:40,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:06:40,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:40,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:40,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2046270597, now seen corresponding path program 1 times [2024-11-10 15:06:40,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:40,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735273636] [2024-11-10 15:06:40,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:06:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:06:40,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:40,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735273636] [2024-11-10 15:06:40,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735273636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:40,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:40,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:06:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125053243] [2024-11-10 15:06:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:40,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:06:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:06:40,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:06:40,560 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:06:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:40,628 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-11-10 15:06:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:06:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-10 15:06:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:40,630 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:06:40,630 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:06:40,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:06:40,632 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:40,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 137 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:06:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:06:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 66 states have internal predecessors, (77), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 15:06:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2024-11-10 15:06:40,647 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 22 [2024-11-10 15:06:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:40,647 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-11-10 15:06:40,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:06:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2024-11-10 15:06:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:06:40,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:40,649 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:40,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:06:40,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:40,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2046270598, now seen corresponding path program 1 times [2024-11-10 15:06:40,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:40,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140704890] [2024-11-10 15:06:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:40,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:41,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:06:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:06:41,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:41,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140704890] [2024-11-10 15:06:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140704890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:41,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:41,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:06:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035113594] [2024-11-10 15:06:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:06:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:06:41,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:06:41,163 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:06:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:41,453 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2024-11-10 15:06:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:06:41,454 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-10 15:06:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:41,455 INFO L225 Difference]: With dead ends: 90 [2024-11-10 15:06:41,455 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 15:06:41,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:06:41,456 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:41,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 367 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:06:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 15:06:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-11-10 15:06:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 69 states have internal predecessors, (80), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-10 15:06:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-11-10 15:06:41,476 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 22 [2024-11-10 15:06:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:41,476 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-10 15:06:41,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:06:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-11-10 15:06:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:06:41,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:41,477 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:41,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:06:41,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:41,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash -628978269, now seen corresponding path program 1 times [2024-11-10 15:06:41,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:41,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741886600] [2024-11-10 15:06:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:41,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:41,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:41,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:06:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:06:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:41,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741886600] [2024-11-10 15:06:41,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741886600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:41,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:41,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:06:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042935327] [2024-11-10 15:06:41,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:41,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:06:41,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:41,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:06:41,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:06:41,693 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:06:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:41,837 INFO L93 Difference]: Finished difference Result 117 states and 150 transitions. [2024-11-10 15:06:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:06:41,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-11-10 15:06:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:41,840 INFO L225 Difference]: With dead ends: 117 [2024-11-10 15:06:41,840 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 15:06:41,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:06:41,841 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:41,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 447 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 15:06:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2024-11-10 15:06:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 70 states have internal predecessors, (81), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-10 15:06:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2024-11-10 15:06:41,857 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 24 [2024-11-10 15:06:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:41,858 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2024-11-10 15:06:41,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:06:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2024-11-10 15:06:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:06:41,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:41,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:41,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:06:41,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:41,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash 362897865, now seen corresponding path program 1 times [2024-11-10 15:06:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006404962] [2024-11-10 15:06:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:06:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:06:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:42,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006404962] [2024-11-10 15:06:42,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006404962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:42,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:42,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:06:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347424287] [2024-11-10 15:06:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:42,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:06:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:06:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:06:42,125 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:06:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:42,285 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2024-11-10 15:06:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:06:42,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-10 15:06:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:42,286 INFO L225 Difference]: With dead ends: 93 [2024-11-10 15:06:42,286 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 15:06:42,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:06:42,288 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:42,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 483 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 15:06:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 15:06:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.4) internal successors, (84), 73 states have internal predecessors, (84), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-10 15:06:42,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2024-11-10 15:06:42,296 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 29 [2024-11-10 15:06:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:42,296 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2024-11-10 15:06:42,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:06:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2024-11-10 15:06:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:06:42,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:42,298 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:42,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:06:42,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:42,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1549413561, now seen corresponding path program 1 times [2024-11-10 15:06:42,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:42,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745306209] [2024-11-10 15:06:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:42,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:06:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:06:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:06:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745306209] [2024-11-10 15:06:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745306209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:06:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129171371] [2024-11-10 15:06:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:06:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:42,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:06:42,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:06:42,375 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:06:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:42,474 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2024-11-10 15:06:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:06:42,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2024-11-10 15:06:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:42,475 INFO L225 Difference]: With dead ends: 91 [2024-11-10 15:06:42,476 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 15:06:42,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:06:42,477 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:42,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 133 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 15:06:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-10 15:06:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 69 states have internal predecessors, (76), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-10 15:06:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-11-10 15:06:42,483 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 30 [2024-11-10 15:06:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:42,483 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-11-10 15:06:42,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:06:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-11-10 15:06:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:06:42,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:42,484 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:42,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:06:42,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:42,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1549413562, now seen corresponding path program 1 times [2024-11-10 15:06:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:42,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353054752] [2024-11-10 15:06:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:06:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:06:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:06:42,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353054752] [2024-11-10 15:06:42,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353054752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:06:42,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205712599] [2024-11-10 15:06:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:42,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:06:42,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:06:42,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:06:42,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:06:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:42,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:06:42,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:06:43,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:06:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:06:43,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:06:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:06:43,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205712599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:06:43,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:06:43,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2024-11-10 15:06:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551899104] [2024-11-10 15:06:43,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:06:43,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 15:06:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 15:06:43,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-10 15:06:43,771 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 23 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-10 15:06:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:44,686 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2024-11-10 15:06:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:06:44,687 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 30 [2024-11-10 15:06:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:44,688 INFO L225 Difference]: With dead ends: 118 [2024-11-10 15:06:44,688 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 15:06:44,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=1264, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 15:06:44,689 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 255 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:44,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 345 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:06:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 15:06:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2024-11-10 15:06:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 71 states have internal predecessors, (78), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-10 15:06:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-11-10 15:06:44,700 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 30 [2024-11-10 15:06:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:44,700 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-11-10 15:06:44,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-10 15:06:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-11-10 15:06:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:06:44,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:44,701 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:44,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 15:06:44,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:06:44,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:44,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash 787180155, now seen corresponding path program 1 times [2024-11-10 15:06:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050758727] [2024-11-10 15:06:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:45,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:06:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:06:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:06:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050758727] [2024-11-10 15:06:45,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050758727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:06:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433598236] [2024-11-10 15:06:45,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:45,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:06:45,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:06:45,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:06:45,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:06:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:45,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:06:45,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:06:45,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-10 15:06:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:06:45,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:06:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:06:46,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433598236] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:06:46,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:06:46,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2024-11-10 15:06:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968780050] [2024-11-10 15:06:46,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:06:46,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:06:46,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:06:46,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-11-10 15:06:46,212 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 27 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 21 states have internal predecessors, (41), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-10 15:06:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:47,562 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2024-11-10 15:06:47,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:06:47,562 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 21 states have internal predecessors, (41), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 31 [2024-11-10 15:06:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:47,563 INFO L225 Difference]: With dead ends: 116 [2024-11-10 15:06:47,563 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 15:06:47,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=277, Invalid=1529, Unknown=0, NotChecked=0, Total=1806 [2024-11-10 15:06:47,565 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 234 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:47,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 542 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:06:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 15:06:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 91. [2024-11-10 15:06:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 70 states have internal predecessors, (76), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-10 15:06:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-11-10 15:06:47,575 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 31 [2024-11-10 15:06:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:47,575 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-11-10 15:06:47,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 21 states have internal predecessors, (41), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-10 15:06:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-11-10 15:06:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:06:47,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:47,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:47,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:06:47,777 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,SelfDestructingSolverStorable7 [2024-11-10 15:06:47,777 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 658722457, now seen corresponding path program 1 times [2024-11-10 15:06:47,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:47,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650005634] [2024-11-10 15:06:47,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:47,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:06:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 15:06:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:06:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650005634] [2024-11-10 15:06:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650005634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:47,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:47,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:06:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918675879] [2024-11-10 15:06:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:47,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:06:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:47,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:06:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:06:47,830 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:06:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:47,857 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2024-11-10 15:06:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:06:47,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-10 15:06:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:47,859 INFO L225 Difference]: With dead ends: 90 [2024-11-10 15:06:47,859 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 15:06:47,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:06:47,859 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:47,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:06:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 15:06:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 15:06:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 69 states have internal predecessors, (75), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-10 15:06:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-11-10 15:06:47,864 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 32 [2024-11-10 15:06:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:47,864 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-11-10 15:06:47,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:06:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-11-10 15:06:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:06:47,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:47,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:47,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:06:47,866 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:47,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash 558698486, now seen corresponding path program 1 times [2024-11-10 15:06:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406656538] [2024-11-10 15:06:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:06:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 15:06:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:06:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406656538] [2024-11-10 15:06:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406656538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:47,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:47,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:06:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848593751] [2024-11-10 15:06:47,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:47,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:06:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:06:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:06:47,963 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:06:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:48,008 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2024-11-10 15:06:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:06:48,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-10 15:06:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:48,009 INFO L225 Difference]: With dead ends: 89 [2024-11-10 15:06:48,010 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 15:06:48,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:06:48,010 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:48,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:06:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 15:06:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 15:06:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 53 states have internal predecessors, (58), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-10 15:06:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2024-11-10 15:06:48,018 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 36 [2024-11-10 15:06:48,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:48,018 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2024-11-10 15:06:48,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:06:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2024-11-10 15:06:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:06:48,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:48,020 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:48,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:06:48,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:48,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:48,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1298552295, now seen corresponding path program 1 times [2024-11-10 15:06:48,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:48,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107792768] [2024-11-10 15:06:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:48,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:06:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:06:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:06:48,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:48,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107792768] [2024-11-10 15:06:48,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107792768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:06:48,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621866661] [2024-11-10 15:06:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:48,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:06:48,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:06:48,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:06:48,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:06:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:06:48,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:06:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:06:48,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:06:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621866661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:48,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:06:48,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2024-11-10 15:06:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611160175] [2024-11-10 15:06:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:48,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:06:48,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:48,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:06:48,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:06:48,362 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:06:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:48,520 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-11-10 15:06:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:06:48,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-11-10 15:06:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:48,522 INFO L225 Difference]: With dead ends: 90 [2024-11-10 15:06:48,522 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 15:06:48,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:06:48,523 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:48,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 269 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 15:06:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2024-11-10 15:06:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-10 15:06:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2024-11-10 15:06:48,530 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 39 [2024-11-10 15:06:48,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:48,530 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2024-11-10 15:06:48,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:06:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2024-11-10 15:06:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:06:48,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:48,533 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:48,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 15:06:48,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:06:48,735 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:48,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1255171736, now seen corresponding path program 1 times [2024-11-10 15:06:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:48,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276682315] [2024-11-10 15:06:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:06:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:06:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:06:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:06:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:48,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276682315] [2024-11-10 15:06:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276682315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:06:48,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164067719] [2024-11-10 15:06:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:48,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:06:48,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:06:48,866 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:06:48,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:06:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:48,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:06:48,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:06:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:06:49,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:06:49,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-10 15:06:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:06:49,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164067719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:06:49,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:06:49,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 24 [2024-11-10 15:06:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482125287] [2024-11-10 15:06:49,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:06:49,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:06:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:49,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:06:49,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2024-11-10 15:06:49,509 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 24 states, 21 states have (on average 2.380952380952381) internal successors, (50), 19 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-10 15:06:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:50,193 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2024-11-10 15:06:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:06:50,193 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.380952380952381) internal successors, (50), 19 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) Word has length 39 [2024-11-10 15:06:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:50,194 INFO L225 Difference]: With dead ends: 93 [2024-11-10 15:06:50,194 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 15:06:50,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 15:06:50,195 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 154 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:50,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 390 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:06:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 15:06:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-10 15:06:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 66 states have internal predecessors, (71), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 15:06:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-10 15:06:50,201 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 39 [2024-11-10 15:06:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:50,201 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-10 15:06:50,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.380952380952381) internal successors, (50), 19 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-10 15:06:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-10 15:06:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:06:50,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:50,202 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:50,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 15:06:50,403 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-11-10 15:06:50,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:50,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash 862284774, now seen corresponding path program 1 times [2024-11-10 15:06:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:50,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998665755] [2024-11-10 15:06:50,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:50,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:06:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:06:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:50,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:06:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:06:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998665755] [2024-11-10 15:06:50,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998665755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:06:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754029586] [2024-11-10 15:06:50,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:50,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:06:50,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:06:50,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:06:50,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:06:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:50,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 15:06:50,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:06:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:06:51,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:06:51,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-10 15:06:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:06:51,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754029586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:06:51,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:06:51,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 35 [2024-11-10 15:06:51,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874165926] [2024-11-10 15:06:51,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:06:51,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 15:06:51,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:51,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 15:06:51,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 15:06:51,474 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-10 15:06:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:52,518 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2024-11-10 15:06:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:06:52,519 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 41 [2024-11-10 15:06:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:52,521 INFO L225 Difference]: With dead ends: 139 [2024-11-10 15:06:52,521 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 15:06:52,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=433, Invalid=2873, Unknown=0, NotChecked=0, Total=3306 [2024-11-10 15:06:52,522 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 230 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:52,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 634 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:06:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 15:06:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2024-11-10 15:06:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.141025641025641) internal successors, (89), 82 states have internal predecessors, (89), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 18 states have call predecessors, (20), 16 states have call successors, (20) [2024-11-10 15:06:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2024-11-10 15:06:52,535 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 41 [2024-11-10 15:06:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:52,535 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2024-11-10 15:06:52,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-10 15:06:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2024-11-10 15:06:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:06:52,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:52,537 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:52,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:06:52,737 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-11-10 15:06:52,738 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:52,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1099156598, now seen corresponding path program 1 times [2024-11-10 15:06:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:52,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287030058] [2024-11-10 15:06:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:52,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:06:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:06:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:06:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:06:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287030058] [2024-11-10 15:06:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287030058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:06:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409188288] [2024-11-10 15:06:52,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:52,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:06:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:06:52,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:06:52,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:06:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:53,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 15:06:53,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:06:53,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-11-10 15:06:53,340 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 29 treesize of output 23 [2024-11-10 15:06:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:06:53,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:06:57,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409188288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:06:57,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:06:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 27 [2024-11-10 15:06:57,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806965960] [2024-11-10 15:06:57,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:06:57,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:06:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:57,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:06:57,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2024-11-10 15:06:57,578 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-10 15:06:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:57,992 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2024-11-10 15:06:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:06:57,992 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 46 [2024-11-10 15:06:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:57,993 INFO L225 Difference]: With dead ends: 111 [2024-11-10 15:06:57,993 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 15:06:57,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=186, Invalid=1620, Unknown=0, NotChecked=0, Total=1806 [2024-11-10 15:06:57,994 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:57,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 382 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:06:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 15:06:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-10 15:06:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.125) internal successors, (90), 83 states have internal predecessors, (90), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (20), 18 states have call predecessors, (20), 16 states have call successors, (20) [2024-11-10 15:06:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2024-11-10 15:06:57,999 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 46 [2024-11-10 15:06:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:58,003 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2024-11-10 15:06:58,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-10 15:06:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2024-11-10 15:06:58,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:06:58,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:58,004 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:58,021 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-11-10 15:06:58,204 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-11-10 15:06:58,205 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:58,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1865955448, now seen corresponding path program 1 times [2024-11-10 15:06:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319285106] [2024-11-10 15:06:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:58,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:06:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 15:06:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 15:06:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 15:06:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 15:06:58,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:58,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319285106] [2024-11-10 15:06:58,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319285106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:06:58,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783862648] [2024-11-10 15:06:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:58,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:06:58,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:06:58,597 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:06:58,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:06:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:58,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:06:58,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:06:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 15:06:58,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:06:58,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:06:58,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2024-11-10 15:06:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 15:06:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783862648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:06:59,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:06:59,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 4] total 14 [2024-11-10 15:06:59,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312242726] [2024-11-10 15:06:59,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:06:59,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:06:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:59,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:06:59,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:06:59,106 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-10 15:06:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:59,500 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2024-11-10 15:06:59,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:06:59,500 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) Word has length 52 [2024-11-10 15:06:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:59,501 INFO L225 Difference]: With dead ends: 119 [2024-11-10 15:06:59,501 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 15:06:59,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:06:59,502 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 41 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:59,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 230 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:06:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 15:06:59,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2024-11-10 15:06:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.1) internal successors, (88), 82 states have internal predecessors, (88), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (20), 18 states have call predecessors, (20), 16 states have call successors, (20) [2024-11-10 15:06:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-11-10 15:06:59,507 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 52 [2024-11-10 15:06:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:59,507 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-11-10 15:06:59,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-10 15:06:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-11-10 15:06:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:06:59,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:59,508 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:59,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:06:59,712 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-11-10 15:06:59,713 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:06:59,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:59,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2113145579, now seen corresponding path program 1 times [2024-11-10 15:06:59,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:59,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707252829] [2024-11-10 15:06:59,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:59,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:59,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:06:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:59,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:06:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:59,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:06:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:00,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:07:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 15:07:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 15:07:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:00,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 15:07:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 15:07:00,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:00,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707252829] [2024-11-10 15:07:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707252829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:07:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959268939] [2024-11-10 15:07:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:00,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:07:00,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:07:00,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:07:00,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:07:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:00,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 15:07:00,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:07:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 15:07:00,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:07:00,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-10 15:07:01,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:07:01,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2024-11-10 15:07:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 15:07:01,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959268939] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:07:01,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:07:01,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2024-11-10 15:07:01,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202675454] [2024-11-10 15:07:01,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:07:01,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-10 15:07:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-10 15:07:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 15:07:01,612 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 40 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-10 15:07:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:03,767 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2024-11-10 15:07:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-10 15:07:03,768 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) Word has length 54 [2024-11-10 15:07:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:03,770 INFO L225 Difference]: With dead ends: 204 [2024-11-10 15:07:03,770 INFO L226 Difference]: Without dead ends: 186 [2024-11-10 15:07:03,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=570, Invalid=5436, Unknown=0, NotChecked=0, Total=6006 [2024-11-10 15:07:03,772 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 213 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:03,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 821 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 15:07:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-10 15:07:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 137. [2024-11-10 15:07:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.107843137254902) internal successors, (113), 103 states have internal predecessors, (113), 19 states have call successors, (19), 9 states have call predecessors, (19), 13 states have return successors, (28), 24 states have call predecessors, (28), 19 states have call successors, (28) [2024-11-10 15:07:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2024-11-10 15:07:03,783 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 54 [2024-11-10 15:07:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:03,783 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2024-11-10 15:07:03,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 2.242424242424242) internal successors, (74), 34 states have internal predecessors, (74), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-10 15:07:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2024-11-10 15:07:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 15:07:03,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:03,787 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:03,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:07:03,988 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-11-10 15:07:03,988 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:07:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash -866282663, now seen corresponding path program 1 times [2024-11-10 15:07:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092975536] [2024-11-10 15:07:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:07:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:07:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:07:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:07:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:07:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:07:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 15:07:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 15:07:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 15:07:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-10 15:07:04,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:04,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092975536] [2024-11-10 15:07:04,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092975536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:07:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872621670] [2024-11-10 15:07:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:04,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:07:04,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:07:04,572 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:07:04,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:07:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:04,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:07:04,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:07:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-10 15:07:04,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:07:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872621670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:07:05,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:07:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2024-11-10 15:07:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393094681] [2024-11-10 15:07:05,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:07:05,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 15:07:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 15:07:05,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 15:07:05,350 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2024-11-10 15:07:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:06,529 INFO L93 Difference]: Finished difference Result 200 states and 236 transitions. [2024-11-10 15:07:06,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-10 15:07:06,529 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 71 [2024-11-10 15:07:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:06,531 INFO L225 Difference]: With dead ends: 200 [2024-11-10 15:07:06,531 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 15:07:06,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=486, Invalid=3296, Unknown=0, NotChecked=0, Total=3782 [2024-11-10 15:07:06,534 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 169 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:06,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 475 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:07:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 15:07:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 139. [2024-11-10 15:07:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 104 states have internal predecessors, (114), 19 states have call successors, (19), 9 states have call predecessors, (19), 13 states have return successors, (28), 25 states have call predecessors, (28), 19 states have call successors, (28) [2024-11-10 15:07:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2024-11-10 15:07:06,544 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 71 [2024-11-10 15:07:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:06,545 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2024-11-10 15:07:06,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2024-11-10 15:07:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2024-11-10 15:07:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 15:07:06,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:06,546 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:06,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:07:06,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 15:07:06,755 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:07:06,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1177738505, now seen corresponding path program 1 times [2024-11-10 15:07:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905716136] [2024-11-10 15:07:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:07:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:07:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:07:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:07:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 15:07:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 15:07:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 15:07:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 15:07:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 15:07:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 15:07:06,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905716136] [2024-11-10 15:07:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905716136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:07:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615467519] [2024-11-10 15:07:06,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:06,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:07:06,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:07:06,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:07:06,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:07:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:07,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-10 15:07:07,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:07:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 33 proven. 29 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-10 15:07:07,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:07:07,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-10 15:07:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-10 15:07:07,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615467519] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:07:07,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:07:07,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 26 [2024-11-10 15:07:07,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092551983] [2024-11-10 15:07:07,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:07:07,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:07:07,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:07,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:07:07,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2024-11-10 15:07:07,931 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 21 states have internal predecessors, (85), 11 states have call successors, (28), 8 states have call predecessors, (28), 3 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-10 15:07:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:08,574 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2024-11-10 15:07:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:07:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 21 states have internal predecessors, (85), 11 states have call successors, (28), 8 states have call predecessors, (28), 3 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) Word has length 73 [2024-11-10 15:07:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:08,575 INFO L225 Difference]: With dead ends: 71 [2024-11-10 15:07:08,576 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 15:07:08,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 145 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 15:07:08,577 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 115 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:08,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 380 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:07:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 15:07:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-10 15:07:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-10 15:07:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-11-10 15:07:08,580 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 73 [2024-11-10 15:07:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:08,580 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-11-10 15:07:08,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 21 states have internal predecessors, (85), 11 states have call successors, (28), 8 states have call predecessors, (28), 3 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-10 15:07:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-11-10 15:07:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 15:07:08,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:08,581 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:08,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 15:07:08,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 15:07:08,786 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2024-11-10 15:07:08,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2111047144, now seen corresponding path program 1 times [2024-11-10 15:07:08,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:08,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001162983] [2024-11-10 15:07:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:07:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:07:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:07:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:07:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:07:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:07:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 15:07:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 15:07:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 15:07:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-10 15:07:09,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001162983] [2024-11-10 15:07:09,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001162983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:07:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062092079] [2024-11-10 15:07:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:07:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:07:09,240 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:07:09,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:07:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:09,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 15:07:09,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:07:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-10 15:07:09,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:07:09,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062092079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:07:09,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:07:09,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2024-11-10 15:07:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491391478] [2024-11-10 15:07:09,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:07:09,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:07:09,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:07:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 15:07:09,966 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-10 15:07:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:10,675 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-11-10 15:07:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 15:07:10,676 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) Word has length 71 [2024-11-10 15:07:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:10,676 INFO L225 Difference]: With dead ends: 74 [2024-11-10 15:07:10,676 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 15:07:10,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=348, Invalid=2514, Unknown=0, NotChecked=0, Total=2862 [2024-11-10 15:07:10,677 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 64 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:10,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 576 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:07:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 15:07:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 15:07:10,678 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-11-10 15:07:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 15:07:10,678 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2024-11-10 15:07:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:10,679 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 15:07:10,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-10 15:07:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 15:07:10,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 15:07:10,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (16 of 17 remaining) [2024-11-10 15:07:10,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (15 of 17 remaining) [2024-11-10 15:07:10,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (14 of 17 remaining) [2024-11-10 15:07:10,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (13 of 17 remaining) [2024-11-10 15:07:10,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2024-11-10 15:07:10,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2024-11-10 15:07:10,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2024-11-10 15:07:10,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2024-11-10 15:07:10,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-11-10 15:07:10,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-11-10 15:07:10,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-11-10 15:07:10,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-11-10 15:07:10,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2024-11-10 15:07:10,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2024-11-10 15:07:10,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2024-11-10 15:07:10,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2024-11-10 15:07:10,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2024-11-10 15:07:10,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 15:07:10,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:07:10,887 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:10,889 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:07:10,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:07:10 BoogieIcfgContainer [2024-11-10 15:07:10,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:07:10,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:07:10,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:07:10,893 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:07:10,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:39" (3/4) ... [2024-11-10 15:07:10,896 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 15:07:10,901 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 15:07:10,901 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure check [2024-11-10 15:07:10,901 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 15:07:10,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-11-10 15:07:10,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-10 15:07:10,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 15:07:10,908 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 15:07:11,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:07:11,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 15:07:11,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:07:11,001 INFO L158 Benchmark]: Toolchain (without parser) took 32466.46ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 79.0MB in the beginning and 92.2MB in the end (delta: -13.2MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-11-10 15:07:11,001 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 100.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:07:11,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.49ms. Allocated memory is still 151.0MB. Free memory was 78.7MB in the beginning and 66.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 15:07:11,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.50ms. Allocated memory is still 151.0MB. Free memory was 66.0MB in the beginning and 64.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:07:11,001 INFO L158 Benchmark]: Boogie Preprocessor took 41.62ms. Allocated memory is still 151.0MB. Free memory was 64.3MB in the beginning and 62.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:07:11,002 INFO L158 Benchmark]: IcfgBuilder took 525.08ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 62.4MB in the beginning and 156.7MB in the end (delta: -94.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-10 15:07:11,002 INFO L158 Benchmark]: TraceAbstraction took 31477.79ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 156.7MB in the beginning and 97.1MB in the end (delta: 59.5MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2024-11-10 15:07:11,005 INFO L158 Benchmark]: Witness Printer took 107.60ms. Allocated memory is still 232.8MB. Free memory was 97.1MB in the beginning and 92.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:07:11,006 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.15ms. Allocated memory is still 151.0MB. Free memory is still 100.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.49ms. Allocated memory is still 151.0MB. Free memory was 78.7MB in the beginning and 66.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.50ms. Allocated memory is still 151.0MB. Free memory was 66.0MB in the beginning and 64.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.62ms. Allocated memory is still 151.0MB. Free memory was 64.3MB in the beginning and 62.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 525.08ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 62.4MB in the beginning and 156.7MB in the end (delta: -94.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31477.79ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 156.7MB in the beginning and 97.1MB in the end (delta: 59.5MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * Witness Printer took 107.60ms. Allocated memory is still 232.8MB. Free memory was 97.1MB in the beginning and 92.2MB in the end (delta: 5.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: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free 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: 5]: 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 4 procedures, 68 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1762 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1727 mSDsluCounter, 7232 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6363 mSDsCounter, 596 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7164 IncrementalHoareTripleChecker+Invalid, 7760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 596 mSolverCounterUnsat, 869 mSDtfsCounter, 7164 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1455 GetRequests, 904 SyntacticMatches, 21 SemanticMatches, 530 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4415 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=17, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 273 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1594 ConstructedInterpolants, 66 QuantifiedInterpolants, 10139 SizeOfPredicates, 84 NumberOfNonLiveVariables, 2280 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 37 InterpolantComputations, 9 PerfectInterpolantSequences, 651/857 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 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 15:07:11,040 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