./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 17:53:26,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:53:26,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:53:26,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:53:26,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:53:26,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:53:26,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:53:26,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:53:26,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:53:26,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:53:26,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:53:26,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:53:26,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:53:26,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:53:26,947 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:53:26,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:53:26,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:53:26,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:53:26,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:53:26,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:53:26,949 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:53:26,950 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:53:26,950 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:53:26,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:53:26,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:53:26,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:53:26,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:53:26,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:53:26,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:53:26,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:53:26,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:53:26,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:53:26,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:53:26,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:53:26,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:53:26,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:53:26,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:53:26,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:53:26,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:53:26,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:53:26,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:53:26,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:53:26,954 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-clean/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-clean/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-10-11 17:53:27,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:53:27,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:53:27,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:53:27,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:53:27,162 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:53:27,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-11 17:53:28,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:53:28,504 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:53:28,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-11 17:53:28,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5ca2677e7/05f7ffddcb7344ceb5e5d331477d6d22/FLAG22000f2db [2024-10-11 17:53:28,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5ca2677e7/05f7ffddcb7344ceb5e5d331477d6d22 [2024-10-11 17:53:28,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:53:28,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:53:28,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:53:28,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:53:28,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:53:28,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d4f521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28, skipping insertion in model container [2024-10-11 17:53:28,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:53:28,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:53:28,719 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:53:28,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:53:28,753 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:53:28,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28 WrapperNode [2024-10-11 17:53:28,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:53:28,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:53:28,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:53:28,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:53:28,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,781 INFO L138 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2024-10-11 17:53:28,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:53:28,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:53:28,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:53:28,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:53:28,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,818 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-10-11 17:53:28,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:53:28,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:53:28,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:53:28,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:53:28,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (1/1) ... [2024-10-11 17:53:28,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:53:28,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:28,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:53:28,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:53:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:53:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 17:53:28,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 17:53:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:53:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:53:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-11 17:53:28,894 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-11 17:53:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:53:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:53:28,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:53:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:53:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:53:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:53:28,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:53:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:53:28,954 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:53:28,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:53:29,151 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-11 17:53:29,152 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:53:29,195 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:53:29,195 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:53:29,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:53:29 BoogieIcfgContainer [2024-10-11 17:53:29,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:53:29,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:53:29,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:53:29,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:53:29,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:53:28" (1/3) ... [2024-10-11 17:53:29,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a675e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:53:29, skipping insertion in model container [2024-10-11 17:53:29,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:53:28" (2/3) ... [2024-10-11 17:53:29,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a675e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:53:29, skipping insertion in model container [2024-10-11 17:53:29,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:53:29" (3/3) ... [2024-10-11 17:53:29,204 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-10-11 17:53:29,218 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:53:29,218 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-10-11 17:53:29,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:53:29,258 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;@37f01935, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:53:29,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-11 17:53:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 28 states have (on average 1.75) internal successors, (49), 45 states have internal predecessors, (49), 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-10-11 17:53:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:53:29,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:29,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:29,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:29,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:29,274 INFO L85 PathProgramCache]: Analyzing trace with hash -479782134, now seen corresponding path program 1 times [2024-10-11 17:53:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:29,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552381304] [2024-10-11 17:53:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:29,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:53:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552381304] [2024-10-11 17:53:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552381304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:53:29,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333269892] [2024-10-11 17:53:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:29,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:53:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:29,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:53:29,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:53:29,471 INFO L87 Difference]: Start difference. First operand has 57 states, 28 states have (on average 1.75) internal successors, (49), 45 states have internal predecessors, (49), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:53:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:29,503 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-10-11 17:53:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:53:29,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 17:53:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:29,510 INFO L225 Difference]: With dead ends: 57 [2024-10-11 17:53:29,510 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 17:53:29,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:53:29,514 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:29,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 17:53:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 17:53:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 44 states have internal predecessors, (46), 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-10-11 17:53:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-10-11 17:53:29,545 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 20 [2024-10-11 17:53:29,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:29,545 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-10-11 17:53:29,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:53:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-10-11 17:53:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:53:29,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:29,548 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:29,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:53:29,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:29,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1367065458, now seen corresponding path program 1 times [2024-10-11 17:53:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:29,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199715634] [2024-10-11 17:53:29,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:29,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:53:29,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:29,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199715634] [2024-10-11 17:53:29,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199715634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:29,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:53:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814783812] [2024-10-11 17:53:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:29,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:53:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:29,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:53:29,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:53:29,821 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-10-11 17:53:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:29,976 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2024-10-11 17:53:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:53:29,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 20 [2024-10-11 17:53:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:29,979 INFO L225 Difference]: With dead ends: 96 [2024-10-11 17:53:29,979 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 17:53:29,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:53:29,980 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:29,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 242 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 17:53:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2024-10-11 17:53:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 59 states have internal predecessors, (70), 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-10-11 17:53:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2024-10-11 17:53:30,006 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 20 [2024-10-11 17:53:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:30,006 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2024-10-11 17:53:30,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-10-11 17:53:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2024-10-11 17:53:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:53:30,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:30,011 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:30,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:53:30,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:30,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1368600300, now seen corresponding path program 1 times [2024-10-11 17:53:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:30,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757129365] [2024-10-11 17:53:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:30,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:53:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:53:30,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:30,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757129365] [2024-10-11 17:53:30,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757129365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:30,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:30,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:53:30,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473917145] [2024-10-11 17:53:30,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:30,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:53:30,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:30,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:53:30,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:53:30,107 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-10-11 17:53:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:30,142 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2024-10-11 17:53:30,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:53:30,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 20 [2024-10-11 17:53:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:30,144 INFO L225 Difference]: With dead ends: 74 [2024-10-11 17:53:30,144 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 17:53:30,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:53:30,145 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:30,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 17:53:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-11 17:53:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 56 states have internal predecessors, (67), 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-10-11 17:53:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2024-10-11 17:53:30,156 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 20 [2024-10-11 17:53:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:30,156 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2024-10-11 17:53:30,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-10-11 17:53:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2024-10-11 17:53:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:53:30,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:30,157 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:30,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:53:30,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:30,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1368600299, now seen corresponding path program 1 times [2024-10-11 17:53:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864097733] [2024-10-11 17:53:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:30,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:53:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:53:30,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:30,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864097733] [2024-10-11 17:53:30,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864097733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:30,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:30,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:53:30,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753505996] [2024-10-11 17:53:30,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:30,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:53:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:53:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:53:30,463 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-10-11 17:53:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:30,634 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2024-10-11 17:53:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:53:30,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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 20 [2024-10-11 17:53:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:30,635 INFO L225 Difference]: With dead ends: 80 [2024-10-11 17:53:30,635 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 17:53:30,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:53:30,638 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:30,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 254 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 17:53:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-10-11 17:53:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 59 states have internal predecessors, (70), 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-10-11 17:53:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2024-10-11 17:53:30,651 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 20 [2024-10-11 17:53:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:30,651 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2024-10-11 17:53:30,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-10-11 17:53:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2024-10-11 17:53:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:53:30,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:30,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:30,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:53:30,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:30,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash 523066374, now seen corresponding path program 1 times [2024-10-11 17:53:30,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:30,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835502358] [2024-10-11 17:53:30,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:30,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:53:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:53:30,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835502358] [2024-10-11 17:53:30,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835502358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:30,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:30,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:53:30,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68528087] [2024-10-11 17:53:30,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:30,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:53:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:30,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:53:30,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:53:30,784 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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-10-11 17:53:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:30,884 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2024-10-11 17:53:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:53:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 21 [2024-10-11 17:53:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:30,885 INFO L225 Difference]: With dead ends: 101 [2024-10-11 17:53:30,886 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 17:53:30,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:53:30,886 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:30,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 265 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 17:53:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2024-10-11 17:53:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 59 states have internal predecessors, (70), 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-10-11 17:53:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2024-10-11 17:53:30,896 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 21 [2024-10-11 17:53:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:30,897 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2024-10-11 17:53:30,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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-10-11 17:53:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2024-10-11 17:53:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:53:30,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:30,897 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] [2024-10-11 17:53:30,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:53:30,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:30,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash -698788053, now seen corresponding path program 1 times [2024-10-11 17:53:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163650009] [2024-10-11 17:53:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:53:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:53:31,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:31,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163650009] [2024-10-11 17:53:31,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163650009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:31,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:53:31,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631300862] [2024-10-11 17:53:31,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:31,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:53:31,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:53:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:53:31,027 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-10-11 17:53:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:31,101 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2024-10-11 17:53:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:53:31,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 25 [2024-10-11 17:53:31,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:31,102 INFO L225 Difference]: With dead ends: 82 [2024-10-11 17:53:31,102 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 17:53:31,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:53:31,103 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:31,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 257 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 17:53:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 17:53:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.489795918367347) internal successors, (73), 62 states have internal predecessors, (73), 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-10-11 17:53:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2024-10-11 17:53:31,107 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 25 [2024-10-11 17:53:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:31,107 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-10-11 17:53:31,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-10-11 17:53:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2024-10-11 17:53:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 17:53:31,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:31,108 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] [2024-10-11 17:53:31,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:53:31,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:31,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1143605615, now seen corresponding path program 1 times [2024-10-11 17:53:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471246638] [2024-10-11 17:53:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:53:31,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471246638] [2024-10-11 17:53:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471246638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334014608] [2024-10-11 17:53:31,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:31,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:31,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:31,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:31,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:53:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:31,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 17:53:31,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:31,475 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-10-11 17:53:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:53:31,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:53:32,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334014608] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:32,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:32,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2024-10-11 17:53:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905070551] [2024-10-11 17:53:32,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:32,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:53:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:53:32,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:53:32,115 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 20 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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-10-11 17:53:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:33,253 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2024-10-11 17:53:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 17:53:33,253 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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 28 [2024-10-11 17:53:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:33,254 INFO L225 Difference]: With dead ends: 161 [2024-10-11 17:53:33,254 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 17:53:33,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 17:53:33,255 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 295 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:33,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 347 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:53:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 17:53:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 116. [2024-10-11 17:53:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 86 states have internal predecessors, (110), 23 states have call successors, (23), 8 states have call predecessors, (23), 9 states have return successors, (24), 21 states have call predecessors, (24), 23 states have call successors, (24) [2024-10-11 17:53:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2024-10-11 17:53:33,267 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 28 [2024-10-11 17:53:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:33,267 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2024-10-11 17:53:33,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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-10-11 17:53:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2024-10-11 17:53:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 17:53:33,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:33,268 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] [2024-10-11 17:53:33,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:53:33,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:33,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:33,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1143605616, now seen corresponding path program 1 times [2024-10-11 17:53:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851902984] [2024-10-11 17:53:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 17:53:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:33,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851902984] [2024-10-11 17:53:33,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851902984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:33,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:33,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:53:33,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027575297] [2024-10-11 17:53:33,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:33,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:53:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:53:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:53:33,519 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-10-11 17:53:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:33,585 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2024-10-11 17:53:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:53:33,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 28 [2024-10-11 17:53:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:33,587 INFO L225 Difference]: With dead ends: 118 [2024-10-11 17:53:33,587 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 17:53:33,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:53:33,588 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:33,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 87 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 17:53:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2024-10-11 17:53:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.323943661971831) internal successors, (94), 82 states have internal predecessors, (94), 23 states have call successors, (23), 8 states have call predecessors, (23), 9 states have return successors, (24), 21 states have call predecessors, (24), 23 states have call successors, (24) [2024-10-11 17:53:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2024-10-11 17:53:33,601 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 28 [2024-10-11 17:53:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:33,601 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2024-10-11 17:53:33,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-10-11 17:53:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2024-10-11 17:53:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 17:53:33,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:33,602 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] [2024-10-11 17:53:33,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:53:33,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:33,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash 117433615, now seen corresponding path program 1 times [2024-10-11 17:53:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:33,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728385074] [2024-10-11 17:53:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:53:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:53:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728385074] [2024-10-11 17:53:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728385074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:33,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:33,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:53:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555193831] [2024-10-11 17:53:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:53:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:53:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:53:33,625 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-10-11 17:53:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:33,640 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2024-10-11 17:53:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:53:33,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 28 [2024-10-11 17:53:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:33,641 INFO L225 Difference]: With dead ends: 111 [2024-10-11 17:53:33,641 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 17:53:33,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:53:33,642 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:33,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 17:53:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 17:53:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 81 states have internal predecessors, (93), 23 states have call successors, (23), 8 states have call predecessors, (23), 9 states have return successors, (24), 21 states have call predecessors, (24), 23 states have call successors, (24) [2024-10-11 17:53:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2024-10-11 17:53:33,647 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 28 [2024-10-11 17:53:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:33,647 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2024-10-11 17:53:33,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-10-11 17:53:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2024-10-11 17:53:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 17:53:33,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:33,648 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] [2024-10-11 17:53:33,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:53:33,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:33,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1184556082, now seen corresponding path program 1 times [2024-10-11 17:53:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090704390] [2024-10-11 17:53:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:53:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:53:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:33,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090704390] [2024-10-11 17:53:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090704390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:53:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:53:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291037928] [2024-10-11 17:53:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:33,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:53:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:53:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:53:33,696 INFO L87 Difference]: Start difference. First operand 111 states and 140 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-10-11 17:53:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:33,723 INFO L93 Difference]: Finished difference Result 110 states and 139 transitions. [2024-10-11 17:53:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:53:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 30 [2024-10-11 17:53:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:33,724 INFO L225 Difference]: With dead ends: 110 [2024-10-11 17:53:33,724 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 17:53:33,724 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-10-11 17:53:33,725 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:33,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 17:53:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 17:53:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 69 states have internal predecessors, (80), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 17:53:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2024-10-11 17:53:33,730 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 30 [2024-10-11 17:53:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:33,730 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2024-10-11 17:53:33,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-10-11 17:53:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2024-10-11 17:53:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 17:53:33,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:33,731 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] [2024-10-11 17:53:33,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:53:33,731 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:33,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash -85974532, now seen corresponding path program 1 times [2024-10-11 17:53:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:33,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665818800] [2024-10-11 17:53:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 17:53:33,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:33,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665818800] [2024-10-11 17:53:33,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665818800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:33,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876257633] [2024-10-11 17:53:33,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:33,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:33,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:33,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:33,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:53:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:33,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 17:53:33,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 17:53:33,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:53:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876257633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:33,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:53:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2024-10-11 17:53:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285006930] [2024-10-11 17:53:33,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:33,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:53:33,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:53:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:53:33,989 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 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-10-11 17:53:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:34,126 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2024-10-11 17:53:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:53:34,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 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 37 [2024-10-11 17:53:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:34,127 INFO L225 Difference]: With dead ends: 125 [2024-10-11 17:53:34,127 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 17:53:34,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 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-10-11 17:53:34,128 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:34,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 170 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 17:53:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 100. [2024-10-11 17:53:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 72 states have internal predecessors, (83), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 17:53:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2024-10-11 17:53:34,132 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 37 [2024-10-11 17:53:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:34,132 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2024-10-11 17:53:34,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 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-10-11 17:53:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2024-10-11 17:53:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 17:53:34,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:34,133 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] [2024-10-11 17:53:34,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:53:34,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:34,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:34,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash -87500117, now seen corresponding path program 1 times [2024-10-11 17:53:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:34,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712640715] [2024-10-11 17:53:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:34,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:34,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:34,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:34,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:34,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 17:53:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:53:34,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712640715] [2024-10-11 17:53:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712640715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345488109] [2024-10-11 17:53:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:34,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:34,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:34,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:34,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:53:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:34,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 17:53:34,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:53:34,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:34,814 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-10-11 17:53:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:53:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345488109] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:34,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2024-10-11 17:53:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244744828] [2024-10-11 17:53:34,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:34,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:53:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:34,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:53:34,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:53:34,992 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand has 22 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 17:53:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:35,333 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2024-10-11 17:53:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:53:35,334 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) Word has length 37 [2024-10-11 17:53:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:35,335 INFO L225 Difference]: With dead ends: 105 [2024-10-11 17:53:35,335 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 17:53:35,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2024-10-11 17:53:35,335 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 94 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:35,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 283 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:53:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 17:53:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2024-10-11 17:53:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 72 states have internal predecessors, (81), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 17:53:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2024-10-11 17:53:35,339 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 37 [2024-10-11 17:53:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:35,339 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2024-10-11 17:53:35,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 17:53:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2024-10-11 17:53:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 17:53:35,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:35,340 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] [2024-10-11 17:53:35,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:53:35,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:35,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:35,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1582465037, now seen corresponding path program 1 times [2024-10-11 17:53:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:35,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750530709] [2024-10-11 17:53:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:35,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:35,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:35,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:35,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:35,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 17:53:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 17:53:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750530709] [2024-10-11 17:53:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750530709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958615823] [2024-10-11 17:53:35,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:35,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:35,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:35,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:53:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:35,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 17:53:35,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 17:53:35,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:36,174 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-10-11 17:53:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 17:53:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958615823] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:36,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:36,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2024-10-11 17:53:36,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444818314] [2024-10-11 17:53:36,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:36,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 17:53:36,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 17:53:36,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 17:53:36,276 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 33 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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-10-11 17:53:40,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:53:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:41,481 INFO L93 Difference]: Finished difference Result 174 states and 215 transitions. [2024-10-11 17:53:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 17:53:41,482 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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 38 [2024-10-11 17:53:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:41,482 INFO L225 Difference]: With dead ends: 174 [2024-10-11 17:53:41,482 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 17:53:41,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=586, Invalid=3320, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 17:53:41,484 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 185 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:41,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 635 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1134 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 17:53:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 17:53:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2024-10-11 17:53:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 92 states have internal predecessors, (104), 22 states have call successors, (22), 10 states have call predecessors, (22), 13 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2024-10-11 17:53:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2024-10-11 17:53:41,488 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 38 [2024-10-11 17:53:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:41,488 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2024-10-11 17:53:41,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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-10-11 17:53:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2024-10-11 17:53:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 17:53:41,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:41,489 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] [2024-10-11 17:53:41,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:53:41,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 17:53:41,690 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:41,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash -199462405, now seen corresponding path program 1 times [2024-10-11 17:53:41,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:41,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887004580] [2024-10-11 17:53:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:41,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:41,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:41,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 17:53:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 17:53:41,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:41,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887004580] [2024-10-11 17:53:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887004580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:41,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203555086] [2024-10-11 17:53:41,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:41,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:41,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:41,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:41,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:53:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:41,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 17:53:41,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:41,914 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-10-11 17:53:42,064 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-10-11 17:53:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:53:42,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:46,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203555086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:46,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:53:46,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 21 [2024-10-11 17:53:46,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434294207] [2024-10-11 17:53:46,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:46,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 17:53:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:46,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 17:53:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:53:46,198 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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-10-11 17:53:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:46,435 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2024-10-11 17:53:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:53:46,436 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 42 [2024-10-11 17:53:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:46,436 INFO L225 Difference]: With dead ends: 128 [2024-10-11 17:53:46,437 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 17:53:46,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 17:53:46,437 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:46,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 206 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 17:53:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-11 17:53:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 93 states have internal predecessors, (105), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2024-10-11 17:53:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2024-10-11 17:53:46,443 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 42 [2024-10-11 17:53:46,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:46,444 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2024-10-11 17:53:46,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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-10-11 17:53:46,444 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2024-10-11 17:53:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:53:46,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:46,444 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:46,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:53:46,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 17:53:46,645 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:46,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1946217944, now seen corresponding path program 1 times [2024-10-11 17:53:46,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:46,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025877612] [2024-10-11 17:53:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:46,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 17:53:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 17:53:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 17:53:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025877612] [2024-10-11 17:53:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025877612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896844024] [2024-10-11 17:53:46,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:46,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:46,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:46,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:46,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:53:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:46,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:53:46,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:46,868 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-10-11 17:53:46,973 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-10-11 17:53:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:53:46,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:53:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896844024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:53:46,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:53:46,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2024-10-11 17:53:46,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701146823] [2024-10-11 17:53:46,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:53:46,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:53:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:46,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:53:46,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:53:46,996 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 17:53:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:47,066 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-10-11 17:53:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:53:47,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2024-10-11 17:53:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:47,067 INFO L225 Difference]: With dead ends: 76 [2024-10-11 17:53:47,067 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 17:53:47,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:53:47,067 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:47,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 108 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:53:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 17:53:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 17:53:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (13), 13 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:53:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-10-11 17:53:47,070 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 46 [2024-10-11 17:53:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:47,070 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-10-11 17:53:47,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 17:53:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-10-11 17:53:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 17:53:47,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:47,070 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] [2024-10-11 17:53:47,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:53:47,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 17:53:47,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:47,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2042287604, now seen corresponding path program 1 times [2024-10-11 17:53:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:47,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236986805] [2024-10-11 17:53:47,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:47,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:47,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:53:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 17:53:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 17:53:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 17:53:47,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:47,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236986805] [2024-10-11 17:53:47,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236986805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:47,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464334836] [2024-10-11 17:53:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:47,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:47,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:47,522 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:47,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:53:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:47,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 17:53:47,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 17:53:47,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:47,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:53:47,768 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-10-11 17:53:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 17:53:47,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464334836] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:47,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:47,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 13 [2024-10-11 17:53:47,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603056116] [2024-10-11 17:53:47,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:47,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:53:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:53:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:53:47,900 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 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-10-11 17:53:51,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:53:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:52,104 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-10-11 17:53:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:53:52,105 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 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 48 [2024-10-11 17:53:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:52,105 INFO L225 Difference]: With dead ends: 75 [2024-10-11 17:53:52,105 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 17:53:52,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:53:52,106 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:52,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 173 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 17:53:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 17:53:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 17:53:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (13), 13 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:53:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-10-11 17:53:52,108 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 48 [2024-10-11 17:53:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:52,109 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-10-11 17:53:52,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 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-10-11 17:53:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-10-11 17:53:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:53:52,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:52,109 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] [2024-10-11 17:53:52,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 17:53:52,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:52,311 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:52,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1113591033, now seen corresponding path program 1 times [2024-10-11 17:53:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:52,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508150411] [2024-10-11 17:53:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:52,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:52,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:52,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:52,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:53:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 17:53:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 17:53:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 17:53:52,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:52,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508150411] [2024-10-11 17:53:52,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508150411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:52,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942250705] [2024-10-11 17:53:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:52,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:52,621 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:52,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 17:53:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:52,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 17:53:52,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 17:53:52,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:53,081 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-10-11 17:53:53,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:53:53,471 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-10-11 17:53:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 17:53:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942250705] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:53,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2024-10-11 17:53:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128150336] [2024-10-11 17:53:53,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:53,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 17:53:53,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:53,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 17:53:53,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 17:53:53,626 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 37 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 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-10-11 17:53:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:54,807 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-10-11 17:53:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 17:53:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 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 49 [2024-10-11 17:53:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:54,808 INFO L225 Difference]: With dead ends: 83 [2024-10-11 17:53:54,808 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 17:53:54,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=426, Invalid=3606, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 17:53:54,809 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:54,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 415 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:53:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 17:53:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2024-10-11 17:53:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 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-10-11 17:53:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-10-11 17:53:54,812 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 49 [2024-10-11 17:53:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:54,812 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-10-11 17:53:54,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 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-10-11 17:53:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-10-11 17:53:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 17:53:54,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:53:54,813 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] [2024-10-11 17:53:54,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 17:53:55,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 17:53:55,017 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 17:53:55,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:53:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1293924338, now seen corresponding path program 1 times [2024-10-11 17:53:55,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:53:55,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301319863] [2024-10-11 17:53:55,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:55,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:53:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:53:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:53:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 17:53:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 17:53:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:53:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:53:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 17:53:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 17:53:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:53:55,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301319863] [2024-10-11 17:53:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301319863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:55,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939128184] [2024-10-11 17:53:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:53:55,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:53:55,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:53:55,450 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:53:55,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 17:53:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:53:55,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 17:53:55,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:53:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 17:53:55,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939128184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:53:56,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:53:56,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2024-10-11 17:53:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643474527] [2024-10-11 17:53:56,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:56,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 17:53:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:56,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 17:53:56,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 17:53:56,002 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 23 states have internal predecessors, (50), 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-10-11 17:53:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:53:56,582 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-10-11 17:53:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 17:53:56,582 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 23 states have internal predecessors, (50), 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 66 [2024-10-11 17:53:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:53:56,582 INFO L225 Difference]: With dead ends: 67 [2024-10-11 17:53:56,582 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 17:53:56,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=2309, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 17:53:56,583 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:53:56,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 310 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:53:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 17:53:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 17:53:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:53:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 17:53:56,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2024-10-11 17:53:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:53:56,584 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 17:53:56,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 23 states have internal predecessors, (50), 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-10-11 17:53:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 17:53:56,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 17:53:56,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (12 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (11 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (10 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (9 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-10-11 17:53:56,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-10-11 17:53:56,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-10-11 17:53:56,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2024-10-11 17:53:56,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2024-10-11 17:53:56,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2024-10-11 17:53:56,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2024-10-11 17:53:56,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2024-10-11 17:53:56,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 17:53:56,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 17:53:56,796 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:53:56,798 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:53:56,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:53:56 BoogieIcfgContainer [2024-10-11 17:53:56,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:53:56,801 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:53:56,801 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:53:56,801 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:53:56,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:53:29" (3/4) ... [2024-10-11 17:53:56,803 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:53:56,806 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 17:53:56,806 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2024-10-11 17:53:56,806 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 17:53:56,811 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2024-10-11 17:53:56,811 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 17:53:56,811 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 17:53:56,811 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:53:56,875 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:53:56,875 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:53:56,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:53:56,876 INFO L158 Benchmark]: Toolchain (without parser) took 28350.34ms. Allocated memory was 125.8MB in the beginning and 262.1MB in the end (delta: 136.3MB). Free memory was 56.3MB in the beginning and 114.4MB in the end (delta: -58.2MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2024-10-11 17:53:56,876 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 125.8MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:53:56,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.78ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 56.1MB in the beginning and 142.5MB in the end (delta: -86.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-10-11 17:53:56,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.14ms. Allocated memory is still 180.4MB. Free memory was 142.5MB in the beginning and 141.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:53:56,876 INFO L158 Benchmark]: Boogie Preprocessor took 46.54ms. Allocated memory is still 180.4MB. Free memory was 141.5MB in the beginning and 139.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:53:56,877 INFO L158 Benchmark]: RCFGBuilder took 365.32ms. Allocated memory is still 180.4MB. Free memory was 139.4MB in the beginning and 119.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 17:53:56,877 INFO L158 Benchmark]: TraceAbstraction took 27602.43ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 118.4MB in the beginning and 119.7MB in the end (delta: -1.3MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2024-10-11 17:53:56,877 INFO L158 Benchmark]: Witness Printer took 73.85ms. Allocated memory is still 262.1MB. Free memory was 119.7MB in the beginning and 114.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:53:56,880 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.08ms. Allocated memory is still 125.8MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.78ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 56.1MB in the beginning and 142.5MB in the end (delta: -86.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.14ms. Allocated memory is still 180.4MB. Free memory was 142.5MB in the beginning and 141.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.54ms. Allocated memory is still 180.4MB. Free memory was 141.5MB in the beginning and 139.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.32ms. Allocated memory is still 180.4MB. Free memory was 139.4MB in the beginning and 119.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27602.43ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 118.4MB in the beginning and 119.7MB in the end (delta: -1.3MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. * Witness Printer took 73.85ms. Allocated memory is still 262.1MB. Free memory was 119.7MB in the beginning and 114.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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, 57 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 27.6s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1037 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1008 mSDsluCounter, 4073 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3405 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4845 IncrementalHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 668 mSDtfsCounter, 4845 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 653 SyntacticMatches, 14 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=14, InterpolantAutomatonStates: 224, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 178 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 994 NumberOfCodeBlocks, 994 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1162 ConstructedInterpolants, 53 QuantifiedInterpolants, 6905 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1608 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 32 InterpolantComputations, 11 PerfectInterpolantSequences, 440/528 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-10-11 17:53:56,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE