./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label16.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/Problem01_label16.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 2464e957c33404298d60b891632e9df008614058c749595a2f9c32bf73970bbc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:18:30,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:18:30,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:18:30,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:18:30,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:18:30,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:18:30,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:18:30,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:18:30,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:18:30,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:18:30,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:18:30,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:18:30,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:18:30,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:18:30,922 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:18:30,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:18:30,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:18:30,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:18:30,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:18:30,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:18:30,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:18:30,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:18:30,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:18:30,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:18:30,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:18:30,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:18:30,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:18:30,929 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:18:30,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:18:30,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:18:30,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:18:30,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:18:30,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:18:30,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:18:30,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:18:30,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:18:30,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:18:30,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:18:30,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:18:30,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:18:30,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:18:30,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:18:30,934 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 -> 2464e957c33404298d60b891632e9df008614058c749595a2f9c32bf73970bbc [2024-11-21 21:18:31,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:18:31,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:18:31,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:18:31,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:18:31,242 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:18:31,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2024-11-21 21:18:32,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:18:32,947 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:18:32,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2024-11-21 21:18:32,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22d61d85/3f3d6cdeab5d43648619fb24004e847e/FLAGddceb2097 [2024-11-21 21:18:32,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22d61d85/3f3d6cdeab5d43648619fb24004e847e [2024-11-21 21:18:32,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:18:32,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:18:32,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:18:32,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:18:32,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:18:32,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:18:32" (1/1) ... [2024-11-21 21:18:32,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749eba5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:32, skipping insertion in model container [2024-11-21 21:18:32,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:18:32" (1/1) ... [2024-11-21 21:18:33,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:18:33,387 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/Problem01_label16.c[21710,21723] [2024-11-21 21:18:33,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:18:33,436 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:18:33,541 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/Problem01_label16.c[21710,21723] [2024-11-21 21:18:33,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:18:33,567 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:18:33,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33 WrapperNode [2024-11-21 21:18:33,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:18:33,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:18:33,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:18:33,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:18:33,576 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:18:33" (1/1) ... [2024-11-21 21:18:33,610 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:18:33" (1/1) ... [2024-11-21 21:18:33,676 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-11-21 21:18:33,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:18:33,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:18:33,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:18:33,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:18:33,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,717 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:18:33,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:18:33,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:18:33,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:18:33,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:18:33,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (1/1) ... [2024-11-21 21:18:33,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:18:33,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:18:33,826 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:18:33,833 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:18:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:18:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:18:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:18:33,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:18:33,964 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:18:33,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:18:34,932 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-21 21:18:34,932 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:18:34,956 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:18:34,957 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:18:34,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:18:34 BoogieIcfgContainer [2024-11-21 21:18:34,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:18:34,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:18:34,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:18:34,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:18:34,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:18:32" (1/3) ... [2024-11-21 21:18:34,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5205b829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:18:34, skipping insertion in model container [2024-11-21 21:18:34,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:33" (2/3) ... [2024-11-21 21:18:34,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5205b829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:18:34, skipping insertion in model container [2024-11-21 21:18:34,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:18:34" (3/3) ... [2024-11-21 21:18:34,968 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label16.c [2024-11-21 21:18:34,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:18:34,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:18:35,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:18:35,072 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;@42e5416a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:18:35,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:18:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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:18:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-21 21:18:35,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:35,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:35,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:35,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1597904809, now seen corresponding path program 1 times [2024-11-21 21:18:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:35,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323092291] [2024-11-21 21:18:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:36,117 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:18:36,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323092291] [2024-11-21 21:18:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323092291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:36,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:36,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259333113] [2024-11-21 21:18:36,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:36,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:18:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:36,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:18:36,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:18:36,156 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 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:18:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:37,256 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2024-11-21 21:18:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:18:37,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2024-11-21 21:18:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:37,273 INFO L225 Difference]: With dead ends: 662 [2024-11-21 21:18:37,273 INFO L226 Difference]: Without dead ends: 397 [2024-11-21 21:18:37,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:18:37,279 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 295 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:37,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 81 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-21 21:18:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-21 21:18:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-11-21 21:18:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 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:18:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions. [2024-11-21 21:18:37,331 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 130 [2024-11-21 21:18:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:37,332 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 517 transitions. [2024-11-21 21:18:37,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 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:18:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions. [2024-11-21 21:18:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-21 21:18:37,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:37,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:37,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:18:37,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:37,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:37,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2061250518, now seen corresponding path program 1 times [2024-11-21 21:18:37,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:37,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745397584] [2024-11-21 21:18:37,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:37,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:18:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745397584] [2024-11-21 21:18:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745397584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:37,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:37,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032057897] [2024-11-21 21:18:37,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:37,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:18:37,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:37,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:18:37,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:18:37,808 INFO L87 Difference]: Start difference. First operand 397 states and 517 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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:18:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:38,486 INFO L93 Difference]: Finished difference Result 887 states and 1235 transitions. [2024-11-21 21:18:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:18:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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 137 [2024-11-21 21:18:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:38,489 INFO L225 Difference]: With dead ends: 887 [2024-11-21 21:18:38,489 INFO L226 Difference]: Without dead ends: 528 [2024-11-21 21:18:38,490 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:18:38,492 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:38,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 81 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:18:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-21 21:18:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2024-11-21 21:18:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 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:18:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions. [2024-11-21 21:18:38,514 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 137 [2024-11-21 21:18:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:38,515 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 474 transitions. [2024-11-21 21:18:38,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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:18:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions. [2024-11-21 21:18:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-21 21:18:38,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:38,519 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:38,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:18:38,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:38,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1412559080, now seen corresponding path program 1 times [2024-11-21 21:18:38,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004097483] [2024-11-21 21:18:38,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:38,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-21 21:18:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004097483] [2024-11-21 21:18:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004097483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:38,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:38,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:18:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115017741] [2024-11-21 21:18:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:38,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:38,702 INFO L87 Difference]: Start difference. First operand 397 states and 474 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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:18:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:39,082 INFO L93 Difference]: Finished difference Result 923 states and 1105 transitions. [2024-11-21 21:18:39,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:39,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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 145 [2024-11-21 21:18:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:39,085 INFO L225 Difference]: With dead ends: 923 [2024-11-21 21:18:39,085 INFO L226 Difference]: Without dead ends: 528 [2024-11-21 21:18:39,086 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:18:39,087 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 124 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:39,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 47 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:18:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-21 21:18:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2024-11-21 21:18:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.1707779886148009) internal successors, (617), 527 states have internal predecessors, (617), 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:18:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 617 transitions. [2024-11-21 21:18:39,102 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 617 transitions. Word has length 145 [2024-11-21 21:18:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:39,102 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 617 transitions. [2024-11-21 21:18:39,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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:18:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 617 transitions. [2024-11-21 21:18:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-21 21:18:39,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:39,105 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:39,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:18:39,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:39,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1258753994, now seen corresponding path program 1 times [2024-11-21 21:18:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:39,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844979253] [2024-11-21 21:18:39,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-21 21:18:39,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:39,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844979253] [2024-11-21 21:18:39,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844979253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:39,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:39,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889865119] [2024-11-21 21:18:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:39,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:39,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:39,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:39,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:39,230 INFO L87 Difference]: Start difference. First operand 528 states and 617 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:18:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:39,604 INFO L93 Difference]: Finished difference Result 1578 states and 1846 transitions. [2024-11-21 21:18:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 154 [2024-11-21 21:18:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:39,608 INFO L225 Difference]: With dead ends: 1578 [2024-11-21 21:18:39,608 INFO L226 Difference]: Without dead ends: 1052 [2024-11-21 21:18:39,609 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:18:39,610 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:39,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 30 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:18:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-21 21:18:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2024-11-21 21:18:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.1880434782608695) internal successors, (1093), 920 states have internal predecessors, (1093), 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:18:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1093 transitions. [2024-11-21 21:18:39,628 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1093 transitions. Word has length 154 [2024-11-21 21:18:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:39,629 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1093 transitions. [2024-11-21 21:18:39,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:18:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1093 transitions. [2024-11-21 21:18:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-21 21:18:39,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:39,632 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:39,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:18:39,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:39,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash -202707990, now seen corresponding path program 1 times [2024-11-21 21:18:39,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:39,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223335180] [2024-11-21 21:18:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-21 21:18:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:39,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223335180] [2024-11-21 21:18:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223335180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494370361] [2024-11-21 21:18:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:39,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:18:39,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:39,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:18:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:18:39,855 INFO L87 Difference]: Start difference. First operand 921 states and 1093 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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:18:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:40,423 INFO L93 Difference]: Finished difference Result 2364 states and 2853 transitions. [2024-11-21 21:18:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:18:40,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2024-11-21 21:18:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:40,428 INFO L225 Difference]: With dead ends: 2364 [2024-11-21 21:18:40,429 INFO L226 Difference]: Without dead ends: 1445 [2024-11-21 21:18:40,430 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:18:40,432 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 258 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:40,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 35 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:18:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-21 21:18:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1052. [2024-11-21 21:18:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.1722169362511894) internal successors, (1232), 1051 states have internal predecessors, (1232), 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:18:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1232 transitions. [2024-11-21 21:18:40,462 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1232 transitions. Word has length 179 [2024-11-21 21:18:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:40,463 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1232 transitions. [2024-11-21 21:18:40,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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:18:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1232 transitions. [2024-11-21 21:18:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-21 21:18:40,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:40,467 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:40,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:18:40,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:40,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash -390660857, now seen corresponding path program 1 times [2024-11-21 21:18:40,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:40,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177572727] [2024-11-21 21:18:40,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:40,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-21 21:18:40,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177572727] [2024-11-21 21:18:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177572727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:40,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:40,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017256496] [2024-11-21 21:18:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:18:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:18:40,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:18:40,729 INFO L87 Difference]: Start difference. First operand 1052 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 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:18:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:41,279 INFO L93 Difference]: Finished difference Result 2626 states and 3090 transitions. [2024-11-21 21:18:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:18:41,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 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 193 [2024-11-21 21:18:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:41,285 INFO L225 Difference]: With dead ends: 2626 [2024-11-21 21:18:41,285 INFO L226 Difference]: Without dead ends: 1576 [2024-11-21 21:18:41,287 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:18:41,288 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 344 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:41,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 44 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:18:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-21 21:18:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2024-11-21 21:18:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.164819944598338) internal successors, (1682), 1444 states have internal predecessors, (1682), 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:18:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2024-11-21 21:18:41,341 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 193 [2024-11-21 21:18:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:41,343 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2024-11-21 21:18:41,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 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:18:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2024-11-21 21:18:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-21 21:18:41,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:41,349 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:18:41,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2098359784, now seen corresponding path program 1 times [2024-11-21 21:18:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864557921] [2024-11-21 21:18:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-21 21:18:41,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864557921] [2024-11-21 21:18:41,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864557921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:41,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:41,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:18:41,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094111391] [2024-11-21 21:18:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:41,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:18:41,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:41,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:18:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:18:41,620 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:18:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:42,223 INFO L93 Difference]: Finished difference Result 3281 states and 3801 transitions. [2024-11-21 21:18:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:18:42,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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 235 [2024-11-21 21:18:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:42,229 INFO L225 Difference]: With dead ends: 3281 [2024-11-21 21:18:42,230 INFO L226 Difference]: Without dead ends: 1838 [2024-11-21 21:18:42,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:18:42,232 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 222 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:42,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 33 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:18:42,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-21 21:18:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2024-11-21 21:18:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1498412698412699) internal successors, (1811), 1575 states have internal predecessors, (1811), 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:18:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1811 transitions. [2024-11-21 21:18:42,262 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1811 transitions. Word has length 235 [2024-11-21 21:18:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:42,263 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1811 transitions. [2024-11-21 21:18:42,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:18:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1811 transitions. [2024-11-21 21:18:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-21 21:18:42,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:42,269 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:18:42,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:18:42,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:42,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1816324024, now seen corresponding path program 1 times [2024-11-21 21:18:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061282887] [2024-11-21 21:18:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-21 21:18:42,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:42,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061282887] [2024-11-21 21:18:42,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061282887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:42,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:42,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549562098] [2024-11-21 21:18:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:42,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:42,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:42,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:42,440 INFO L87 Difference]: Start difference. First operand 1576 states and 1811 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:18:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:42,802 INFO L93 Difference]: Finished difference Result 3412 states and 3893 transitions. [2024-11-21 21:18:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:42,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 278 [2024-11-21 21:18:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:42,808 INFO L225 Difference]: With dead ends: 3412 [2024-11-21 21:18:42,808 INFO L226 Difference]: Without dead ends: 1838 [2024-11-21 21:18:42,810 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:18:42,811 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:42,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 178 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:18:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-21 21:18:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2024-11-21 21:18:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1201641266119577) internal successors, (1911), 1706 states have internal predecessors, (1911), 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:18:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1911 transitions. [2024-11-21 21:18:42,883 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1911 transitions. Word has length 278 [2024-11-21 21:18:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:42,884 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1911 transitions. [2024-11-21 21:18:42,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:18:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1911 transitions. [2024-11-21 21:18:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-21 21:18:42,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:42,889 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:18:42,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:18:42,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:42,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1789279583, now seen corresponding path program 1 times [2024-11-21 21:18:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:42,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243904395] [2024-11-21 21:18:42,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-21 21:18:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243904395] [2024-11-21 21:18:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243904395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:43,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:18:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418320135] [2024-11-21 21:18:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:43,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:18:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:43,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:18:43,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:18:43,483 INFO L87 Difference]: Start difference. First operand 1707 states and 1911 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:18:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:44,126 INFO L93 Difference]: Finished difference Result 3543 states and 3954 transitions. [2024-11-21 21:18:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:18:44,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2024-11-21 21:18:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:44,135 INFO L225 Difference]: With dead ends: 3543 [2024-11-21 21:18:44,135 INFO L226 Difference]: Without dead ends: 1838 [2024-11-21 21:18:44,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:18:44,140 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 226 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:44,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 48 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:18:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-21 21:18:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2024-11-21 21:18:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.100234466588511) internal successors, (1877), 1706 states have internal predecessors, (1877), 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:18:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2024-11-21 21:18:44,179 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 300 [2024-11-21 21:18:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:44,180 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2024-11-21 21:18:44,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:18:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2024-11-21 21:18:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-21 21:18:44,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:44,188 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:18:44,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 21:18:44,188 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:44,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1143968849, now seen corresponding path program 1 times [2024-11-21 21:18:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:44,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013860489] [2024-11-21 21:18:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-21 21:18:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:44,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013860489] [2024-11-21 21:18:44,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013860489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:44,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:44,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:44,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755462718] [2024-11-21 21:18:44,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:44,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:44,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:44,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:44,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:44,443 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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:18:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:44,832 INFO L93 Difference]: Finished difference Result 3803 states and 4172 transitions. [2024-11-21 21:18:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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 320 [2024-11-21 21:18:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:44,834 INFO L225 Difference]: With dead ends: 3803 [2024-11-21 21:18:44,834 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 21:18:44,838 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:18:44,839 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:44,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 170 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:18:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 21:18:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 21:18:44,840 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:18:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 21:18:44,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 320 [2024-11-21 21:18:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:44,841 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 21:18:44,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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:18:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 21:18:44,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 21:18:44,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:18:44,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 21:18:44,849 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:18:44,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 21:18:45,189 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:18:45,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:18:45 BoogieIcfgContainer [2024-11-21 21:18:45,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:18:45,210 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:18:45,210 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:18:45,210 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:18:45,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:18:34" (3/4) ... [2024-11-21 21:18:45,213 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 21:18:45,226 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 21:18:45,227 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 21:18:45,228 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 21:18:45,229 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 21:18:45,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 21:18:45,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 21:18:45,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:18:45,384 INFO L158 Benchmark]: Toolchain (without parser) took 12394.04ms. Allocated memory was 144.7MB in the beginning and 377.5MB in the end (delta: 232.8MB). Free memory was 88.2MB in the beginning and 218.4MB in the end (delta: -130.2MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2024-11-21 21:18:45,384 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 144.7MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:18:45,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.08ms. Allocated memory is still 144.7MB. Free memory was 88.2MB in the beginning and 58.4MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-21 21:18:45,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.34ms. Allocated memory was 144.7MB in the beginning and 201.3MB in the end (delta: 56.6MB). Free memory was 58.4MB in the beginning and 169.4MB in the end (delta: -111.0MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-21 21:18:45,385 INFO L158 Benchmark]: Boogie Preprocessor took 103.13ms. Allocated memory is still 201.3MB. Free memory was 169.4MB in the beginning and 164.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 21:18:45,385 INFO L158 Benchmark]: RCFGBuilder took 1176.51ms. Allocated memory is still 201.3MB. Free memory was 164.2MB in the beginning and 79.2MB in the end (delta: 84.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-11-21 21:18:45,385 INFO L158 Benchmark]: TraceAbstraction took 10248.68ms. Allocated memory was 201.3MB in the beginning and 377.5MB in the end (delta: 176.2MB). Free memory was 78.2MB in the beginning and 230.9MB in the end (delta: -152.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-21 21:18:45,386 INFO L158 Benchmark]: Witness Printer took 173.61ms. Allocated memory is still 377.5MB. Free memory was 230.9MB in the beginning and 218.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 21:18:45,387 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.22ms. Allocated memory is still 144.7MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.08ms. Allocated memory is still 144.7MB. Free memory was 88.2MB in the beginning and 58.4MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.34ms. Allocated memory was 144.7MB in the beginning and 201.3MB in the end (delta: 56.6MB). Free memory was 58.4MB in the beginning and 169.4MB in the end (delta: -111.0MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.13ms. Allocated memory is still 201.3MB. Free memory was 169.4MB in the beginning and 164.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1176.51ms. Allocated memory is still 201.3MB. Free memory was 164.2MB in the beginning and 79.2MB in the end (delta: 84.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10248.68ms. Allocated memory was 201.3MB in the beginning and 377.5MB in the end (delta: 176.2MB). Free memory was 78.2MB in the beginning and 230.9MB in the end (delta: -152.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Witness Printer took 173.61ms. Allocated memory is still 377.5MB. Free memory was 230.9MB in the beginning and 218.4MB 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: 576]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1824 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1824 mSDsluCounter, 747 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 831 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4573 IncrementalHoareTripleChecker+Invalid, 5404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 831 mSolverCounterUnsat, 661 mSDtfsCounter, 4573 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=8, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2071 NumberOfCodeBlocks, 2071 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2061 ConstructedInterpolants, 0 QuantifiedInterpolants, 7188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 1728/1728 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: 593]: Loop Invariant Derived loop invariant: (((((a21 == 1) && (a16 <= 5)) || ((a8 <= 13) && (a20 == 1))) || ((a7 != 1) && (a21 == 1))) || (((a8 <= 13) && (a17 == 1)) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2024-11-21 21:18:45,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE