./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label40.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 f0697d9089c8f644e106fd291328f66f211f5f9eb49bfcc0a5bab680b0bbbbc1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:20:04,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:20:04,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:20:04,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:20:04,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:20:04,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:20:04,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:20:04,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:20:04,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:20:04,869 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:20:04,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:20:04,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:20:04,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:20:04,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:20:04,871 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:20:04,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:20:04,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:20:04,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:20:04,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:20:04,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:20:04,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:20:04,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:20:04,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:20:04,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:20:04,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:20:04,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:20:04,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:20:04,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:20:04,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:20:04,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:20:04,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:20:04,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:20:04,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:20:04,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:20:04,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:20:04,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:20:04,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:20:04,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:20:04,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:20:04,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:20:04,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:20:04,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:20:04,886 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 -> f0697d9089c8f644e106fd291328f66f211f5f9eb49bfcc0a5bab680b0bbbbc1 [2024-11-21 21:20:05,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:20:05,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:20:05,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:20:05,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:20:05,170 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:20:05,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label40.c [2024-11-21 21:20:06,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:20:06,983 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:20:06,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label40.c [2024-11-21 21:20:06,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349886692/a552461c283a4013a8fc3f622a59febd/FLAG3d54c7ddb [2024-11-21 21:20:07,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349886692/a552461c283a4013a8fc3f622a59febd [2024-11-21 21:20:07,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:20:07,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:20:07,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:20:07,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:20:07,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:20:07,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d75a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07, skipping insertion in model container [2024-11-21 21:20:07,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:20:07,428 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/Problem02_label40.c[15538,15551] [2024-11-21 21:20:07,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:20:07,481 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:20:07,545 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/Problem02_label40.c[15538,15551] [2024-11-21 21:20:07,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:20:07,585 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:20:07,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07 WrapperNode [2024-11-21 21:20:07,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:20:07,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:20:07,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:20:07,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:20:07,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,672 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-21 21:20:07,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:20:07,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:20:07,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:20:07,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:20:07,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,710 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-21 21:20:07,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:20:07,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:20:07,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:20:07,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:20:07,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (1/1) ... [2024-11-21 21:20:07,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:20:07,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:20:07,815 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-21 21:20:07,818 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-21 21:20:07,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:20:07,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:20:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:20:07,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:20:07,942 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:20:07,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:20:08,940 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 21:20:08,940 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:20:08,961 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:20:08,962 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:20:08,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:20:08 BoogieIcfgContainer [2024-11-21 21:20:08,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:20:08,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:20:08,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:20:08,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:20:08,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:20:07" (1/3) ... [2024-11-21 21:20:08,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a560e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:20:08, skipping insertion in model container [2024-11-21 21:20:08,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:07" (2/3) ... [2024-11-21 21:20:08,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a560e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:20:08, skipping insertion in model container [2024-11-21 21:20:08,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:20:08" (3/3) ... [2024-11-21 21:20:08,970 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label40.c [2024-11-21 21:20:08,982 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:20:08,982 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:20:09,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:20:09,059 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;@3cc1060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:20:09,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:20:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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-21 21:20:09,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-21 21:20:09,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:09,077 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, 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-21 21:20:09,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:09,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash 427661899, now seen corresponding path program 1 times [2024-11-21 21:20:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:09,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550239764] [2024-11-21 21:20:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:09,575 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-21 21:20:09,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550239764] [2024-11-21 21:20:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550239764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:09,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:09,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177719417] [2024-11-21 21:20:09,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:09,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:09,621 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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-21 21:20:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:10,470 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2024-11-21 21:20:10,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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 89 [2024-11-21 21:20:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:10,487 INFO L225 Difference]: With dead ends: 630 [2024-11-21 21:20:10,487 INFO L226 Difference]: Without dead ends: 318 [2024-11-21 21:20:10,491 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-21 21:20:10,494 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 141 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:10,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 21:20:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-21 21:20:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-21 21:20:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 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-21 21:20:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2024-11-21 21:20:10,551 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 89 [2024-11-21 21:20:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:10,551 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2024-11-21 21:20:10,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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-21 21:20:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2024-11-21 21:20:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-21 21:20:10,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:10,557 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-21 21:20:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:20:10,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1584478528, now seen corresponding path program 1 times [2024-11-21 21:20:10,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:10,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633355478] [2024-11-21 21:20:10,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633355478] [2024-11-21 21:20:10,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633355478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:10,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:10,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636609094] [2024-11-21 21:20:10,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:10,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:20:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:10,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:20:10,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:20:10,966 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 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-21 21:20:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:11,700 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2024-11-21 21:20:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:20:11,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-21 21:20:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:11,704 INFO L225 Difference]: With dead ends: 999 [2024-11-21 21:20:11,705 INFO L226 Difference]: Without dead ends: 600 [2024-11-21 21:20:11,706 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-21 21:20:11,707 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 171 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:11,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 113 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 21:20:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-21 21:20:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-21 21:20:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.358931552587646) internal successors, (814), 599 states have internal predecessors, (814), 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-21 21:20:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 814 transitions. [2024-11-21 21:20:11,737 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 814 transitions. Word has length 93 [2024-11-21 21:20:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:11,737 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 814 transitions. [2024-11-21 21:20:11,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 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-21 21:20:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 814 transitions. [2024-11-21 21:20:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-21 21:20:11,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:11,741 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-21 21:20:11,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:20:11,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:11,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1935066262, now seen corresponding path program 1 times [2024-11-21 21:20:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:11,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717416908] [2024-11-21 21:20:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:11,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:11,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:11,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717416908] [2024-11-21 21:20:11,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717416908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:11,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:11,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:11,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294319838] [2024-11-21 21:20:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:11,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:11,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:11,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:11,859 INFO L87 Difference]: Start difference. First operand 600 states and 814 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-21 21:20:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:12,234 INFO L93 Difference]: Finished difference Result 1781 states and 2421 transitions. [2024-11-21 21:20:12,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:12,234 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-21 21:20:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:12,238 INFO L225 Difference]: With dead ends: 1781 [2024-11-21 21:20:12,238 INFO L226 Difference]: Without dead ends: 1183 [2024-11-21 21:20:12,240 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-21 21:20:12,241 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:12,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 99 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:20:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2024-11-21 21:20:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1173. [2024-11-21 21:20:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.3131399317406143) internal successors, (1539), 1172 states have internal predecessors, (1539), 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-21 21:20:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1539 transitions. [2024-11-21 21:20:12,267 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1539 transitions. Word has length 107 [2024-11-21 21:20:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:12,267 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1539 transitions. [2024-11-21 21:20:12,268 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-21 21:20:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1539 transitions. [2024-11-21 21:20:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-21 21:20:12,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:12,276 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, 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-21 21:20:12,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:20:12,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:12,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1355718265, now seen corresponding path program 1 times [2024-11-21 21:20:12,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:12,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572200240] [2024-11-21 21:20:12,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:12,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:12,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:12,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572200240] [2024-11-21 21:20:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572200240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:12,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:12,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:12,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576038450] [2024-11-21 21:20:12,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:12,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:12,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:12,382 INFO L87 Difference]: Start difference. First operand 1173 states and 1539 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 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-21 21:20:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:12,844 INFO L93 Difference]: Finished difference Result 3329 states and 4392 transitions. [2024-11-21 21:20:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:12,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 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-21 21:20:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:12,851 INFO L225 Difference]: With dead ends: 3329 [2024-11-21 21:20:12,851 INFO L226 Difference]: Without dead ends: 2158 [2024-11-21 21:20:12,853 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-21 21:20:12,854 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 125 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:12,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 128 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:20:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2024-11-21 21:20:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2024-11-21 21:20:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.201949860724234) internal successors, (2589), 2154 states have internal predecessors, (2589), 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-21 21:20:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2589 transitions. [2024-11-21 21:20:12,893 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2589 transitions. Word has length 113 [2024-11-21 21:20:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:12,894 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2589 transitions. [2024-11-21 21:20:12,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 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-21 21:20:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2589 transitions. [2024-11-21 21:20:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-21 21:20:12,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:12,898 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-21 21:20:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:20:12,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:12,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1989413815, now seen corresponding path program 1 times [2024-11-21 21:20:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725424255] [2024-11-21 21:20:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 21:20:13,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725424255] [2024-11-21 21:20:13,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725424255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:13,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:13,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:13,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891091427] [2024-11-21 21:20:13,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:13,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:13,131 INFO L87 Difference]: Start difference. First operand 2155 states and 2589 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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-21 21:20:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:13,606 INFO L93 Difference]: Finished difference Result 5304 states and 6436 transitions. [2024-11-21 21:20:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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 116 [2024-11-21 21:20:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:13,617 INFO L225 Difference]: With dead ends: 5304 [2024-11-21 21:20:13,617 INFO L226 Difference]: Without dead ends: 2871 [2024-11-21 21:20:13,621 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-21 21:20:13,622 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 72 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:13,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 227 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:20:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2024-11-21 21:20:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2856. [2024-11-21 21:20:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2855 states have (on average 1.1936952714535902) internal successors, (3408), 2855 states have internal predecessors, (3408), 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-21 21:20:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3408 transitions. [2024-11-21 21:20:13,673 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3408 transitions. Word has length 116 [2024-11-21 21:20:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:13,673 INFO L471 AbstractCegarLoop]: Abstraction has 2856 states and 3408 transitions. [2024-11-21 21:20:13,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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-21 21:20:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3408 transitions. [2024-11-21 21:20:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-21 21:20:13,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:13,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-21 21:20:13,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:20:13,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:13,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 443706062, now seen corresponding path program 1 times [2024-11-21 21:20:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138243928] [2024-11-21 21:20:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:13,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138243928] [2024-11-21 21:20:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138243928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45014647] [2024-11-21 21:20:13,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:13,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:13,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:13,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:13,793 INFO L87 Difference]: Start difference. First operand 2856 states and 3408 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-21 21:20:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:14,290 INFO L93 Difference]: Finished difference Result 6832 states and 8225 transitions. [2024-11-21 21:20:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118 [2024-11-21 21:20:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:14,303 INFO L225 Difference]: With dead ends: 6832 [2024-11-21 21:20:14,304 INFO L226 Difference]: Without dead ends: 3978 [2024-11-21 21:20:14,307 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-21 21:20:14,308 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:14,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 59 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:20:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2024-11-21 21:20:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3832. [2024-11-21 21:20:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 3831 states have (on average 1.1944661968154529) internal successors, (4576), 3831 states have internal predecessors, (4576), 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-21 21:20:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4576 transitions. [2024-11-21 21:20:14,374 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 4576 transitions. Word has length 118 [2024-11-21 21:20:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:14,375 INFO L471 AbstractCegarLoop]: Abstraction has 3832 states and 4576 transitions. [2024-11-21 21:20:14,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-21 21:20:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 4576 transitions. [2024-11-21 21:20:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-21 21:20:14,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:14,380 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 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-21 21:20:14,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:20:14,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:14,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:14,381 INFO L85 PathProgramCache]: Analyzing trace with hash 667063112, now seen corresponding path program 1 times [2024-11-21 21:20:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:14,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538548409] [2024-11-21 21:20:14,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:14,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 21:20:14,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538548409] [2024-11-21 21:20:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538548409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:14,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:14,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:14,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202424990] [2024-11-21 21:20:14,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:14,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:14,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:14,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:14,492 INFO L87 Difference]: Start difference. First operand 3832 states and 4576 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-21 21:20:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:14,932 INFO L93 Difference]: Finished difference Result 8663 states and 10394 transitions. [2024-11-21 21:20:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:14,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 124 [2024-11-21 21:20:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:14,946 INFO L225 Difference]: With dead ends: 8663 [2024-11-21 21:20:14,947 INFO L226 Difference]: Without dead ends: 4833 [2024-11-21 21:20:14,950 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-21 21:20:14,951 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 156 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:14,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 253 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:20:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2024-11-21 21:20:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4133. [2024-11-21 21:20:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4133 states, 4132 states have (on average 1.1844143272023233) internal successors, (4894), 4132 states have internal predecessors, (4894), 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-21 21:20:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 4894 transitions. [2024-11-21 21:20:15,021 INFO L78 Accepts]: Start accepts. Automaton has 4133 states and 4894 transitions. Word has length 124 [2024-11-21 21:20:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:15,021 INFO L471 AbstractCegarLoop]: Abstraction has 4133 states and 4894 transitions. [2024-11-21 21:20:15,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-21 21:20:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4133 states and 4894 transitions. [2024-11-21 21:20:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-21 21:20:15,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:15,027 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:20:15,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:20:15,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:15,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash 822674727, now seen corresponding path program 1 times [2024-11-21 21:20:15,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:15,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10734695] [2024-11-21 21:20:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:15,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 21:20:15,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:15,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10734695] [2024-11-21 21:20:15,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10734695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:15,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:15,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483582835] [2024-11-21 21:20:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:15,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:15,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:15,105 INFO L87 Difference]: Start difference. First operand 4133 states and 4894 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-21 21:20:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:15,523 INFO L93 Difference]: Finished difference Result 7534 states and 8929 transitions. [2024-11-21 21:20:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:15,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 133 [2024-11-21 21:20:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:15,534 INFO L225 Difference]: With dead ends: 7534 [2024-11-21 21:20:15,534 INFO L226 Difference]: Without dead ends: 2843 [2024-11-21 21:20:15,539 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-21 21:20:15,541 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 141 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:15,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 243 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:20:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2024-11-21 21:20:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2563. [2024-11-21 21:20:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2562 states have (on average 1.1174863387978142) internal successors, (2863), 2562 states have internal predecessors, (2863), 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-21 21:20:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 2863 transitions. [2024-11-21 21:20:15,584 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 2863 transitions. Word has length 133 [2024-11-21 21:20:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:15,584 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 2863 transitions. [2024-11-21 21:20:15,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-21 21:20:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 2863 transitions. [2024-11-21 21:20:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-21 21:20:15,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:15,589 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2024-11-21 21:20:15,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:20:15,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:15,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash -497470912, now seen corresponding path program 1 times [2024-11-21 21:20:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105671621] [2024-11-21 21:20:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 21:20:15,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:15,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105671621] [2024-11-21 21:20:15,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105671621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:15,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:15,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248249391] [2024-11-21 21:20:15,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:15,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:15,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:15,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:15,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:15,730 INFO L87 Difference]: Start difference. First operand 2563 states and 2863 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-21 21:20:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:16,149 INFO L93 Difference]: Finished difference Result 5408 states and 6023 transitions. [2024-11-21 21:20:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:16,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-21 21:20:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:16,160 INFO L225 Difference]: With dead ends: 5408 [2024-11-21 21:20:16,161 INFO L226 Difference]: Without dead ends: 2564 [2024-11-21 21:20:16,165 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-21 21:20:16,167 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:16,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 252 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:20:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-21 21:20:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2560. [2024-11-21 21:20:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2559 states have (on average 1.0937866354044548) internal successors, (2799), 2559 states have internal predecessors, (2799), 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-21 21:20:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 2799 transitions. [2024-11-21 21:20:16,209 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 2799 transitions. Word has length 156 [2024-11-21 21:20:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:16,209 INFO L471 AbstractCegarLoop]: Abstraction has 2560 states and 2799 transitions. [2024-11-21 21:20:16,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-21 21:20:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 2799 transitions. [2024-11-21 21:20:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-21 21:20:16,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:16,218 INFO L215 NwaCegarLoop]: trace histogram [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, 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-21 21:20:16,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 21:20:16,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:16,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1875690035, now seen corresponding path program 1 times [2024-11-21 21:20:16,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:16,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297515678] [2024-11-21 21:20:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 21:20:16,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:16,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297515678] [2024-11-21 21:20:16,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297515678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:16,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:16,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:20:16,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599513816] [2024-11-21 21:20:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:16,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:20:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:16,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:20:16,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:20:16,631 INFO L87 Difference]: Start difference. First operand 2560 states and 2799 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 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-21 21:20:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:17,180 INFO L93 Difference]: Finished difference Result 2648 states and 2886 transitions. [2024-11-21 21:20:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:20:17,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 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 163 [2024-11-21 21:20:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:17,188 INFO L225 Difference]: With dead ends: 2648 [2024-11-21 21:20:17,188 INFO L226 Difference]: Without dead ends: 2420 [2024-11-21 21:20:17,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:20:17,190 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 184 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:17,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 98 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:20:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2024-11-21 21:20:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2420. [2024-11-21 21:20:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 2419 states have (on average 1.097147581645308) internal successors, (2654), 2419 states have internal predecessors, (2654), 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-21 21:20:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2654 transitions. [2024-11-21 21:20:17,226 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2654 transitions. Word has length 163 [2024-11-21 21:20:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:17,227 INFO L471 AbstractCegarLoop]: Abstraction has 2420 states and 2654 transitions. [2024-11-21 21:20:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 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-21 21:20:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2654 transitions. [2024-11-21 21:20:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-21 21:20:17,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:17,232 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:20:17,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 21:20:17,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:17,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash 460269918, now seen corresponding path program 1 times [2024-11-21 21:20:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:17,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513920333] [2024-11-21 21:20:17,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 21:20:17,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:17,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513920333] [2024-11-21 21:20:17,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513920333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:17,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:17,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:17,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338800623] [2024-11-21 21:20:17,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:17,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:17,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:17,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:17,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:17,365 INFO L87 Difference]: Start difference. First operand 2420 states and 2654 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-21 21:20:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:17,767 INFO L93 Difference]: Finished difference Result 5398 states and 5967 transitions. [2024-11-21 21:20:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:17,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 177 [2024-11-21 21:20:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:17,777 INFO L225 Difference]: With dead ends: 5398 [2024-11-21 21:20:17,777 INFO L226 Difference]: Without dead ends: 2980 [2024-11-21 21:20:17,780 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-21 21:20:17,780 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 136 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:17,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 200 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:20:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2024-11-21 21:20:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2699. [2024-11-21 21:20:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2698 states have (on average 1.094885100074129) internal successors, (2954), 2698 states have internal predecessors, (2954), 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-21 21:20:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 2954 transitions. [2024-11-21 21:20:17,817 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 2954 transitions. Word has length 177 [2024-11-21 21:20:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:17,817 INFO L471 AbstractCegarLoop]: Abstraction has 2699 states and 2954 transitions. [2024-11-21 21:20:17,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-21 21:20:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 2954 transitions. [2024-11-21 21:20:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-21 21:20:17,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:17,822 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 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-21 21:20:17,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 21:20:17,823 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:17,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1560166325, now seen corresponding path program 1 times [2024-11-21 21:20:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:17,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093273394] [2024-11-21 21:20:17,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:17,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-21 21:20:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093273394] [2024-11-21 21:20:17,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093273394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:17,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:17,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382450470] [2024-11-21 21:20:17,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:17,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:17,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:17,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:17,931 INFO L87 Difference]: Start difference. First operand 2699 states and 2954 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-21 21:20:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:18,278 INFO L93 Difference]: Finished difference Result 4681 states and 5086 transitions. [2024-11-21 21:20:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 200 [2024-11-21 21:20:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:18,279 INFO L225 Difference]: With dead ends: 4681 [2024-11-21 21:20:18,279 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 21:20:18,283 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-21 21:20:18,284 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 171 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:18,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 57 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 21:20:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 21:20:18,285 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-21 21:20:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 21:20:18,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2024-11-21 21:20:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:18,286 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 21:20:18,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-21 21:20:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 21:20:18,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 21:20:18,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:20:18,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 21:20:18,294 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:18,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 21:20:18,630 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:20:18,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:20:18 BoogieIcfgContainer [2024-11-21 21:20:18,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:20:18,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:20:18,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:20:18,650 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:20:18,650 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:20:08" (3/4) ... [2024-11-21 21:20:18,653 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 21:20:18,669 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 21:20:18,670 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 21:20:18,670 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 21:20:18,671 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 21:20:18,814 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 21:20:18,814 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 21:20:18,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:20:18,815 INFO L158 Benchmark]: Toolchain (without parser) took 11794.65ms. Allocated memory was 184.5MB in the beginning and 308.3MB in the end (delta: 123.7MB). Free memory was 124.8MB in the beginning and 223.1MB in the end (delta: -98.2MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-21 21:20:18,815 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:20:18,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.08ms. Allocated memory is still 184.5MB. Free memory was 124.5MB in the beginning and 142.1MB in the end (delta: -17.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 21:20:18,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.89ms. Allocated memory is still 184.5MB. Free memory was 142.1MB in the beginning and 136.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 21:20:18,816 INFO L158 Benchmark]: Boogie Preprocessor took 106.65ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 130.7MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-21 21:20:18,816 INFO L158 Benchmark]: RCFGBuilder took 1181.96ms. Allocated memory is still 184.5MB. Free memory was 130.7MB in the beginning and 138.5MB in the end (delta: -7.8MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2024-11-21 21:20:18,817 INFO L158 Benchmark]: TraceAbstraction took 9685.28ms. Allocated memory was 184.5MB in the beginning and 308.3MB in the end (delta: 123.7MB). Free memory was 137.6MB in the beginning and 235.7MB in the end (delta: -98.1MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. [2024-11-21 21:20:18,817 INFO L158 Benchmark]: Witness Printer took 164.72ms. Allocated memory is still 308.3MB. Free memory was 235.7MB in the beginning and 223.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 21:20:18,819 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.19ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.08ms. Allocated memory is still 184.5MB. Free memory was 124.5MB in the beginning and 142.1MB in the end (delta: -17.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.89ms. Allocated memory is still 184.5MB. Free memory was 142.1MB in the beginning and 136.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.65ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 130.7MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1181.96ms. Allocated memory is still 184.5MB. Free memory was 130.7MB in the beginning and 138.5MB in the end (delta: -7.8MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9685.28ms. Allocated memory was 184.5MB in the beginning and 308.3MB in the end (delta: 123.7MB). Free memory was 137.6MB in the beginning and 235.7MB in the end (delta: -98.1MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. * Witness Printer took 164.72ms. Allocated memory is still 308.3MB. Free memory was 235.7MB in the beginning and 223.1MB 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: 449]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1727 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1727 mSDsluCounter, 1848 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 240 mSDsCounter, 826 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4979 IncrementalHoareTripleChecker+Invalid, 5805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 826 mSolverCounterUnsat, 1608 mSDtfsCounter, 4979 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4133occurred in iteration=7, InterpolantAutomatonStates: 38, 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, 1439 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1589 NumberOfCodeBlocks, 1589 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1577 ConstructedInterpolants, 0 QuantifiedInterpolants, 5755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 810/810 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: 616]: Loop Invariant Derived loop invariant: ((((((((((((((a25 == 1) && (a11 <= 0)) && (a19 == 1)) || (((a11 <= 0) && (a28 <= 10)) && (a19 == 1))) || ((a19 == 0) && (a11 == 1))) || ((11 <= a28) && (a11 == 1))) || (((9 <= a28) && (a11 == 1)) && (a19 == 1))) || (((((a17 == 8) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a19 == 1))) || (((a19 == 0) && (a11 <= 0)) && (a28 <= 7))) || ((((a25 == 1) && (a11 == 1)) && (a19 == 1)) && (a28 <= 7))) || ((((a19 == 0) && (9 <= a28)) && (a11 <= 0)) && (a28 <= 10))) || (((a19 == 0) && (a11 <= 0)) && (a25 == 0))) || ((((a19 == 0) && (a11 <= 0)) && (a28 <= 10)) && (a25 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1)) && (a28 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-21 21:20:18,838 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