./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex-add.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/loop-lit/bh2017-ex-add.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 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:46:33,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:46:33,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:46:33,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:46:33,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:46:33,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:46:33,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:46:33,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:46:33,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:46:33,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:46:33,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:46:33,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:46:33,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:46:33,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:46:33,781 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:46:33,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:46:33,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:46:33,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:46:33,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:46:33,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:46:33,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:46:33,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:46:33,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:46:33,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:46:33,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:46:33,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:46:33,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:46:33,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:46:33,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:46:33,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:46:33,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:46:33,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:46:33,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:46:33,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:46:33,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:46:33,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:46:33,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:46:33,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:46:33,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:46:33,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:46:33,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:46:33,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:46:33,792 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 -> 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc [2024-11-11 19:46:34,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:46:34,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:46:34,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:46:34,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:46:34,081 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:46:34,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2024-11-11 19:46:35,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:46:35,718 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:46:35,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2024-11-11 19:46:35,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5250666d9/7cf8854949654e709bc0de7688e6903a/FLAG9b6ab4370 [2024-11-11 19:46:35,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5250666d9/7cf8854949654e709bc0de7688e6903a [2024-11-11 19:46:35,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:46:35,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:46:35,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:46:35,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:46:35,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:46:35,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:46:35" (1/1) ... [2024-11-11 19:46:35,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@483033f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:35, skipping insertion in model container [2024-11-11 19:46:35,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:46:35" (1/1) ... [2024-11-11 19:46:35,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:46:35,973 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/loop-lit/bh2017-ex-add.i[802,815] [2024-11-11 19:46:35,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:46:35,999 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:46:36,011 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/loop-lit/bh2017-ex-add.i[802,815] [2024-11-11 19:46:36,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:46:36,038 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:46:36,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36 WrapperNode [2024-11-11 19:46:36,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:46:36,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:46:36,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:46:36,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:46:36,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,071 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2024-11-11 19:46:36,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:46:36,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:46:36,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:46:36,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:46:36,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,101 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-11 19:46:36,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:46:36,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:46:36,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:46:36,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:46:36,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (1/1) ... [2024-11-11 19:46:36,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:46:36,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:46:36,154 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-11 19:46:36,158 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-11 19:46:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:46:36,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:46:36,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:46:36,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:46:36,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 19:46:36,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 19:46:36,272 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:46:36,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:46:36,427 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-11 19:46:36,429 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:46:36,443 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:46:36,443 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 19:46:36,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:46:36 BoogieIcfgContainer [2024-11-11 19:46:36,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:46:36,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:46:36,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:46:36,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:46:36,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:46:35" (1/3) ... [2024-11-11 19:46:36,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441ec3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:46:36, skipping insertion in model container [2024-11-11 19:46:36,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:36" (2/3) ... [2024-11-11 19:46:36,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441ec3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:46:36, skipping insertion in model container [2024-11-11 19:46:36,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:46:36" (3/3) ... [2024-11-11 19:46:36,456 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex-add.i [2024-11-11 19:46:36,474 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:46:36,474 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:46:36,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:46:36,551 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;@51423e73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:46:36,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:46:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:46:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-11 19:46:36,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:36,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:36,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:36,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:36,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1812494559, now seen corresponding path program 1 times [2024-11-11 19:46:36,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:36,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139734700] [2024-11-11 19:46:36,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:36,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:46:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:36,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139734700] [2024-11-11 19:46:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139734700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:36,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:46:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149465019] [2024-11-11 19:46:36,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:36,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:46:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:36,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:46:36,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:46:36,934 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:37,026 INFO L93 Difference]: Finished difference Result 52 states and 79 transitions. [2024-11-11 19:46:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:46:37,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-11 19:46:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:37,038 INFO L225 Difference]: With dead ends: 52 [2024-11-11 19:46:37,039 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 19:46:37,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11 19:46:37,045 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:37,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 85 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 19:46:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 19:46:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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-11 19:46:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-11 19:46:37,086 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 7 [2024-11-11 19:46:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:37,087 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-11 19:46:37,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-11 19:46:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-11 19:46:37,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:37,088 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:37,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:46:37,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:37,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:37,089 INFO L85 PathProgramCache]: Analyzing trace with hash 811008417, now seen corresponding path program 1 times [2024-11-11 19:46:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:37,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035226886] [2024-11-11 19:46:37,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:46:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:46:37,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:37,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035226886] [2024-11-11 19:46:37,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035226886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:37,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:37,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:46:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805430017] [2024-11-11 19:46:37,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:37,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:46:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:37,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:46:37,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:46:37,216 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:46:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:37,271 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-11 19:46:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:46:37,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-11 19:46:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:37,273 INFO L225 Difference]: With dead ends: 33 [2024-11-11 19:46:37,273 INFO L226 Difference]: Without dead ends: 31 [2024-11-11 19:46:37,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-11 19:46:37,276 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:37,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-11 19:46:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-11 19:46:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:46:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-11 19:46:37,290 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 12 [2024-11-11 19:46:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:37,290 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-11 19:46:37,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:46:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-11 19:46:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 19:46:37,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:37,291 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:37,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:46:37,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:37,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash -924426393, now seen corresponding path program 1 times [2024-11-11 19:46:37,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:37,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918466845] [2024-11-11 19:46:37,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:46:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:46:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,402 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-11 19:46:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918466845] [2024-11-11 19:46:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918466845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:37,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:37,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:46:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616940625] [2024-11-11 19:46:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:37,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:46:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:37,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:46:37,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:46:37,408 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11 19:46:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:37,429 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2024-11-11 19:46:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:46:37,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 21 [2024-11-11 19:46:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:37,431 INFO L225 Difference]: With dead ends: 73 [2024-11-11 19:46:37,431 INFO L226 Difference]: Without dead ends: 44 [2024-11-11 19:46:37,432 INFO L434 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-11-11 19:46:37,433 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:37,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 59 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-11 19:46:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-11 19:46:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 19:46:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2024-11-11 19:46:37,451 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 21 [2024-11-11 19:46:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:37,452 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2024-11-11 19:46:37,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11 19:46:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2024-11-11 19:46:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 19:46:37,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:37,453 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:37,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:46:37,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:37,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash -219600584, now seen corresponding path program 1 times [2024-11-11 19:46:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:37,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188426939] [2024-11-11 19:46:37,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:37,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:46:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:46:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,549 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-11 19:46:37,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:37,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188426939] [2024-11-11 19:46:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188426939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:46:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921322846] [2024-11-11 19:46:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:37,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:46:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:37,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:46:37,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:46:37,556 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11 19:46:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:37,588 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2024-11-11 19:46:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:46:37,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11 19:46:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:37,591 INFO L225 Difference]: With dead ends: 110 [2024-11-11 19:46:37,591 INFO L226 Difference]: Without dead ends: 68 [2024-11-11 19:46:37,591 INFO L434 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-11-11 19:46:37,593 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:37,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-11 19:46:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-11 19:46:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 19:46:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2024-11-11 19:46:37,607 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 23 [2024-11-11 19:46:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:37,607 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2024-11-11 19:46:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11 19:46:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2024-11-11 19:46:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 19:46:37,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:37,611 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:37,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:46:37,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:37,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2139622331, now seen corresponding path program 1 times [2024-11-11 19:46:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668062302] [2024-11-11 19:46:37,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:46:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:46:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:46:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:46:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 19:46:37,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:37,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668062302] [2024-11-11 19:46:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668062302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:46:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968840429] [2024-11-11 19:46:37,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:37,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:37,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:46:37,746 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-11 19:46:37,748 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-11 19:46:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:37,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 19:46:37,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:46:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 19:46:37,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:46:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 19:46:37,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968840429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:46:37,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:46:37,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-11 19:46:37,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305563019] [2024-11-11 19:46:37,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:46:37,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:46:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:46:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:46:37,994 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 19:46:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:38,076 INFO L93 Difference]: Finished difference Result 206 states and 312 transitions. [2024-11-11 19:46:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:46:38,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2024-11-11 19:46:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:38,078 INFO L225 Difference]: With dead ends: 206 [2024-11-11 19:46:38,079 INFO L226 Difference]: Without dead ends: 140 [2024-11-11 19:46:38,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:46:38,080 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:38,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 150 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:46:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-11 19:46:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-11 19:46:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 109 states have (on average 1.4403669724770642) internal successors, (157), 109 states have internal predecessors, (157), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-11 19:46:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 211 transitions. [2024-11-11 19:46:38,108 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 211 transitions. Word has length 38 [2024-11-11 19:46:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:38,108 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 211 transitions. [2024-11-11 19:46:38,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 19:46:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 211 transitions. [2024-11-11 19:46:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-11 19:46:38,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:38,113 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:38,131 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-11 19:46:38,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:38,317 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:38,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash 685400054, now seen corresponding path program 1 times [2024-11-11 19:46:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745521145] [2024-11-11 19:46:38,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:38,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:38,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:46:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:38,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:46:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:38,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:46:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:38,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:46:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 19:46:38,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745521145] [2024-11-11 19:46:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745521145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:46:38,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019404189] [2024-11-11 19:46:38,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:38,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:46:38,447 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-11 19:46:38,453 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-11 19:46:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:38,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 19:46:38,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:46:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 19:46:38,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:46:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 19:46:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019404189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:46:38,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:46:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-11 19:46:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654057513] [2024-11-11 19:46:38,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:46:38,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:46:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:46:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:46:38,650 INFO L87 Difference]: Start difference. First operand 140 states and 211 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 19:46:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:38,723 INFO L93 Difference]: Finished difference Result 449 states and 702 transitions. [2024-11-11 19:46:38,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:46:38,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 40 [2024-11-11 19:46:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:38,729 INFO L225 Difference]: With dead ends: 449 [2024-11-11 19:46:38,729 INFO L226 Difference]: Without dead ends: 311 [2024-11-11 19:46:38,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:46:38,731 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 39 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:38,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 147 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-11 19:46:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-11 19:46:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 247 states have (on average 1.4493927125506072) internal successors, (358), 247 states have internal predecessors, (358), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-11 19:46:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 478 transitions. [2024-11-11 19:46:38,797 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 478 transitions. Word has length 40 [2024-11-11 19:46:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:38,798 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 478 transitions. [2024-11-11 19:46:38,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 19:46:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 478 transitions. [2024-11-11 19:46:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 19:46:38,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:38,807 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:38,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 19:46:39,012 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-11 19:46:39,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:39,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash -263610649, now seen corresponding path program 2 times [2024-11-11 19:46:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:39,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577177738] [2024-11-11 19:46:39,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:46:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:46:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:46:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:46:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:46:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:46:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 19:46:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 19:46:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 19:46:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 19:46:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-11 19:46:39,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:39,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577177738] [2024-11-11 19:46:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577177738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:39,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:46:39,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666548484] [2024-11-11 19:46:39,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:39,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:46:39,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:46:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:46:39,262 INFO L87 Difference]: Start difference. First operand 311 states and 478 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:46:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:39,315 INFO L93 Difference]: Finished difference Result 317 states and 483 transitions. [2024-11-11 19:46:39,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:46:39,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 89 [2024-11-11 19:46:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:39,319 INFO L225 Difference]: With dead ends: 317 [2024-11-11 19:46:39,319 INFO L226 Difference]: Without dead ends: 315 [2024-11-11 19:46:39,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:46:39,320 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:39,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-11 19:46:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-11-11 19:46:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 250 states have (on average 1.444) internal successors, (361), 250 states have internal predecessors, (361), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-11 19:46:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 481 transitions. [2024-11-11 19:46:39,361 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 481 transitions. Word has length 89 [2024-11-11 19:46:39,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:39,361 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 481 transitions. [2024-11-11 19:46:39,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:46:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 481 transitions. [2024-11-11 19:46:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 19:46:39,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:39,364 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:39,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 19:46:39,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:39,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:39,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1506107576, now seen corresponding path program 2 times [2024-11-11 19:46:39,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:39,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574552033] [2024-11-11 19:46:39,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 19:46:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:46:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:46:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:46:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:46:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:46:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 19:46:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 19:46:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 19:46:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 19:46:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-11 19:46:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574552033] [2024-11-11 19:46:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574552033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:39,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:39,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:46:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413734657] [2024-11-11 19:46:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:39,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:46:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:46:39,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:46:39,547 INFO L87 Difference]: Start difference. First operand 315 states and 481 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:46:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:39,608 INFO L93 Difference]: Finished difference Result 315 states and 481 transitions. [2024-11-11 19:46:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:46:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 91 [2024-11-11 19:46:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:39,609 INFO L225 Difference]: With dead ends: 315 [2024-11-11 19:46:39,609 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 19:46:39,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:46:39,611 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:39,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 105 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 19:46:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 19:46:39,612 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-11 19:46:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 19:46:39,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2024-11-11 19:46:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:39,616 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 19:46:39,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:46:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 19:46:39,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 19:46:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 19:46:39,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 19:46:39,622 INFO L421 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-11-11 19:46:39,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 19:46:40,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:46:40,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:46:40 BoogieIcfgContainer [2024-11-11 19:46:40,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:46:40,079 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:46:40,079 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:46:40,080 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:46:40,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:46:36" (3/4) ... [2024-11-11 19:46:40,082 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 19:46:40,087 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-11 19:46:40,092 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-11 19:46:40,092 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 19:46:40,092 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 19:46:40,092 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 19:46:40,183 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:46:40,184 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 19:46:40,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:46:40,184 INFO L158 Benchmark]: Toolchain (without parser) took 4430.09ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 108.4MB in the beginning and 95.9MB in the end (delta: 12.5MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2024-11-11 19:46:40,185 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 163.6MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:46:40,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.13ms. Allocated memory is still 163.6MB. Free memory was 108.4MB in the beginning and 96.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 19:46:40,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.78ms. Allocated memory is still 163.6MB. Free memory was 96.3MB in the beginning and 94.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:46:40,185 INFO L158 Benchmark]: Boogie Preprocessor took 44.54ms. Allocated memory is still 163.6MB. Free memory was 94.7MB in the beginning and 93.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:46:40,186 INFO L158 Benchmark]: RCFGBuilder took 326.98ms. Allocated memory is still 163.6MB. Free memory was 93.1MB in the beginning and 82.1MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 19:46:40,186 INFO L158 Benchmark]: TraceAbstraction took 3630.71ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 81.2MB in the beginning and 100.1MB in the end (delta: -18.9MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2024-11-11 19:46:40,186 INFO L158 Benchmark]: Witness Printer took 104.54ms. Allocated memory is still 230.7MB. Free memory was 100.1MB in the beginning and 95.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:46:40,188 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.11ms. Allocated memory is still 163.6MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.13ms. Allocated memory is still 163.6MB. Free memory was 108.4MB in the beginning and 96.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.78ms. Allocated memory is still 163.6MB. Free memory was 96.3MB in the beginning and 94.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.54ms. Allocated memory is still 163.6MB. Free memory was 94.7MB in the beginning and 93.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 326.98ms. Allocated memory is still 163.6MB. Free memory was 93.1MB in the beginning and 82.1MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3630.71ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 81.2MB in the beginning and 100.1MB in the end (delta: -18.9MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * Witness Printer took 104.54ms. Allocated memory is still 230.7MB. Free memory was 100.1MB in the beginning and 95.9MB 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: 13]: 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 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 801 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 559 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 242 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 782/830 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: 18]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-11 19:46:40,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE