./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:01:20,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:01:20,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:01:20,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:01:20,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:01:20,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:01:20,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:01:20,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:01:20,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:01:20,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:01:20,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:01:20,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:01:20,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:01:20,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:01:20,834 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:01:20,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:01:20,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:01:20,835 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:01:20,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:01:20,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:01:20,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:01:20,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:01:20,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:01:20,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:01:20,839 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:01:20,839 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:01:20,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:01:20,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:01:20,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:01:20,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:01:20,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:01:20,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:01:20,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:01:20,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:01:20,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:01:20,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:01:20,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:01:20,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:01:20,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:01:20,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:01:20,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:01:20,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:01:20,842 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e [2024-11-16 07:01:21,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:01:21,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:01:21,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:01:21,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:01:21,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:01:21,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2024-11-16 07:01:22,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:01:22,412 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:01:22,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2024-11-16 07:01:22,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e1d8b78/73156aaa94ad46a88ffe975f9d1b14d5/FLAG8ae483b11 [2024-11-16 07:01:22,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e1d8b78/73156aaa94ad46a88ffe975f9d1b14d5 [2024-11-16 07:01:22,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:01:22,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:01:22,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:01:22,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:01:22,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:01:22,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5ced1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22, skipping insertion in model container [2024-11-16 07:01:22,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:01:22,582 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i[950,963] [2024-11-16 07:01:22,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:01:22,603 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:01:22,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i[950,963] [2024-11-16 07:01:22,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:01:22,627 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:01:22,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22 WrapperNode [2024-11-16 07:01:22,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:01:22,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:01:22,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:01:22,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:01:22,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,655 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-11-16 07:01:22,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:01:22,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:01:22,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:01:22,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:01:22,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 07:01:22,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:01:22,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:01:22,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:01:22,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:01:22,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (1/1) ... [2024-11-16 07:01:22,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:01:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:01:22,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 07:01:22,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 07:01:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:01:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 07:01:22,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 07:01:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:01:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:01:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:01:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 07:01:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 07:01:22,789 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:01:22,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:01:22,899 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-16 07:01:22,901 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:01:22,910 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:01:22,910 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:01:22,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:01:22 BoogieIcfgContainer [2024-11-16 07:01:22,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:01:22,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:01:22,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:01:22,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:01:22,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:01:22" (1/3) ... [2024-11-16 07:01:22,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32128be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:01:22, skipping insertion in model container [2024-11-16 07:01:22,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:01:22" (2/3) ... [2024-11-16 07:01:22,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32128be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:01:22, skipping insertion in model container [2024-11-16 07:01:22,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:01:22" (3/3) ... [2024-11-16 07:01:22,916 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2024-11-16 07:01:22,929 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:01:22,929 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:01:22,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:01:22,972 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=LoopHeads, 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;@b4650c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:01:22,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:01:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 07:01:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 07:01:22,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:01:22,981 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:01:22,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:01:22,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:01:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash 348123922, now seen corresponding path program 1 times [2024-11-16 07:01:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:01:22,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168046777] [2024-11-16 07:01:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:01:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:01:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:01:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:01:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:01:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:01:23,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168046777] [2024-11-16 07:01:23,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168046777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:01:23,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:01:23,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:01:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477056232] [2024-11-16 07:01:23,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:01:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:01:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:01:23,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:01:23,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:01:23,131 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:01:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:01:23,143 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2024-11-16 07:01:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:01:23,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-16 07:01:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:01:23,149 INFO L225 Difference]: With dead ends: 55 [2024-11-16 07:01:23,149 INFO L226 Difference]: Without dead ends: 25 [2024-11-16 07:01:23,151 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-11-16 07:01:23,153 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:01:23,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:01:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-16 07:01:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-16 07:01:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:01:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-16 07:01:23,177 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 20 [2024-11-16 07:01:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:01:23,178 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-16 07:01:23,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:01:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-16 07:01:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 07:01:23,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:01:23,179 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:01:23,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:01:23,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:01:23,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:01:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1218739950, now seen corresponding path program 1 times [2024-11-16 07:01:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:01:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323155990] [2024-11-16 07:01:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:01:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:01:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:01:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:01:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:01:23,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:01:23,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323155990] [2024-11-16 07:01:23,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323155990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:01:23,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:01:23,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 07:01:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448788843] [2024-11-16 07:01:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:01:23,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 07:01:23,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:01:23,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 07:01:23,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:01:23,352 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:01:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:01:23,375 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-11-16 07:01:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 07:01:23,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-16 07:01:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:01:23,376 INFO L225 Difference]: With dead ends: 40 [2024-11-16 07:01:23,377 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 07:01:23,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:01:23,378 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:01:23,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 74 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:01:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 07:01:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 07:01:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:01:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-16 07:01:23,383 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-16 07:01:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:01:23,385 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-16 07:01:23,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:01:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-16 07:01:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-16 07:01:23,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:01:23,386 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] [2024-11-16 07:01:23,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:01:23,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:01:23,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:01:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash -801088335, now seen corresponding path program 1 times [2024-11-16 07:01:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:01:23,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537913614] [2024-11-16 07:01:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:01:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:01:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:01:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:01:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:01:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:01:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537913614] [2024-11-16 07:01:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537913614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:01:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:01:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:01:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081854491] [2024-11-16 07:01:23,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:01:23,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:01:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:01:23,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:01:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:01:23,502 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:01:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:01:23,527 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-11-16 07:01:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:01:23,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-16 07:01:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:01:23,529 INFO L225 Difference]: With dead ends: 39 [2024-11-16 07:01:23,529 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 07:01:23,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:01:23,531 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:01:23,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:01:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 07:01:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-16 07:01:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:01:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-16 07:01:23,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2024-11-16 07:01:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:01:23,539 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-16 07:01:23,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:01:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-16 07:01:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-16 07:01:23,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:01:23,541 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] [2024-11-16 07:01:23,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:01:23,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:01:23,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:01:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash -770612142, now seen corresponding path program 1 times [2024-11-16 07:01:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:01:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590054791] [2024-11-16 07:01:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:01:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:01:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 07:01:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941756539] [2024-11-16 07:01:23,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:01:23,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:01:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:01:23,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:01:23,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 07:01:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:23,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 07:01:23,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:01:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:01:23,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:01:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:01:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590054791] [2024-11-16 07:01:23,715 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 07:01:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941756539] [2024-11-16 07:01:23,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941756539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:01:23,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:01:23,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:01:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680681240] [2024-11-16 07:01:23,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:01:23,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:01:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:01:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:01:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:01:23,720 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:01:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:01:23,774 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-16 07:01:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:01:23,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-16 07:01:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:01:23,776 INFO L225 Difference]: With dead ends: 43 [2024-11-16 07:01:23,776 INFO L226 Difference]: Without dead ends: 39 [2024-11-16 07:01:23,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:01:23,777 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:01:23,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:01:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-16 07:01:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-16 07:01:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 07:01:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-16 07:01:23,787 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2024-11-16 07:01:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:01:23,788 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-16 07:01:23,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:01:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-16 07:01:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 07:01:23,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:01:23,789 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 07:01:23,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 07:01:23,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:01:23,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:01:23,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:01:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1833380820, now seen corresponding path program 1 times [2024-11-16 07:01:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:01:23,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614506996] [2024-11-16 07:01:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:01:23,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:01:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:01:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:01:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:01:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:01:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:01:24,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614506996] [2024-11-16 07:01:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614506996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:01:24,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:01:24,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:01:24,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959338551] [2024-11-16 07:01:24,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:01:24,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:01:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:01:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:01:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:01:24,273 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:01:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:01:24,295 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2024-11-16 07:01:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:01:24,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 32 [2024-11-16 07:01:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:01:24,296 INFO L225 Difference]: With dead ends: 63 [2024-11-16 07:01:24,297 INFO L226 Difference]: Without dead ends: 37 [2024-11-16 07:01:24,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:01:24,298 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:01:24,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:01:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-16 07:01:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-16 07:01:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 07:01:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-16 07:01:24,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 32 [2024-11-16 07:01:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:01:24,307 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-16 07:01:24,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:01:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-16 07:01:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 07:01:24,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:01:24,308 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:01:24,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 07:01:24,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:01:24,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:01:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1959825292, now seen corresponding path program 1 times [2024-11-16 07:01:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:01:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824557258] [2024-11-16 07:01:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:01:24,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:01:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:01:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:01:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:01:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 07:01:24,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:01:24,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824557258] [2024-11-16 07:01:24,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824557258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:01:24,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526164594] [2024-11-16 07:01:24,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:01:24,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:01:24,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:01:24,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:01:24,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 07:01:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 07:01:24,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:01:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 07:01:24,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:01:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 07:01:24,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526164594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:01:24,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:01:24,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 5 [2024-11-16 07:01:24,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084847429] [2024-11-16 07:01:24,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:01:24,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:01:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:01:24,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:01:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:01:24,511 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 07:01:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:01:24,527 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2024-11-16 07:01:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:01:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2024-11-16 07:01:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:01:24,528 INFO L225 Difference]: With dead ends: 61 [2024-11-16 07:01:24,528 INFO L226 Difference]: Without dead ends: 39 [2024-11-16 07:01:24,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:01:24,528 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:01:24,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:01:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-16 07:01:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-16 07:01:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 07:01:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-16 07:01:24,533 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 34 [2024-11-16 07:01:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:01:24,533 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-16 07:01:24,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 07:01:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-11-16 07:01:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 07:01:24,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:01:24,534 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:01:24,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 07:01:24,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 07:01:24,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:01:24,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:01:24,738 INFO L85 PathProgramCache]: Analyzing trace with hash -423149257, now seen corresponding path program 1 times [2024-11-16 07:01:24,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:01:24,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188527627] [2024-11-16 07:01:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:01:24,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:01:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:01:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:01:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:01:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:01:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:01:24,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:01:24,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188527627] [2024-11-16 07:01:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188527627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:01:24,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:01:24,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:01:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932379897] [2024-11-16 07:01:24,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:01:24,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:01:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:01:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:01:24,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:01:24,818 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:01:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:01:24,836 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-16 07:01:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:01:24,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 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 35 [2024-11-16 07:01:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:01:24,842 INFO L225 Difference]: With dead ends: 41 [2024-11-16 07:01:24,842 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 07:01:24,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:01:24,842 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:01:24,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:01:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 07:01:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 07:01:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:01:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 07:01:24,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2024-11-16 07:01:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:01:24,843 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 07:01:24,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:01:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 07:01:24,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 07:01:24,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:01:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:01:24,852 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:01:24,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 07:01:24,958 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:01:24,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:01:24 BoogieIcfgContainer [2024-11-16 07:01:24,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:01:24,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:01:24,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:01:24,976 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:01:24,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:01:22" (3/4) ... [2024-11-16 07:01:24,978 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 07:01:24,983 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 07:01:24,983 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-16 07:01:24,986 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-16 07:01:24,986 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 07:01:24,986 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 07:01:24,987 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 07:01:25,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:01:25,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 07:01:25,057 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:01:25,057 INFO L158 Benchmark]: Toolchain (without parser) took 2620.91ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 71.4MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2024-11-16 07:01:25,057 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:01:25,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.62ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 129.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 07:01:25,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.16ms. Allocated memory is still 172.0MB. Free memory was 129.1MB in the beginning and 128.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:01:25,058 INFO L158 Benchmark]: Boogie Preprocessor took 29.00ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:01:25,058 INFO L158 Benchmark]: IcfgBuilder took 225.06ms. Allocated memory is still 172.0MB. Free memory was 126.0MB in the beginning and 114.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 07:01:25,058 INFO L158 Benchmark]: TraceAbstraction took 2063.31ms. Allocated memory is still 172.0MB. Free memory was 113.4MB in the beginning and 75.6MB in the end (delta: 37.8MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-11-16 07:01:25,058 INFO L158 Benchmark]: Witness Printer took 81.06ms. Allocated memory is still 172.0MB. Free memory was 75.6MB in the beginning and 71.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 07:01:25,059 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.12ms. Allocated memory is still 123.7MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.62ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 129.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.16ms. Allocated memory is still 172.0MB. Free memory was 129.1MB in the beginning and 128.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.00ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 225.06ms. Allocated memory is still 172.0MB. Free memory was 126.0MB in the beginning and 114.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2063.31ms. Allocated memory is still 172.0MB. Free memory was 113.4MB in the beginning and 75.6MB in the end (delta: 37.8MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 81.06ms. Allocated memory is still 172.0MB. Free memory was 75.6MB in the beginning and 71.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 440 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 189 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 510 SizeOfPredicates, 2 NumberOfNonLiveVariables, 161 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 59/65 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 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Location Invariant Derived location invariant: null - InvariantResult [Line: 26]: Location Invariant Derived location invariant: ((((2 <= counter) && (q == 0)) && (A == r)) || ((((0 == 0) && (q == 0)) && (A == r)) && (b == B))) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == 0) && (counter == \old(counter))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: ((1 <= cond) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-11-16 07:01:25,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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