./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.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 6f4877babf2234c4d9f84af37e06b0d1c35e333b586df80a0a3a6ac5b1b8e2d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:34:09,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:34:09,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:34:09,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:34:09,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:34:09,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:34:09,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:34:09,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:34:09,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:34:09,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:34:09,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:34:09,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:34:09,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:34:09,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:34:09,526 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:34:09,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:34:09,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:34:09,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:34:09,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:34:09,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:34:09,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:34:09,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:34:09,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:34:09,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:34:09,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:34:09,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:34:09,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:34:09,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:34:09,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:34:09,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:34:09,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:34:09,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:34:09,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:34:09,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:34:09,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:34:09,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:34:09,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:34:09,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:34:09,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:34:09,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:34:09,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:34:09,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:34:09,537 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 -> 6f4877babf2234c4d9f84af37e06b0d1c35e333b586df80a0a3a6ac5b1b8e2d2 [2024-10-12 18:34:09,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:34:09,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:34:09,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:34:09,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:34:09,764 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:34:09,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-10-12 18:34:11,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:34:11,326 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:34:11,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-10-12 18:34:11,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c37f28e/a62f98465cf841b28551bf4843c85f79/FLAG10a17f1e3 [2024-10-12 18:34:11,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c37f28e/a62f98465cf841b28551bf4843c85f79 [2024-10-12 18:34:11,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:34:11,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:34:11,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:34:11,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:34:11,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:34:11,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a11f822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11, skipping insertion in model container [2024-10-12 18:34:11,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:34:11,492 WARN L248 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/as2013-hybrid.i[802,815] [2024-10-12 18:34:11,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:34:11,506 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:34:11,515 WARN L248 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/as2013-hybrid.i[802,815] [2024-10-12 18:34:11,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:34:11,527 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:34:11,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11 WrapperNode [2024-10-12 18:34:11,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:34:11,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:34:11,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:34:11,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:34:11,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,547 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-10-12 18:34:11,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:34:11,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:34:11,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:34:11,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:34:11,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,562 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-10-12 18:34:11,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:34:11,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:34:11,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:34:11,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:34:11,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (1/1) ... [2024-10-12 18:34:11,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:34:11,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:34:11,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:34:11,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:34:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:34:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:34:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:34:11,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:34:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:34:11,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:34:11,669 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:34:11,670 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:34:11,730 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-12 18:34:11,730 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:34:11,744 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:34:11,744 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 18:34:11,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:34:11 BoogieIcfgContainer [2024-10-12 18:34:11,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:34:11,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:34:11,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:34:11,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:34:11,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:34:11" (1/3) ... [2024-10-12 18:34:11,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48feac77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:34:11, skipping insertion in model container [2024-10-12 18:34:11,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:11" (2/3) ... [2024-10-12 18:34:11,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48feac77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:34:11, skipping insertion in model container [2024-10-12 18:34:11,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:34:11" (3/3) ... [2024-10-12 18:34:11,751 INFO L112 eAbstractionObserver]: Analyzing ICFG as2013-hybrid.i [2024-10-12 18:34:11,763 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:34:11,763 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:34:11,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:34:11,819 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;@147427e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:34:11,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:34:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:34:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:34:11,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:11,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:11,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:11,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1125893624, now seen corresponding path program 1 times [2024-10-12 18:34:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:11,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908243529] [2024-10-12 18:34:11,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:11,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:34:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:12,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908243529] [2024-10-12 18:34:12,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908243529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:12,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:12,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:34:12,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249147348] [2024-10-12 18:34:12,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:12,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:34:12,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:34:12,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:34:12,030 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.0) 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-10-12 18:34:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:12,090 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2024-10-12 18:34:12,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:34:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.0) 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-10-12 18:34:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:12,098 INFO L225 Difference]: With dead ends: 35 [2024-10-12 18:34:12,098 INFO L226 Difference]: Without dead ends: 20 [2024-10-12 18:34:12,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:12,103 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:12,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 46 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-12 18:34:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-10-12 18:34:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:34:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-10-12 18:34:12,183 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 7 [2024-10-12 18:34:12,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:12,193 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-10-12 18:34:12,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.0) 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-10-12 18:34:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-10-12 18:34:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 18:34:12,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:12,196 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:12,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:34:12,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:12,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1538564498, now seen corresponding path program 1 times [2024-10-12 18:34:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:12,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624044666] [2024-10-12 18:34:12,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:34:12,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:12,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624044666] [2024-10-12 18:34:12,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624044666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:12,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:12,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:34:12,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472925575] [2024-10-12 18:34:12,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:12,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:34:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:12,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:34:12,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:34:12,357 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-10-12 18:34:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:12,395 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-10-12 18:34:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:34:12,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-10-12 18:34:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:12,396 INFO L225 Difference]: With dead ends: 48 [2024-10-12 18:34:12,396 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:34:12,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:12,398 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:12,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:34:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-10-12 18:34:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-10-12 18:34:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-12 18:34:12,411 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 12 [2024-10-12 18:34:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:12,411 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-12 18:34:12,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-10-12 18:34:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-12 18:34:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 18:34:12,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:12,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:12,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:34:12,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:12,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash -560863639, now seen corresponding path program 1 times [2024-10-12 18:34:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:12,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329749725] [2024-10-12 18:34:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:12,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:34:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:34:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329749725] [2024-10-12 18:34:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329749725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:12,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:34:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520218029] [2024-10-12 18:34:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:12,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:34:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:12,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:34:12,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:34:12,442 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-10-12 18:34:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:12,455 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-10-12 18:34:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:34:12,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 16 [2024-10-12 18:34:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:12,456 INFO L225 Difference]: With dead ends: 65 [2024-10-12 18:34:12,456 INFO L226 Difference]: Without dead ends: 37 [2024-10-12 18:34:12,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:34:12,457 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:12,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 25 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-12 18:34:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2024-10-12 18:34:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-10-12 18:34:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-12 18:34:12,467 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2024-10-12 18:34:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:12,468 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-12 18:34:12,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-10-12 18:34:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-12 18:34:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:34:12,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:12,469 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:12,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:34:12,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1268038168, now seen corresponding path program 1 times [2024-10-12 18:34:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614404667] [2024-10-12 18:34:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:34:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:34:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:34:12,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614404667] [2024-10-12 18:34:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614404667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:34:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759571746] [2024-10-12 18:34:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:12,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:34:12,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:34:12,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:34:12,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:34:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:12,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 18:34:12,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:34:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 18:34:12,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:34:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:34:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759571746] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:34:12,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:34:12,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 18:34:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525060858] [2024-10-12 18:34:12,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:34:12,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:34:12,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:12,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:34:12,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:12,662 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 18:34:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:12,699 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2024-10-12 18:34:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:34:12,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 28 [2024-10-12 18:34:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:12,700 INFO L225 Difference]: With dead ends: 85 [2024-10-12 18:34:12,701 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 18:34:12,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 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-10-12 18:34:12,702 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:12,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 18:34:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 18:34:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-12 18:34:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2024-10-12 18:34:12,711 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 28 [2024-10-12 18:34:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:12,711 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2024-10-12 18:34:12,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 18:34:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2024-10-12 18:34:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 18:34:12,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:12,713 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:12,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 18:34:12,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:34:12,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:12,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1079460507, now seen corresponding path program 2 times [2024-10-12 18:34:12,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919357621] [2024-10-12 18:34:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:12,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:34:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:34:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 18:34:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 18:34:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 18:34:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 18:34:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 18:34:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:34:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-12 18:34:13,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919357621] [2024-10-12 18:34:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919357621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:13,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:13,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:34:13,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431449080] [2024-10-12 18:34:13,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:13,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:34:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:13,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:34:13,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:34:13,049 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:34:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:13,080 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-10-12 18:34:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:34:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2024-10-12 18:34:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:13,081 INFO L225 Difference]: With dead ends: 55 [2024-10-12 18:34:13,081 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 18:34:13,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:13,083 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:13,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 18:34:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 18:34:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:34:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 18:34:13,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-10-12 18:34:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:13,085 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 18:34:13,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:34:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 18:34:13,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 18:34:13,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:34:13,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:34:13,090 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-10-12 18:34:13,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 18:34:13,218 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:34:13,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:34:13 BoogieIcfgContainer [2024-10-12 18:34:13,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:34:13,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:34:13,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:34:13,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:34:13,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:34:11" (3/4) ... [2024-10-12 18:34:13,244 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 18:34:13,251 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-12 18:34:13,259 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-12 18:34:13,259 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 18:34:13,259 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 18:34:13,259 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 18:34:13,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:34:13,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 18:34:13,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:34:13,325 INFO L158 Benchmark]: Toolchain (without parser) took 1975.72ms. Allocated memory is still 226.5MB. Free memory was 159.0MB in the beginning and 96.7MB in the end (delta: 62.3MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-10-12 18:34:13,326 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:34:13,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.81ms. Allocated memory is still 226.5MB. Free memory was 158.8MB in the beginning and 147.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 18:34:13,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.59ms. Allocated memory is still 226.5MB. Free memory was 147.0MB in the beginning and 145.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:34:13,327 INFO L158 Benchmark]: Boogie Preprocessor took 20.35ms. Allocated memory is still 226.5MB. Free memory was 145.6MB in the beginning and 144.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:34:13,327 INFO L158 Benchmark]: RCFGBuilder took 176.37ms. Allocated memory is still 226.5MB. Free memory was 143.9MB in the beginning and 133.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 18:34:13,327 INFO L158 Benchmark]: TraceAbstraction took 1490.36ms. Allocated memory is still 226.5MB. Free memory was 132.5MB in the beginning and 100.9MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-12 18:34:13,328 INFO L158 Benchmark]: Witness Printer took 87.66ms. Allocated memory is still 226.5MB. Free memory was 100.9MB in the beginning and 96.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 18:34:13,329 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.13ms. Allocated memory is still 113.2MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.81ms. Allocated memory is still 226.5MB. Free memory was 158.8MB in the beginning and 147.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.59ms. Allocated memory is still 226.5MB. Free memory was 147.0MB in the beginning and 145.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.35ms. Allocated memory is still 226.5MB. Free memory was 145.6MB in the beginning and 144.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 176.37ms. Allocated memory is still 226.5MB. Free memory was 143.9MB in the beginning and 133.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1490.36ms. Allocated memory is still 226.5MB. Free memory was 132.5MB in the beginning and 100.9MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 87.66ms. Allocated memory is still 226.5MB. Free memory was 100.9MB in the beginning and 96.7MB 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, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 65 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 279/282 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: 19]: Loop Invariant Derived loop invariant: ((i <= 10) && (1 <= i)) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((i == 0) || ((1 <= i) && (i <= 9))) - 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-10-12 18:34:13,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE