./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/eca-rers2012/Problem10_label45.c -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 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:20:16,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:20:16,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:20:16,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:20:16,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:20:16,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:20:16,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:20:16,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:20:16,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:20:16,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:20:16,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:20:16,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:20:16,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:20:16,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:20:16,620 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:20:16,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:20:16,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:20:16,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:20:16,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:20:16,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:20:16,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:20:16,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:20:16,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:20:16,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:20:16,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:20:16,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:20:16,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:20:16,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:20:16,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:20:16,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:20:16,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:20:16,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:20:16,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:20:16,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:20:16,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:20:16,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:20:16,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:20:16,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:20:16,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:20:16,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:20:16,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:20:16,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:20:16,632 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 -> 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e [2024-11-18 10:20:16,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:20:16,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:20:16,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:20:16,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:20:16,954 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:20:16,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2024-11-18 10:20:18,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:20:18,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:20:18,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2024-11-18 10:20:18,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46641886f/6177ce675a154e7da352cf321363b098/FLAGc4b5e13ea [2024-11-18 10:20:18,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46641886f/6177ce675a154e7da352cf321363b098 [2024-11-18 10:20:18,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:20:18,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:20:18,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:20:18,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:20:18,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:20:18,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:20:18" (1/1) ... [2024-11-18 10:20:18,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e84ed85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:18, skipping insertion in model container [2024-11-18 10:20:18,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:20:18" (1/1) ... [2024-11-18 10:20:18,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:20:19,010 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/eca-rers2012/Problem10_label45.c[4437,4450] [2024-11-18 10:20:19,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:20:19,176 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:20:19,203 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/eca-rers2012/Problem10_label45.c[4437,4450] [2024-11-18 10:20:19,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:20:19,300 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:20:19,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19 WrapperNode [2024-11-18 10:20:19,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:20:19,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:20:19,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:20:19,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:20:19,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,397 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-18 10:20:19,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:20:19,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:20:19,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:20:19,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:20:19,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,476 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-18 10:20:19,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:20:19,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:20:19,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:20:19,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:20:19,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (1/1) ... [2024-11-18 10:20:19,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:20:19,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:20:19,617 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-18 10:20:19,620 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-18 10:20:19,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:20:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:20:19,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:20:19,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:20:19,747 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:20:19,748 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:20:20,858 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-18 10:20:20,858 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:20:20,882 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:20:20,884 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:20:20,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:20:20 BoogieIcfgContainer [2024-11-18 10:20:20,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:20:20,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:20:20,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:20:20,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:20:20,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:20:18" (1/3) ... [2024-11-18 10:20:20,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f02a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:20:20, skipping insertion in model container [2024-11-18 10:20:20,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:20:19" (2/3) ... [2024-11-18 10:20:20,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f02a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:20:20, skipping insertion in model container [2024-11-18 10:20:20,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:20:20" (3/3) ... [2024-11-18 10:20:20,895 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label45.c [2024-11-18 10:20:20,914 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:20:20,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:20:20,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:20:20,996 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;@182f52da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:20:20,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:20:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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-18 10:20:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 10:20:21,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:21,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:21,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:21,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2024-11-18 10:20:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829457396] [2024-11-18 10:20:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:21,401 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-18 10:20:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829457396] [2024-11-18 10:20:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829457396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:21,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:21,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:21,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262956073] [2024-11-18 10:20:21,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:21,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:21,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:21,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:21,437 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-18 10:20:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:22,352 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-18 10:20:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:22,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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) Word has length 38 [2024-11-18 10:20:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:22,367 INFO L225 Difference]: With dead ends: 552 [2024-11-18 10:20:22,368 INFO L226 Difference]: Without dead ends: 282 [2024-11-18 10:20:22,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 10:20:22,377 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:22,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 10:20:22,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-18 10:20:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-18 10:20:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 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-18 10:20:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2024-11-18 10:20:22,447 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 38 [2024-11-18 10:20:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:22,448 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2024-11-18 10:20:22,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-18 10:20:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2024-11-18 10:20:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-18 10:20:22,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:22,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:22,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:20:22,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:22,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1778439955, now seen corresponding path program 1 times [2024-11-18 10:20:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642773129] [2024-11-18 10:20:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:22,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642773129] [2024-11-18 10:20:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642773129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:22,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:22,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992383466] [2024-11-18 10:20:22,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:22,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:22,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:22,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:22,872 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-18 10:20:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:23,376 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2024-11-18 10:20:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:23,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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) Word has length 107 [2024-11-18 10:20:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:23,380 INFO L225 Difference]: With dead ends: 701 [2024-11-18 10:20:23,380 INFO L226 Difference]: Without dead ends: 421 [2024-11-18 10:20:23,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 10:20:23,383 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:23,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:20:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-18 10:20:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-18 10:20:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 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-18 10:20:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2024-11-18 10:20:23,425 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 107 [2024-11-18 10:20:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:23,425 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2024-11-18 10:20:23,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-18 10:20:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2024-11-18 10:20:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-18 10:20:23,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:23,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:23,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:20:23,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash -651687484, now seen corresponding path program 1 times [2024-11-18 10:20:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:23,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106444268] [2024-11-18 10:20:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:23,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106444268] [2024-11-18 10:20:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106444268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:23,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:23,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:20:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767853953] [2024-11-18 10:20:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:23,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:20:23,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:23,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:20:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:20:23,767 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-18 10:20:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:24,390 INFO L93 Difference]: Finished difference Result 998 states and 1484 transitions. [2024-11-18 10:20:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:20:24,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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) Word has length 113 [2024-11-18 10:20:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:24,397 INFO L225 Difference]: With dead ends: 998 [2024-11-18 10:20:24,398 INFO L226 Difference]: Without dead ends: 699 [2024-11-18 10:20:24,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:20:24,406 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 69 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:24,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 59 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:20:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-18 10:20:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-18 10:20:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.478510028653295) internal successors, (1032), 698 states have internal predecessors, (1032), 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-18 10:20:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1032 transitions. [2024-11-18 10:20:24,431 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1032 transitions. Word has length 113 [2024-11-18 10:20:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:24,432 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1032 transitions. [2024-11-18 10:20:24,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-18 10:20:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1032 transitions. [2024-11-18 10:20:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-18 10:20:24,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:24,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:24,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:20:24,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:24,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 715593968, now seen corresponding path program 1 times [2024-11-18 10:20:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:24,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181350096] [2024-11-18 10:20:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181350096] [2024-11-18 10:20:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181350096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:24,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:24,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101513837] [2024-11-18 10:20:24,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:24,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:24,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:24,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:24,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:24,563 INFO L87 Difference]: Start difference. First operand 699 states and 1032 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-18 10:20:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:25,060 INFO L93 Difference]: Finished difference Result 1952 states and 2918 transitions. [2024-11-18 10:20:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:25,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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) Word has length 132 [2024-11-18 10:20:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:25,065 INFO L225 Difference]: With dead ends: 1952 [2024-11-18 10:20:25,066 INFO L226 Difference]: Without dead ends: 1255 [2024-11-18 10:20:25,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 10:20:25,068 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:25,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 78 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:20:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-18 10:20:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 977. [2024-11-18 10:20:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3565573770491803) internal successors, (1324), 976 states have internal predecessors, (1324), 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-18 10:20:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1324 transitions. [2024-11-18 10:20:25,095 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1324 transitions. Word has length 132 [2024-11-18 10:20:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:25,095 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1324 transitions. [2024-11-18 10:20:25,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-18 10:20:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1324 transitions. [2024-11-18 10:20:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-18 10:20:25,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:25,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:25,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:20:25,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -555992780, now seen corresponding path program 1 times [2024-11-18 10:20:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:25,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221549662] [2024-11-18 10:20:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221549662] [2024-11-18 10:20:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221549662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:25,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:25,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:20:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857083692] [2024-11-18 10:20:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:25,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:20:25,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:25,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:20:25,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:20:25,493 INFO L87 Difference]: Start difference. First operand 977 states and 1324 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 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-18 10:20:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:25,991 INFO L93 Difference]: Finished difference Result 1813 states and 2498 transitions. [2024-11-18 10:20:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:20:25,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 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) Word has length 156 [2024-11-18 10:20:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:25,997 INFO L225 Difference]: With dead ends: 1813 [2024-11-18 10:20:25,997 INFO L226 Difference]: Without dead ends: 977 [2024-11-18 10:20:25,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 10:20:26,001 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:26,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 88 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:20:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-18 10:20:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-18 10:20:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3514344262295082) internal successors, (1319), 976 states have internal predecessors, (1319), 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-18 10:20:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1319 transitions. [2024-11-18 10:20:26,021 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1319 transitions. Word has length 156 [2024-11-18 10:20:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:26,022 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1319 transitions. [2024-11-18 10:20:26,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 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-18 10:20:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1319 transitions. [2024-11-18 10:20:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-18 10:20:26,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:26,025 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:26,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:20:26,025 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:26,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1954640871, now seen corresponding path program 1 times [2024-11-18 10:20:26,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:26,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128061614] [2024-11-18 10:20:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-18 10:20:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:26,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128061614] [2024-11-18 10:20:26,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128061614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:26,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:26,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:20:26,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817114462] [2024-11-18 10:20:26,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:26,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:26,167 INFO L87 Difference]: Start difference. First operand 977 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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-18 10:20:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:26,661 INFO L93 Difference]: Finished difference Result 2230 states and 3079 transitions. [2024-11-18 10:20:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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) Word has length 173 [2024-11-18 10:20:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:26,667 INFO L225 Difference]: With dead ends: 2230 [2024-11-18 10:20:26,667 INFO L226 Difference]: Without dead ends: 1394 [2024-11-18 10:20:26,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 10:20:26,670 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:26,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:20:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-18 10:20:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-11-18 10:20:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.2814070351758795) internal successors, (1785), 1393 states have internal predecessors, (1785), 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-18 10:20:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1785 transitions. [2024-11-18 10:20:26,695 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1785 transitions. Word has length 173 [2024-11-18 10:20:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:26,695 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1785 transitions. [2024-11-18 10:20:26,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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-18 10:20:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1785 transitions. [2024-11-18 10:20:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-18 10:20:26,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:26,698 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:26,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 10:20:26,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:26,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 510441368, now seen corresponding path program 1 times [2024-11-18 10:20:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:26,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407397897] [2024-11-18 10:20:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:26,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:26,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407397897] [2024-11-18 10:20:26,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407397897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:26,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:26,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:20:26,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303474922] [2024-11-18 10:20:26,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:26,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:26,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:26,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:26,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:26,847 INFO L87 Difference]: Start difference. First operand 1394 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-18 10:20:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:27,312 INFO L93 Difference]: Finished difference Result 3203 states and 4181 transitions. [2024-11-18 10:20:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:27,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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) Word has length 179 [2024-11-18 10:20:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:27,320 INFO L225 Difference]: With dead ends: 3203 [2024-11-18 10:20:27,320 INFO L226 Difference]: Without dead ends: 1950 [2024-11-18 10:20:27,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 10:20:27,325 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 69 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:27,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:20:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-11-18 10:20:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1672. [2024-11-18 10:20:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.24655894673848) internal successors, (2083), 1671 states have internal predecessors, (2083), 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-18 10:20:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2083 transitions. [2024-11-18 10:20:27,388 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2083 transitions. Word has length 179 [2024-11-18 10:20:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:27,388 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2083 transitions. [2024-11-18 10:20:27,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-18 10:20:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2083 transitions. [2024-11-18 10:20:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 10:20:27,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:27,391 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:27,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:20:27,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:27,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1308011704, now seen corresponding path program 1 times [2024-11-18 10:20:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:27,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877564896] [2024-11-18 10:20:27,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:27,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:27,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877564896] [2024-11-18 10:20:27,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877564896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:27,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:27,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:20:27,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969061482] [2024-11-18 10:20:27,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:27,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:27,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:27,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:27,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:27,609 INFO L87 Difference]: Start difference. First operand 1672 states and 2083 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-18 10:20:28,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:28,074 INFO L93 Difference]: Finished difference Result 3759 states and 4777 transitions. [2024-11-18 10:20:28,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:28,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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) Word has length 227 [2024-11-18 10:20:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:28,083 INFO L225 Difference]: With dead ends: 3759 [2024-11-18 10:20:28,083 INFO L226 Difference]: Without dead ends: 2228 [2024-11-18 10:20:28,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 10:20:28,087 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:28,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 189 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:20:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-18 10:20:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1811. [2024-11-18 10:20:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.181767955801105) internal successors, (2139), 1810 states have internal predecessors, (2139), 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-18 10:20:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2139 transitions. [2024-11-18 10:20:28,121 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2139 transitions. Word has length 227 [2024-11-18 10:20:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:28,122 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2139 transitions. [2024-11-18 10:20:28,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-18 10:20:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2139 transitions. [2024-11-18 10:20:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-18 10:20:28,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:28,126 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:28,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 10:20:28,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:28,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1226512020, now seen corresponding path program 1 times [2024-11-18 10:20:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727492174] [2024-11-18 10:20:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 228 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:28,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727492174] [2024-11-18 10:20:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727492174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:20:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788177878] [2024-11-18 10:20:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:28,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:20:28,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:20:28,870 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-18 10:20:28,874 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-18 10:20:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:29,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 10:20:29,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:20:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-18 10:20:30,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 10:20:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-18 10:20:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788177878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 10:20:32,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 10:20:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-18 10:20:32,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007312083] [2024-11-18 10:20:32,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 10:20:32,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 10:20:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:32,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 10:20:32,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-18 10:20:32,128 INFO L87 Difference]: Start difference. First operand 1811 states and 2139 transitions. Second operand has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 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-18 10:20:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:35,815 INFO L93 Difference]: Finished difference Result 7853 states and 9218 transitions. [2024-11-18 10:20:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-18 10:20:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 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) Word has length 261 [2024-11-18 10:20:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:35,839 INFO L225 Difference]: With dead ends: 7853 [2024-11-18 10:20:35,839 INFO L226 Difference]: Without dead ends: 6183 [2024-11-18 10:20:35,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2024-11-18 10:20:35,845 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2454 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 3683 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2454 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 4472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 3683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:35,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2454 Valid, 86 Invalid, 4472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 3683 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-18 10:20:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6183 states. [2024-11-18 10:20:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6183 to 2506. [2024-11-18 10:20:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.1572854291417165) internal successors, (2899), 2505 states have internal predecessors, (2899), 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-18 10:20:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2899 transitions. [2024-11-18 10:20:35,924 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2899 transitions. Word has length 261 [2024-11-18 10:20:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:35,924 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 2899 transitions. [2024-11-18 10:20:35,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 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-18 10:20:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2899 transitions. [2024-11-18 10:20:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-18 10:20:35,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:35,929 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:35,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 10:20:36,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:20:36,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:36,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1065311159, now seen corresponding path program 1 times [2024-11-18 10:20:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:36,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708326640] [2024-11-18 10:20:36,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:36,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:36,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:36,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708326640] [2024-11-18 10:20:36,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708326640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:20:36,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362758511] [2024-11-18 10:20:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:36,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:20:36,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:20:36,622 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-18 10:20:36,623 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-18 10:20:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:36,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:20:36,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:20:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-18 10:20:36,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:20:36,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362758511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:36,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:20:36,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 10:20:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983089621] [2024-11-18 10:20:36,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:36,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:36,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:36,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:36,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 10:20:36,818 INFO L87 Difference]: Start difference. First operand 2506 states and 2899 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-18 10:20:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:37,249 INFO L93 Difference]: Finished difference Result 5427 states and 6384 transitions. [2024-11-18 10:20:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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) Word has length 286 [2024-11-18 10:20:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:37,259 INFO L225 Difference]: With dead ends: 5427 [2024-11-18 10:20:37,259 INFO L226 Difference]: Without dead ends: 3062 [2024-11-18 10:20:37,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 10:20:37,263 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 104 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:37,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 226 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:20:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2024-11-18 10:20:37,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2645. [2024-11-18 10:20:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.1395612708018155) internal successors, (3013), 2644 states have internal predecessors, (3013), 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-18 10:20:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3013 transitions. [2024-11-18 10:20:37,317 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3013 transitions. Word has length 286 [2024-11-18 10:20:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:37,317 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3013 transitions. [2024-11-18 10:20:37,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-18 10:20:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3013 transitions. [2024-11-18 10:20:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-18 10:20:37,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:37,323 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:37,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 10:20:37,524 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,SelfDestructingSolverStorable9 [2024-11-18 10:20:37,524 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:37,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1398974089, now seen corresponding path program 1 times [2024-11-18 10:20:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:37,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918492087] [2024-11-18 10:20:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:37,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 180 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:20:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918492087] [2024-11-18 10:20:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918492087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:20:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713278919] [2024-11-18 10:20:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:38,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:20:38,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:20:38,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 10:20:38,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 10:20:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:38,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:20:38,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:20:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-18 10:20:38,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:20:38,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713278919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:38,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:20:38,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 10:20:38,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283713065] [2024-11-18 10:20:38,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:38,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:38,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:38,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 10:20:38,347 INFO L87 Difference]: Start difference. First operand 2645 states and 3013 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-18 10:20:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:38,768 INFO L93 Difference]: Finished difference Result 5149 states and 5881 transitions. [2024-11-18 10:20:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:38,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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) Word has length 300 [2024-11-18 10:20:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:38,777 INFO L225 Difference]: With dead ends: 5149 [2024-11-18 10:20:38,778 INFO L226 Difference]: Without dead ends: 2645 [2024-11-18 10:20:38,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 10:20:38,781 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:38,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 19 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:20:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2024-11-18 10:20:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2645. [2024-11-18 10:20:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.126323751891074) internal successors, (2978), 2644 states have internal predecessors, (2978), 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-18 10:20:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 2978 transitions. [2024-11-18 10:20:38,822 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 2978 transitions. Word has length 300 [2024-11-18 10:20:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:38,822 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 2978 transitions. [2024-11-18 10:20:38,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-18 10:20:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 2978 transitions. [2024-11-18 10:20:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-18 10:20:38,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:20:38,828 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:38,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 10:20:39,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:20:39,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:20:39,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:20:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1472236450, now seen corresponding path program 1 times [2024-11-18 10:20:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:20:39,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077080192] [2024-11-18 10:20:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:20:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:20:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:20:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-11-18 10:20:39,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:20:39,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077080192] [2024-11-18 10:20:39,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077080192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:20:39,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:20:39,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:20:39,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334558426] [2024-11-18 10:20:39,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:20:39,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:20:39,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:20:39,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:20:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:20:39,208 INFO L87 Difference]: Start difference. First operand 2645 states and 2978 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-18 10:20:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:20:39,647 INFO L93 Difference]: Finished difference Result 5703 states and 6411 transitions. [2024-11-18 10:20:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:20:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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) Word has length 310 [2024-11-18 10:20:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:20:39,648 INFO L225 Difference]: With dead ends: 5703 [2024-11-18 10:20:39,648 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 10:20:39,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 10:20:39,653 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 104 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:20:39,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 223 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:20:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 10:20:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 10:20:39,654 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-18 10:20:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 10:20:39,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 310 [2024-11-18 10:20:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:20:39,655 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 10:20:39,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-18 10:20:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 10:20:39,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 10:20:39,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 10:20:39,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 10:20:39,662 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:20:39,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 10:20:40,290 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 10:20:40,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:20:40 BoogieIcfgContainer [2024-11-18 10:20:40,318 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 10:20:40,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 10:20:40,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 10:20:40,319 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 10:20:40,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:20:20" (3/4) ... [2024-11-18 10:20:40,322 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 10:20:40,342 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-18 10:20:40,345 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 10:20:40,346 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 10:20:40,346 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 10:20:40,500 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 10:20:40,505 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 10:20:40,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 10:20:40,506 INFO L158 Benchmark]: Toolchain (without parser) took 21779.49ms. Allocated memory was 172.0MB in the beginning and 553.6MB in the end (delta: 381.7MB). Free memory was 113.3MB in the beginning and 353.7MB in the end (delta: -240.4MB). Peak memory consumption was 144.4MB. Max. memory is 16.1GB. [2024-11-18 10:20:40,506 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 10:20:40,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.05ms. Allocated memory is still 172.0MB. Free memory was 112.8MB in the beginning and 82.9MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-18 10:20:40,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.62ms. Allocated memory is still 172.0MB. Free memory was 82.9MB in the beginning and 75.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 10:20:40,507 INFO L158 Benchmark]: Boogie Preprocessor took 181.12ms. Allocated memory was 172.0MB in the beginning and 253.8MB in the end (delta: 81.8MB). Free memory was 75.0MB in the beginning and 215.9MB in the end (delta: -140.8MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-18 10:20:40,508 INFO L158 Benchmark]: RCFGBuilder took 1304.20ms. Allocated memory is still 253.8MB. Free memory was 215.9MB in the beginning and 122.5MB in the end (delta: 93.3MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-11-18 10:20:40,508 INFO L158 Benchmark]: TraceAbstraction took 19430.06ms. Allocated memory was 253.8MB in the beginning and 553.6MB in the end (delta: 299.9MB). Free memory was 121.5MB in the beginning and 366.2MB in the end (delta: -244.8MB). Peak memory consumption was 183.1MB. Max. memory is 16.1GB. [2024-11-18 10:20:40,509 INFO L158 Benchmark]: Witness Printer took 186.82ms. Allocated memory is still 553.6MB. Free memory was 366.2MB in the beginning and 353.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 10:20:40,510 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.20ms. Allocated memory is still 172.0MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.05ms. Allocated memory is still 172.0MB. Free memory was 112.8MB in the beginning and 82.9MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.62ms. Allocated memory is still 172.0MB. Free memory was 82.9MB in the beginning and 75.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 181.12ms. Allocated memory was 172.0MB in the beginning and 253.8MB in the end (delta: 81.8MB). Free memory was 75.0MB in the beginning and 215.9MB in the end (delta: -140.8MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1304.20ms. Allocated memory is still 253.8MB. Free memory was 215.9MB in the beginning and 122.5MB in the end (delta: 93.3MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19430.06ms. Allocated memory was 253.8MB in the beginning and 553.6MB in the end (delta: 299.9MB). Free memory was 121.5MB in the beginning and 366.2MB in the end (delta: -244.8MB). Peak memory consumption was 183.1MB. Max. memory is 16.1GB. * Witness Printer took 186.82ms. Allocated memory is still 553.6MB. Free memory was 366.2MB in the beginning and 353.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 128]: 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 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3432 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3432 mSDsluCounter, 1345 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 1463 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8181 IncrementalHoareTripleChecker+Invalid, 9644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1463 mSolverCounterUnsat, 1214 mSDtfsCounter, 8181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1157 GetRequests, 1113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2645occurred in iteration=10, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 5067 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3129 NumberOfCodeBlocks, 3129 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3374 ConstructedInterpolants, 0 QuantifiedInterpolants, 17340 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1206 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 2279/2860 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: 592]: Loop Invariant Derived loop invariant: ((((((((((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && (4 <= a10)) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) || (((a10 <= 0) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0)))) || ((((a10 == 1) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (9 <= a19))) || ((((a19 == 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (a10 == 2))) || ((((a10 == 0) && (a19 == 9)) && (14 == a4)) && (a12 == 0))) || (((((a19 == 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (14 == a4)) && (a12 == 0))) || (((0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (a19 <= 7))) || ((((a19 <= 9) && (219 <= a1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-18 10:20:40,543 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