./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label05.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 6631d0bd13862b684e6a1ef7d33df65b972a07047361d83162cfc056e8521a6a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:05:48,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:05:48,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:05:48,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:05:48,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:05:48,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:05:48,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:05:48,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:05:48,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:05:48,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:05:48,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:05:48,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:05:48,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:05:48,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:05:48,144 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:05:48,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:05:48,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:05:48,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:05:48,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:05:48,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:05:48,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:05:48,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:05:48,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:05:48,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:05:48,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:05:48,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:05:48,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:05:48,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:05:48,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:05:48,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:05:48,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:05:48,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:05:48,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:05:48,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:05:48,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:05:48,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:05:48,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:05:48,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:05:48,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:05:48,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:05:48,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:05:48,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:05:48,152 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 -> 6631d0bd13862b684e6a1ef7d33df65b972a07047361d83162cfc056e8521a6a [2024-11-11 16:05:48,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:05:48,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:05:48,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:05:48,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:05:48,339 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:05:48,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label05.c [2024-11-11 16:05:49,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:05:49,900 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:05:49,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c [2024-11-11 16:05:49,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bc5c241/1ccc921482a2450a8a2563c1d7731a49/FLAGaede47b24 [2024-11-11 16:05:50,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bc5c241/1ccc921482a2450a8a2563c1d7731a49 [2024-11-11 16:05:50,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:05:50,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:05:50,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:05:50,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:05:50,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:05:50,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:50,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7c8a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50, skipping insertion in model container [2024-11-11 16:05:50,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:50,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:05:50,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c[19738,19751] [2024-11-11 16:05:50,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:05:50,726 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:05:50,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c[19738,19751] [2024-11-11 16:05:50,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:05:50,888 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:05:50,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50 WrapperNode [2024-11-11 16:05:50,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:05:50,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:05:50,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:05:50,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:05:50,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:50,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:50,967 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-11 16:05:50,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:05:50,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:05:50,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:05:50,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:05:50,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:50,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:50,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:50,996 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:05:50,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:50,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:51,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:51,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:51,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:51,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:51,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:05:51,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:05:51,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:05:51,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:05:51,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (1/1) ... [2024-11-11 16:05:51,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:05:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:05:51,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:05:51,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:05:51,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:05:51,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:05:51,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:05:51,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:05:51,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:05:51,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:05:51,865 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-11 16:05:51,865 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:05:51,885 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:05:51,886 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:05:51,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:05:51 BoogieIcfgContainer [2024-11-11 16:05:51,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:05:51,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:05:51,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:05:51,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:05:51,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:05:50" (1/3) ... [2024-11-11 16:05:51,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234b37f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:05:51, skipping insertion in model container [2024-11-11 16:05:51,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:05:50" (2/3) ... [2024-11-11 16:05:51,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234b37f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:05:51, skipping insertion in model container [2024-11-11 16:05:51,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:05:51" (3/3) ... [2024-11-11 16:05:51,895 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05.c [2024-11-11 16:05:51,912 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:05:51,912 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:05:51,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:05:51,976 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;@44d6dde5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:05:51,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:05:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 16:05:51,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:51,990 INFO L218 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] [2024-11-11 16:05:51,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash 224978685, now seen corresponding path program 1 times [2024-11-11 16:05:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:52,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077198948] [2024-11-11 16:05:52,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:05:52,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:52,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077198948] [2024-11-11 16:05:52,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077198948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:52,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:52,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:05:52,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540591062] [2024-11-11 16:05:52,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:52,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:52,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:52,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:52,664 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:53,295 INFO L93 Difference]: Finished difference Result 600 states and 1037 transitions. [2024-11-11 16:05:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:53,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-11-11 16:05:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:53,305 INFO L225 Difference]: With dead ends: 600 [2024-11-11 16:05:53,306 INFO L226 Difference]: Without dead ends: 309 [2024-11-11 16:05:53,308 INFO L434 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-11 16:05:53,310 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 40 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:53,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:05:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-11 16:05:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-11 16:05:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-11 16:05:53,345 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 126 [2024-11-11 16:05:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:53,346 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-11 16:05:53,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-11 16:05:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 16:05:53,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:53,349 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 16:05:53,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:05:53,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:53,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash -750392, now seen corresponding path program 1 times [2024-11-11 16:05:53,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:53,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341825683] [2024-11-11 16:05:53,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:53,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 16:05:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341825683] [2024-11-11 16:05:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341825683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:53,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:53,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:05:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98646239] [2024-11-11 16:05:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:53,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:53,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:53,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:53,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:53,564 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:53,955 INFO L93 Difference]: Finished difference Result 893 states and 1184 transitions. [2024-11-11 16:05:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:53,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 131 [2024-11-11 16:05:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:53,962 INFO L225 Difference]: With dead ends: 893 [2024-11-11 16:05:53,962 INFO L226 Difference]: Without dead ends: 588 [2024-11-11 16:05:53,965 INFO L434 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-11 16:05:53,966 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 92 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:53,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 44 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:05:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-11 16:05:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 448. [2024-11-11 16:05:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.3914988814317673) internal successors, (622), 447 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 622 transitions. [2024-11-11 16:05:53,985 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 622 transitions. Word has length 131 [2024-11-11 16:05:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:53,985 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 622 transitions. [2024-11-11 16:05:53,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 622 transitions. [2024-11-11 16:05:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 16:05:53,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:53,988 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:05:53,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:05:53,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:53,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1327285959, now seen corresponding path program 1 times [2024-11-11 16:05:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:53,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120362583] [2024-11-11 16:05:53,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:05:54,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120362583] [2024-11-11 16:05:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120362583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:54,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:05:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069482673] [2024-11-11 16:05:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:54,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:54,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:54,103 INFO L87 Difference]: Start difference. First operand 448 states and 622 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 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-11 16:05:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:54,490 INFO L93 Difference]: Finished difference Result 1327 states and 1846 transitions. [2024-11-11 16:05:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:54,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 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-11 16:05:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:54,494 INFO L225 Difference]: With dead ends: 1327 [2024-11-11 16:05:54,494 INFO L226 Difference]: Without dead ends: 881 [2024-11-11 16:05:54,494 INFO L434 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-11 16:05:54,495 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:54,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 71 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:05:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-11 16:05:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 740. [2024-11-11 16:05:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.3355886332882274) internal successors, (987), 739 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 987 transitions. [2024-11-11 16:05:54,512 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 987 transitions. Word has length 137 [2024-11-11 16:05:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:54,512 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 987 transitions. [2024-11-11 16:05:54,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 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-11 16:05:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 987 transitions. [2024-11-11 16:05:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-11 16:05:54,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:54,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:05:54,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:05:54,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:54,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -209271223, now seen corresponding path program 1 times [2024-11-11 16:05:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:54,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861920094] [2024-11-11 16:05:54,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:05:54,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:54,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861920094] [2024-11-11 16:05:54,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861920094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:54,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:54,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:05:54,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119724661] [2024-11-11 16:05:54,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:54,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:54,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:54,603 INFO L87 Difference]: Start difference. First operand 740 states and 987 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:54,955 INFO L93 Difference]: Finished difference Result 2191 states and 2929 transitions. [2024-11-11 16:05:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:54,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 149 [2024-11-11 16:05:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:54,960 INFO L225 Difference]: With dead ends: 2191 [2024-11-11 16:05:54,960 INFO L226 Difference]: Without dead ends: 1453 [2024-11-11 16:05:54,961 INFO L434 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-11 16:05:54,962 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 152 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:54,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 114 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:05:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-11-11 16:05:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1164. [2024-11-11 16:05:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.3155631986242475) internal successors, (1530), 1163 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1530 transitions. [2024-11-11 16:05:54,988 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1530 transitions. Word has length 149 [2024-11-11 16:05:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:54,989 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1530 transitions. [2024-11-11 16:05:54,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1530 transitions. [2024-11-11 16:05:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 16:05:54,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:54,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:05:54,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:05:54,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:54,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:54,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2084281269, now seen corresponding path program 1 times [2024-11-11 16:05:54,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:54,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62125362] [2024-11-11 16:05:54,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:54,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:05:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62125362] [2024-11-11 16:05:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62125362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:05:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210852492] [2024-11-11 16:05:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:55,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:55,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:55,135 INFO L87 Difference]: Start difference. First operand 1164 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:55,485 INFO L93 Difference]: Finished difference Result 2890 states and 3862 transitions. [2024-11-11 16:05:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2024-11-11 16:05:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:55,490 INFO L225 Difference]: With dead ends: 2890 [2024-11-11 16:05:55,490 INFO L226 Difference]: Without dead ends: 1728 [2024-11-11 16:05:55,491 INFO L434 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-11 16:05:55,493 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 137 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:55,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 241 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:05:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2024-11-11 16:05:55,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1728. [2024-11-11 16:05:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 1.2588303416328894) internal successors, (2174), 1727 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2174 transitions. [2024-11-11 16:05:55,516 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2174 transitions. Word has length 157 [2024-11-11 16:05:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:55,516 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2174 transitions. [2024-11-11 16:05:55,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2174 transitions. [2024-11-11 16:05:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 16:05:55,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:55,519 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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-11 16:05:55,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:05:55,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:55,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash -981462150, now seen corresponding path program 1 times [2024-11-11 16:05:55,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:55,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601651745] [2024-11-11 16:05:55,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:55,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 16:05:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:55,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601651745] [2024-11-11 16:05:55,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601651745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:55,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:55,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:05:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677120778] [2024-11-11 16:05:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:55,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:55,593 INFO L87 Difference]: Start difference. First operand 1728 states and 2174 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 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-11 16:05:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:55,948 INFO L93 Difference]: Finished difference Result 4714 states and 5891 transitions. [2024-11-11 16:05:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:55,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 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 169 [2024-11-11 16:05:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:55,957 INFO L225 Difference]: With dead ends: 4714 [2024-11-11 16:05:55,958 INFO L226 Difference]: Without dead ends: 2988 [2024-11-11 16:05:55,959 INFO L434 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-11 16:05:55,961 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 179 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:55,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:05:55,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2024-11-11 16:05:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2988. [2024-11-11 16:05:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2988 states, 2987 states have (on average 1.2012052226314027) internal successors, (3588), 2987 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 3588 transitions. [2024-11-11 16:05:55,997 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 3588 transitions. Word has length 169 [2024-11-11 16:05:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:55,997 INFO L471 AbstractCegarLoop]: Abstraction has 2988 states and 3588 transitions. [2024-11-11 16:05:55,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 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-11 16:05:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 3588 transitions. [2024-11-11 16:05:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-11 16:05:56,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:56,002 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:05:56,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:05:56,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash 845932029, now seen corresponding path program 1 times [2024-11-11 16:05:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015056216] [2024-11-11 16:05:56,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 16:05:56,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:56,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015056216] [2024-11-11 16:05:56,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015056216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:56,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:56,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:05:56,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761244507] [2024-11-11 16:05:56,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:56,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:56,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:56,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:56,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:56,087 INFO L87 Difference]: Start difference. First operand 2988 states and 3588 transitions. Second operand has 3 states, 3 states have (on average 53.0) 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-11 16:05:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:56,398 INFO L93 Difference]: Finished difference Result 6536 states and 7786 transitions. [2024-11-11 16:05:56,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:56,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) 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 198 [2024-11-11 16:05:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:56,405 INFO L225 Difference]: With dead ends: 6536 [2024-11-11 16:05:56,405 INFO L226 Difference]: Without dead ends: 2985 [2024-11-11 16:05:56,409 INFO L434 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-11 16:05:56,409 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:56,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 50 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:05:56,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2024-11-11 16:05:56,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2984. [2024-11-11 16:05:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2983 states have (on average 1.1210191082802548) internal successors, (3344), 2983 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 3344 transitions. [2024-11-11 16:05:56,441 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 3344 transitions. Word has length 198 [2024-11-11 16:05:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:56,441 INFO L471 AbstractCegarLoop]: Abstraction has 2984 states and 3344 transitions. [2024-11-11 16:05:56,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) 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-11 16:05:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 3344 transitions. [2024-11-11 16:05:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-11 16:05:56,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:56,445 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:05:56,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:05:56,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:56,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash -649639097, now seen corresponding path program 1 times [2024-11-11 16:05:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:56,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242240356] [2024-11-11 16:05:56,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:56,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 16:05:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242240356] [2024-11-11 16:05:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242240356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:05:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091038426] [2024-11-11 16:05:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:56,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:56,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:56,542 INFO L87 Difference]: Start difference. First operand 2984 states and 3344 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:56,832 INFO L93 Difference]: Finished difference Result 6253 states and 6988 transitions. [2024-11-11 16:05:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 202 [2024-11-11 16:05:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:56,839 INFO L225 Difference]: With dead ends: 6253 [2024-11-11 16:05:56,839 INFO L226 Difference]: Without dead ends: 3131 [2024-11-11 16:05:56,842 INFO L434 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-11 16:05:56,842 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 140 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:56,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 242 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:05:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2024-11-11 16:05:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2983. [2024-11-11 16:05:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2982 states have (on average 1.0938967136150235) internal successors, (3262), 2982 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3262 transitions. [2024-11-11 16:05:56,874 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3262 transitions. Word has length 202 [2024-11-11 16:05:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 3262 transitions. [2024-11-11 16:05:56,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3262 transitions. [2024-11-11 16:05:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-11 16:05:56,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:56,879 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:05:56,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:05:56,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:56,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 95408104, now seen corresponding path program 1 times [2024-11-11 16:05:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:56,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261852815] [2024-11-11 16:05:56,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 16:05:57,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261852815] [2024-11-11 16:05:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261852815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:57,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:57,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:05:57,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364209710] [2024-11-11 16:05:57,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:57,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:05:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:57,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:05:57,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:05:57,188 INFO L87 Difference]: Start difference. First operand 2983 states and 3262 transitions. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:57,519 INFO L93 Difference]: Finished difference Result 6048 states and 6639 transitions. [2024-11-11 16:05:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:05:57,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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 224 [2024-11-11 16:05:57,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:57,531 INFO L225 Difference]: With dead ends: 6048 [2024-11-11 16:05:57,532 INFO L226 Difference]: Without dead ends: 2983 [2024-11-11 16:05:57,534 INFO L434 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-11 16:05:57,536 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 154 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:57,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 49 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:05:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2024-11-11 16:05:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2983. [2024-11-11 16:05:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2982 states have (on average 1.09121395036888) internal successors, (3254), 2982 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3254 transitions. [2024-11-11 16:05:57,573 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3254 transitions. Word has length 224 [2024-11-11 16:05:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 3254 transitions. [2024-11-11 16:05:57,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3254 transitions. [2024-11-11 16:05:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-11 16:05:57,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:57,579 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2024-11-11 16:05:57,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:05:57,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash 839106206, now seen corresponding path program 1 times [2024-11-11 16:05:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575346750] [2024-11-11 16:05:57,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 16:05:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575346750] [2024-11-11 16:05:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575346750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:57,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:05:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480405431] [2024-11-11 16:05:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:57,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:57,685 INFO L87 Difference]: Start difference. First operand 2983 states and 3254 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:58,004 INFO L93 Difference]: Finished difference Result 5529 states and 6010 transitions. [2024-11-11 16:05:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:58,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 228 [2024-11-11 16:05:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:58,010 INFO L225 Difference]: With dead ends: 5529 [2024-11-11 16:05:58,010 INFO L226 Difference]: Without dead ends: 2266 [2024-11-11 16:05:58,012 INFO L434 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-11 16:05:58,013 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 117 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:58,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 222 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:05:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2024-11-11 16:05:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2126. [2024-11-11 16:05:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 2125 states have (on average 1.0569411764705883) internal successors, (2246), 2125 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 2246 transitions. [2024-11-11 16:05:58,042 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 2246 transitions. Word has length 228 [2024-11-11 16:05:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:58,042 INFO L471 AbstractCegarLoop]: Abstraction has 2126 states and 2246 transitions. [2024-11-11 16:05:58,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2246 transitions. [2024-11-11 16:05:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-11 16:05:58,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:58,048 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:05:58,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:05:58,048 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:58,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2001841330, now seen corresponding path program 1 times [2024-11-11 16:05:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:58,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619083907] [2024-11-11 16:05:58,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 16:05:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619083907] [2024-11-11 16:05:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619083907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:58,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:05:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722973190] [2024-11-11 16:05:58,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:58,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:58,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:58,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:58,269 INFO L87 Difference]: Start difference. First operand 2126 states and 2246 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:58,564 INFO L93 Difference]: Finished difference Result 4671 states and 4951 transitions. [2024-11-11 16:05:58,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 240 [2024-11-11 16:05:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:58,571 INFO L225 Difference]: With dead ends: 4671 [2024-11-11 16:05:58,571 INFO L226 Difference]: Without dead ends: 2547 [2024-11-11 16:05:58,574 INFO L434 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-11 16:05:58,574 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 114 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:58,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 190 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:05:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2024-11-11 16:05:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2406. [2024-11-11 16:05:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 1.0507276507276506) internal successors, (2527), 2405 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2527 transitions. [2024-11-11 16:05:58,607 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 2527 transitions. Word has length 240 [2024-11-11 16:05:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:58,607 INFO L471 AbstractCegarLoop]: Abstraction has 2406 states and 2527 transitions. [2024-11-11 16:05:58,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2527 transitions. [2024-11-11 16:05:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-11 16:05:58,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:58,615 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:05:58,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:05:58,615 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:58,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:58,616 INFO L85 PathProgramCache]: Analyzing trace with hash 896507512, now seen corresponding path program 1 times [2024-11-11 16:05:58,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:58,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832812228] [2024-11-11 16:05:58,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:58,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-11 16:05:58,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832812228] [2024-11-11 16:05:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832812228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:58,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:58,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:05:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174748423] [2024-11-11 16:05:58,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:58,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:58,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:58,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:58,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:58,729 INFO L87 Difference]: Start difference. First operand 2406 states and 2527 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:58,879 INFO L93 Difference]: Finished difference Result 4380 states and 4602 transitions. [2024-11-11 16:05:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:58,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 246 [2024-11-11 16:05:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:58,883 INFO L225 Difference]: With dead ends: 4380 [2024-11-11 16:05:58,883 INFO L226 Difference]: Without dead ends: 1272 [2024-11-11 16:05:58,885 INFO L434 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-11 16:05:58,886 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:58,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 17 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:05:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-11-11 16:05:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1272. [2024-11-11 16:05:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1271 states have (on average 1.0338316286388671) internal successors, (1314), 1271 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1314 transitions. [2024-11-11 16:05:58,899 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1314 transitions. Word has length 246 [2024-11-11 16:05:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:58,899 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1314 transitions. [2024-11-11 16:05:58,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1314 transitions. [2024-11-11 16:05:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-11 16:05:58,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:05:58,902 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:05:58,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:05:58,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:05:58,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:05:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash 942030007, now seen corresponding path program 1 times [2024-11-11 16:05:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:05:58,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303340128] [2024-11-11 16:05:58,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:05:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:05:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:05:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 16:05:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:05:59,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303340128] [2024-11-11 16:05:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303340128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:05:59,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:05:59,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:05:59,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953399977] [2024-11-11 16:05:59,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:05:59,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:05:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:05:59,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:05:59,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:05:59,017 INFO L87 Difference]: Start difference. First operand 1272 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:05:59,247 INFO L93 Difference]: Finished difference Result 1977 states and 2048 transitions. [2024-11-11 16:05:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:05:59,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 289 [2024-11-11 16:05:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:05:59,248 INFO L225 Difference]: With dead ends: 1977 [2024-11-11 16:05:59,248 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:05:59,250 INFO L434 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-11 16:05:59,250 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:05:59,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 23 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:05:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:05:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:05:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:05:59,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2024-11-11 16:05:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:05:59,252 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:05:59,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:05:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:05:59,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:05:59,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:05:59,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:05:59,257 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:05:59,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:05:59,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:05:59,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:05:59 BoogieIcfgContainer [2024-11-11 16:05:59,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:05:59,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:05:59,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:05:59,691 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:05:59,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:05:51" (3/4) ... [2024-11-11 16:05:59,692 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:05:59,713 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:05:59,713 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:05:59,714 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:05:59,714 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:05:59,892 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:05:59,892 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:05:59,893 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:05:59,893 INFO L158 Benchmark]: Toolchain (without parser) took 9615.05ms. Allocated memory was 155.2MB in the beginning and 455.1MB in the end (delta: 299.9MB). Free memory was 80.0MB in the beginning and 163.1MB in the end (delta: -83.1MB). Peak memory consumption was 217.5MB. Max. memory is 16.1GB. [2024-11-11 16:05:59,893 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory was 105.2MB in the beginning and 105.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:05:59,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.29ms. Allocated memory was 155.2MB in the beginning and 260.0MB in the end (delta: 104.9MB). Free memory was 79.8MB in the beginning and 221.1MB in the end (delta: -141.3MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-11 16:05:59,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.41ms. Allocated memory is still 260.0MB. Free memory was 221.1MB in the beginning and 214.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-11 16:05:59,894 INFO L158 Benchmark]: Boogie Preprocessor took 57.68ms. Allocated memory is still 260.0MB. Free memory was 214.8MB in the beginning and 209.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 16:05:59,894 INFO L158 Benchmark]: RCFGBuilder took 861.14ms. Allocated memory is still 260.0MB. Free memory was 209.6MB in the beginning and 128.8MB in the end (delta: 80.7MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-11 16:05:59,894 INFO L158 Benchmark]: TraceAbstraction took 7798.02ms. Allocated memory was 260.0MB in the beginning and 455.1MB in the end (delta: 195.0MB). Free memory was 127.8MB in the beginning and 174.6MB in the end (delta: -46.8MB). Peak memory consumption was 149.3MB. Max. memory is 16.1GB. [2024-11-11 16:05:59,898 INFO L158 Benchmark]: Witness Printer took 202.15ms. Allocated memory is still 455.1MB. Free memory was 174.6MB in the beginning and 163.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:05:59,899 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.15ms. Allocated memory is still 155.2MB. Free memory was 105.2MB in the beginning and 105.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 610.29ms. Allocated memory was 155.2MB in the beginning and 260.0MB in the end (delta: 104.9MB). Free memory was 79.8MB in the beginning and 221.1MB in the end (delta: -141.3MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.41ms. Allocated memory is still 260.0MB. Free memory was 221.1MB in the beginning and 214.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.68ms. Allocated memory is still 260.0MB. Free memory was 214.8MB in the beginning and 209.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 861.14ms. Allocated memory is still 260.0MB. Free memory was 209.6MB in the beginning and 128.8MB in the end (delta: 80.7MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7798.02ms. Allocated memory was 260.0MB in the beginning and 455.1MB in the end (delta: 195.0MB). Free memory was 127.8MB in the beginning and 174.6MB in the end (delta: -46.8MB). Peak memory consumption was 149.3MB. Max. memory is 16.1GB. * Witness Printer took 202.15ms. Allocated memory is still 455.1MB. Free memory was 174.6MB in the beginning and 163.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 560]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1747 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1747 mSDsluCounter, 1513 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 769 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4537 IncrementalHoareTripleChecker+Invalid, 5306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 769 mSolverCounterUnsat, 1338 mSDtfsCounter, 4537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2988occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1002 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2496 NumberOfCodeBlocks, 2496 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2483 ConstructedInterpolants, 0 QuantifiedInterpolants, 5269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 1462/1462 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((((((((((((((a28 == 10) && (a11 <= 0)) && (a19 == 1)) || (((a21 == 1) && (a17 <= 8)) && ((((a25 == 1) && (a11 <= 0)) && (a19 == 1)) || ((((10 <= a28) && (a17 == 8)) && (a25 == 1)) && (a19 == 1))))) || ((a17 <= 8) && ((((((9 <= a28) && (a11 == 1)) && (a21 == 1)) && (a25 != 1)) && (a19 == 1)) || ((((((a17 == 8) && (9 <= a28)) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a28 <= 10))))) || (((((a25 == 1) && (a28 == 10)) && (a21 == 1)) && (a17 <= 8)) && (a11 <= 0))) || ((((((a19 == 0) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || (((a28 == 10) && (a25 != 1)) && (a19 == 1))) || ((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (a25 != 1))) || (((((10 <= a28) && (a11 == 1)) && (a21 == 1)) && (a25 != 1)) && (a19 == 1))) || ((((a21 == 1) && (a17 <= 8)) && (a11 <= 0)) && (a28 <= 7))) || (((((a21 == 1) && (a17 <= 8)) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1))) || (((((a28 <= 8) && (a21 == 1)) && (a17 <= 8)) && (a11 <= 0)) && (a25 != 1))) || ((((a25 == 1) && (a11 <= 0)) && (a19 == 1)) && (a28 <= 7))) || (((8 <= a17) && (a28 == 10)) && (a19 == 1))) || (((((a11 == 1) && (a21 == 1)) && (a17 <= 8)) && (a25 != 1)) && (a28 <= 7))) || (((((a11 == 1) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a28 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:05:59,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE