./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label35.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 332223a74015f37ef1848305a6dc2d3188fda0d257576dbd7b4025d0bb05f229 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 18:03:08,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 18:03:08,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 18:03:08,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 18:03:08,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 18:03:08,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 18:03:08,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 18:03:08,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 18:03:08,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 18:03:08,258 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 18:03:08,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 18:03:08,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 18:03:08,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 18:03:08,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 18:03:08,261 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 18:03:08,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 18:03:08,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 18:03:08,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 18:03:08,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 18:03:08,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 18:03:08,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 18:03:08,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 18:03:08,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 18:03:08,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 18:03:08,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 18:03:08,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 18:03:08,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 18:03:08,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 18:03:08,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 18:03:08,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 18:03:08,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 18:03:08,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 18:03:08,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:03:08,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 18:03:08,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 18:03:08,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 18:03:08,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 18:03:08,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 18:03:08,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 18:03:08,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 18:03:08,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 18:03:08,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 18:03:08,269 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 -> 332223a74015f37ef1848305a6dc2d3188fda0d257576dbd7b4025d0bb05f229 [2024-11-19 18:03:08,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 18:03:08,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 18:03:08,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 18:03:08,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 18:03:08,519 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 18:03:08,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label35.c [2024-11-19 18:03:09,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 18:03:10,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 18:03:10,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label35.c [2024-11-19 18:03:10,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ceb1269/00b77cffe8e94faf9fedecc61bab3299/FLAGc8f4f0098 [2024-11-19 18:03:10,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ceb1269/00b77cffe8e94faf9fedecc61bab3299 [2024-11-19 18:03:10,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 18:03:10,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 18:03:10,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 18:03:10,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 18:03:10,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 18:03:10,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:03:10" (1/1) ... [2024-11-19 18:03:10,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a54c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:10, skipping insertion in model container [2024-11-19 18:03:10,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:03:10" (1/1) ... [2024-11-19 18:03:10,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 18:03:10,704 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/Problem11_label35.c[8398,8411] [2024-11-19 18:03:10,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:03:10,931 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 18:03:10,967 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/Problem11_label35.c[8398,8411] [2024-11-19 18:03:11,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:03:11,088 INFO L204 MainTranslator]: Completed translation [2024-11-19 18:03:11,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11 WrapperNode [2024-11-19 18:03:11,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 18:03:11,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 18:03:11,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 18:03:11,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 18:03:11,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,201 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-19 18:03:11,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 18:03:11,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 18:03:11,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 18:03:11,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 18:03:11,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,275 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-19 18:03:11,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 18:03:11,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 18:03:11,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 18:03:11,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 18:03:11,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (1/1) ... [2024-11-19 18:03:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:03:11,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:03:11,394 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-19 18:03:11,401 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-19 18:03:11,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 18:03:11,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 18:03:11,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 18:03:11,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 18:03:11,502 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 18:03:11,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 18:03:12,721 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-19 18:03:12,721 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 18:03:12,735 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 18:03:12,735 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 18:03:12,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:03:12 BoogieIcfgContainer [2024-11-19 18:03:12,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 18:03:12,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 18:03:12,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 18:03:12,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 18:03:12,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:03:10" (1/3) ... [2024-11-19 18:03:12,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9d098a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:03:12, skipping insertion in model container [2024-11-19 18:03:12,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:03:11" (2/3) ... [2024-11-19 18:03:12,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9d098a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:03:12, skipping insertion in model container [2024-11-19 18:03:12,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:03:12" (3/3) ... [2024-11-19 18:03:12,741 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label35.c [2024-11-19 18:03:12,753 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 18:03:12,753 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 18:03:12,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 18:03:12,806 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;@310166a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 18:03:12,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 18:03:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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-19 18:03:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 18:03:12,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:12,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:03:12,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:12,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2024-11-19 18:03:12,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:12,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627944412] [2024-11-19 18:03:12,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:12,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:13,112 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-19 18:03:13,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627944412] [2024-11-19 18:03:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627944412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:13,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:13,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:13,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069783839] [2024-11-19 18:03:13,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:13,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:13,140 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 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-19 18:03:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:13,976 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-19 18:03:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 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 58 [2024-11-19 18:03:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:13,987 INFO L225 Difference]: With dead ends: 776 [2024-11-19 18:03:13,988 INFO L226 Difference]: Without dead ends: 413 [2024-11-19 18:03:13,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:13,993 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 169 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:13,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 18:03:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-19 18:03:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-19 18:03:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 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-19 18:03:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-19 18:03:14,034 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 58 [2024-11-19 18:03:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:14,034 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-19 18:03:14,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 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-19 18:03:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-19 18:03:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 18:03:14,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:14,038 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:03:14,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 18:03:14,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:14,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1140984306, now seen corresponding path program 1 times [2024-11-19 18:03:14,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:14,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926022787] [2024-11-19 18:03:14,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:14,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926022787] [2024-11-19 18:03:14,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926022787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:14,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:14,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:14,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510379981] [2024-11-19 18:03:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:14,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:14,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:14,170 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. 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-19 18:03:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:14,799 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-19 18:03:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:14,799 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-19 18:03:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:14,803 INFO L225 Difference]: With dead ends: 1209 [2024-11-19 18:03:14,803 INFO L226 Difference]: Without dead ends: 800 [2024-11-19 18:03:14,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:14,805 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:14,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:03:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-19 18:03:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-19 18:03:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 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-19 18:03:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2024-11-19 18:03:14,838 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 126 [2024-11-19 18:03:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:14,839 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2024-11-19 18:03:14,839 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-19 18:03:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2024-11-19 18:03:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 18:03:14,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:14,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:03:14,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 18:03:14,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:14,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 720217396, now seen corresponding path program 1 times [2024-11-19 18:03:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054284326] [2024-11-19 18:03:14,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:14,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:15,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:15,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054284326] [2024-11-19 18:03:15,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054284326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:15,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:15,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768764688] [2024-11-19 18:03:15,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:15,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:15,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:15,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:15,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:15,100 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-19 18:03:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:15,687 INFO L93 Difference]: Finished difference Result 1942 states and 2631 transitions. [2024-11-19 18:03:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 127 [2024-11-19 18:03:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:15,692 INFO L225 Difference]: With dead ends: 1942 [2024-11-19 18:03:15,692 INFO L226 Difference]: Without dead ends: 1157 [2024-11-19 18:03:15,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:15,694 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:15,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:03:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-19 18:03:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-19 18:03:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 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-19 18:03:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2024-11-19 18:03:15,714 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 127 [2024-11-19 18:03:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:15,715 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2024-11-19 18:03:15,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-19 18:03:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2024-11-19 18:03:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-19 18:03:15,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:15,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 18:03:15,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 18:03:15,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:15,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash -965276746, now seen corresponding path program 1 times [2024-11-19 18:03:15,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:15,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063130050] [2024-11-19 18:03:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 18:03:15,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:15,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063130050] [2024-11-19 18:03:15,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063130050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:15,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:15,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:15,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114579199] [2024-11-19 18:03:15,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:15,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:15,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:15,867 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-19 18:03:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:16,501 INFO L93 Difference]: Finished difference Result 2502 states and 3339 transitions. [2024-11-19 18:03:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:16,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 170 [2024-11-19 18:03:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:16,506 INFO L225 Difference]: With dead ends: 2502 [2024-11-19 18:03:16,506 INFO L226 Difference]: Without dead ends: 1532 [2024-11-19 18:03:16,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:16,508 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:16,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:03:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-19 18:03:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-19 18:03:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2619203135205748) internal successors, (1932), 1531 states have internal predecessors, (1932), 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-19 18:03:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1932 transitions. [2024-11-19 18:03:16,544 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1932 transitions. Word has length 170 [2024-11-19 18:03:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:16,545 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1932 transitions. [2024-11-19 18:03:16,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-19 18:03:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1932 transitions. [2024-11-19 18:03:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-19 18:03:16,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:16,547 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:03:16,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 18:03:16,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:16,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:16,548 INFO L85 PathProgramCache]: Analyzing trace with hash 684290447, now seen corresponding path program 1 times [2024-11-19 18:03:16,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:16,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642943761] [2024-11-19 18:03:16,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:16,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:16,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:16,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642943761] [2024-11-19 18:03:16,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642943761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:16,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:16,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:16,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646976202] [2024-11-19 18:03:16,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:16,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:03:16,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:16,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:03:16,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:16,718 INFO L87 Difference]: Start difference. First operand 1532 states and 1932 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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-19 18:03:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:17,750 INFO L93 Difference]: Finished difference Result 4931 states and 6396 transitions. [2024-11-19 18:03:17,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:03:17,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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 185 [2024-11-19 18:03:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:17,759 INFO L225 Difference]: With dead ends: 4931 [2024-11-19 18:03:17,759 INFO L226 Difference]: Without dead ends: 3585 [2024-11-19 18:03:17,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:17,763 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 306 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:17,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 95 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 18:03:17,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2024-11-19 18:03:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3584. [2024-11-19 18:03:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 3583 states have (on average 1.254535305609824) internal successors, (4495), 3583 states have internal predecessors, (4495), 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-19 18:03:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4495 transitions. [2024-11-19 18:03:17,809 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4495 transitions. Word has length 185 [2024-11-19 18:03:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:17,809 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 4495 transitions. [2024-11-19 18:03:17,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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-19 18:03:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4495 transitions. [2024-11-19 18:03:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-19 18:03:17,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:17,813 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:17,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 18:03:17,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:17,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1272185010, now seen corresponding path program 1 times [2024-11-19 18:03:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:17,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067050625] [2024-11-19 18:03:17,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:18,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:18,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067050625] [2024-11-19 18:03:18,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067050625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:18,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:18,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870322579] [2024-11-19 18:03:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:18,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:18,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:18,018 INFO L87 Difference]: Start difference. First operand 3584 states and 4495 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-19 18:03:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:18,680 INFO L93 Difference]: Finished difference Result 8287 states and 10612 transitions. [2024-11-19 18:03:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 238 [2024-11-19 18:03:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:18,694 INFO L225 Difference]: With dead ends: 8287 [2024-11-19 18:03:18,694 INFO L226 Difference]: Without dead ends: 5073 [2024-11-19 18:03:18,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:18,699 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:18,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 347 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:03:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2024-11-19 18:03:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 5058. [2024-11-19 18:03:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5058 states, 5057 states have (on average 1.2278030452837652) internal successors, (6209), 5057 states have internal predecessors, (6209), 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-19 18:03:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 6209 transitions. [2024-11-19 18:03:18,776 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 6209 transitions. Word has length 238 [2024-11-19 18:03:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:18,777 INFO L471 AbstractCegarLoop]: Abstraction has 5058 states and 6209 transitions. [2024-11-19 18:03:18,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-19 18:03:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 6209 transitions. [2024-11-19 18:03:18,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-19 18:03:18,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:18,780 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:18,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 18:03:18,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:18,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:18,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1073587368, now seen corresponding path program 1 times [2024-11-19 18:03:18,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:18,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108827009] [2024-11-19 18:03:18,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-19 18:03:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108827009] [2024-11-19 18:03:18,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108827009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:18,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:18,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:18,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054870398] [2024-11-19 18:03:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:18,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:18,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:18,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:18,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:18,941 INFO L87 Difference]: Start difference. First operand 5058 states and 6209 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-19 18:03:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:19,520 INFO L93 Difference]: Finished difference Result 11053 states and 13655 transitions. [2024-11-19 18:03:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:19,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 239 [2024-11-19 18:03:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:19,533 INFO L225 Difference]: With dead ends: 11053 [2024-11-19 18:03:19,533 INFO L226 Difference]: Without dead ends: 6365 [2024-11-19 18:03:19,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:19,537 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 144 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:19,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 346 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:03:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2024-11-19 18:03:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 6346. [2024-11-19 18:03:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6346 states, 6345 states have (on average 1.21371158392435) internal successors, (7701), 6345 states have internal predecessors, (7701), 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-19 18:03:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6346 states to 6346 states and 7701 transitions. [2024-11-19 18:03:19,604 INFO L78 Accepts]: Start accepts. Automaton has 6346 states and 7701 transitions. Word has length 239 [2024-11-19 18:03:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:19,604 INFO L471 AbstractCegarLoop]: Abstraction has 6346 states and 7701 transitions. [2024-11-19 18:03:19,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-19 18:03:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6346 states and 7701 transitions. [2024-11-19 18:03:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-19 18:03:19,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:19,607 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:19,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 18:03:19,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash -275188695, now seen corresponding path program 1 times [2024-11-19 18:03:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:19,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026412989] [2024-11-19 18:03:19,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-19 18:03:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:19,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026412989] [2024-11-19 18:03:19,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026412989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:19,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:19,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320916577] [2024-11-19 18:03:19,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:19,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:19,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:19,751 INFO L87 Difference]: Start difference. First operand 6346 states and 7701 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-19 18:03:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:20,433 INFO L93 Difference]: Finished difference Result 13621 states and 16781 transitions. [2024-11-19 18:03:20,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:20,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-19 18:03:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:20,449 INFO L225 Difference]: With dead ends: 13621 [2024-11-19 18:03:20,449 INFO L226 Difference]: Without dead ends: 7645 [2024-11-19 18:03:20,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:20,457 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:20,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 371 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:03:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7645 states. [2024-11-19 18:03:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7645 to 7450. [2024-11-19 18:03:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7450 states, 7449 states have (on average 1.20700765203383) internal successors, (8991), 7449 states have internal predecessors, (8991), 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-19 18:03:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7450 states to 7450 states and 8991 transitions. [2024-11-19 18:03:20,540 INFO L78 Accepts]: Start accepts. Automaton has 7450 states and 8991 transitions. Word has length 240 [2024-11-19 18:03:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:20,541 INFO L471 AbstractCegarLoop]: Abstraction has 7450 states and 8991 transitions. [2024-11-19 18:03:20,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-19 18:03:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7450 states and 8991 transitions. [2024-11-19 18:03:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-19 18:03:20,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:20,544 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-19 18:03:20,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 18:03:20,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:20,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1602390199, now seen corresponding path program 1 times [2024-11-19 18:03:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154404375] [2024-11-19 18:03:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154404375] [2024-11-19 18:03:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154404375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:20,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:20,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 18:03:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607839578] [2024-11-19 18:03:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:20,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:03:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:03:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:20,870 INFO L87 Difference]: Start difference. First operand 7450 states and 8991 transitions. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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-19 18:03:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:22,048 INFO L93 Difference]: Finished difference Result 21201 states and 26191 transitions. [2024-11-19 18:03:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:03:22,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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 260 [2024-11-19 18:03:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:22,072 INFO L225 Difference]: With dead ends: 21201 [2024-11-19 18:03:22,073 INFO L226 Difference]: Without dead ends: 14121 [2024-11-19 18:03:22,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:22,081 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 277 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:22,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 194 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 18:03:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14121 states. [2024-11-19 18:03:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14121 to 12820. [2024-11-19 18:03:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12820 states, 12819 states have (on average 1.1994695374054138) internal successors, (15376), 12819 states have internal predecessors, (15376), 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-19 18:03:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12820 states to 12820 states and 15376 transitions. [2024-11-19 18:03:22,303 INFO L78 Accepts]: Start accepts. Automaton has 12820 states and 15376 transitions. Word has length 260 [2024-11-19 18:03:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:22,305 INFO L471 AbstractCegarLoop]: Abstraction has 12820 states and 15376 transitions. [2024-11-19 18:03:22,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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-19 18:03:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 12820 states and 15376 transitions. [2024-11-19 18:03:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-19 18:03:22,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:22,311 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:22,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 18:03:22,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:22,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash -656312002, now seen corresponding path program 1 times [2024-11-19 18:03:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:22,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828955080] [2024-11-19 18:03:22,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828955080] [2024-11-19 18:03:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828955080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 18:03:22,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427741248] [2024-11-19 18:03:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:22,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:03:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:22,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:03:22,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:22,708 INFO L87 Difference]: Start difference. First operand 12820 states and 15376 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-19 18:03:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:23,808 INFO L93 Difference]: Finished difference Result 30437 states and 37141 transitions. [2024-11-19 18:03:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:03:23,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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 270 [2024-11-19 18:03:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:23,835 INFO L225 Difference]: With dead ends: 30437 [2024-11-19 18:03:23,835 INFO L226 Difference]: Without dead ends: 17987 [2024-11-19 18:03:23,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:23,847 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 287 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:23,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 120 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 18:03:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17987 states. [2024-11-19 18:03:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17987 to 17973. [2024-11-19 18:03:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17973 states, 17972 states have (on average 1.2047073225016693) internal successors, (21651), 17972 states have internal predecessors, (21651), 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-19 18:03:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17973 states to 17973 states and 21651 transitions. [2024-11-19 18:03:24,019 INFO L78 Accepts]: Start accepts. Automaton has 17973 states and 21651 transitions. Word has length 270 [2024-11-19 18:03:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:24,020 INFO L471 AbstractCegarLoop]: Abstraction has 17973 states and 21651 transitions. [2024-11-19 18:03:24,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-19 18:03:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 17973 states and 21651 transitions. [2024-11-19 18:03:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-19 18:03:24,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:24,026 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:24,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 18:03:24,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:24,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:24,027 INFO L85 PathProgramCache]: Analyzing trace with hash -420504501, now seen corresponding path program 1 times [2024-11-19 18:03:24,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:24,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368976560] [2024-11-19 18:03:24,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-19 18:03:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368976560] [2024-11-19 18:03:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368976560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:24,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:24,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161627340] [2024-11-19 18:03:24,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:24,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:24,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:24,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:24,265 INFO L87 Difference]: Start difference. First operand 17973 states and 21651 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-19 18:03:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:24,942 INFO L93 Difference]: Finished difference Result 35770 states and 43131 transitions. [2024-11-19 18:03:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:24,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 277 [2024-11-19 18:03:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:24,964 INFO L225 Difference]: With dead ends: 35770 [2024-11-19 18:03:24,964 INFO L226 Difference]: Without dead ends: 17983 [2024-11-19 18:03:24,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:24,979 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 143 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:24,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 379 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:03:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17983 states. [2024-11-19 18:03:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17983 to 17972. [2024-11-19 18:03:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17972 states, 17971 states have (on average 1.1678259417951145) internal successors, (20987), 17971 states have internal predecessors, (20987), 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-19 18:03:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17972 states to 17972 states and 20987 transitions. [2024-11-19 18:03:25,305 INFO L78 Accepts]: Start accepts. Automaton has 17972 states and 20987 transitions. Word has length 277 [2024-11-19 18:03:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:25,306 INFO L471 AbstractCegarLoop]: Abstraction has 17972 states and 20987 transitions. [2024-11-19 18:03:25,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-19 18:03:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 17972 states and 20987 transitions. [2024-11-19 18:03:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-11-19 18:03:25,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:25,318 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:03:25,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 18:03:25,318 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:25,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1481290674, now seen corresponding path program 1 times [2024-11-19 18:03:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:25,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920279625] [2024-11-19 18:03:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 167 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:26,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:26,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920279625] [2024-11-19 18:03:26,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920279625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:03:26,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807566969] [2024-11-19 18:03:26,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:26,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:03:26,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:03:26,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:03:26,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 18:03:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:26,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 18:03:26,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:03:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:26,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:03:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807566969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:26,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:03:26,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-19 18:03:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053025338] [2024-11-19 18:03:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:26,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:03:26,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:26,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:03:26,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 18:03:26,880 INFO L87 Difference]: Start difference. First operand 17972 states and 20987 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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-19 18:03:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:27,691 INFO L93 Difference]: Finished difference Result 33180 states and 38911 transitions. [2024-11-19 18:03:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:03:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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 291 [2024-11-19 18:03:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:27,714 INFO L225 Difference]: With dead ends: 33180 [2024-11-19 18:03:27,715 INFO L226 Difference]: Without dead ends: 17980 [2024-11-19 18:03:27,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 18:03:27,729 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 191 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:27,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 165 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:03:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17980 states. [2024-11-19 18:03:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17980 to 17972. [2024-11-19 18:03:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17972 states, 17971 states have (on average 1.1658227143731568) internal successors, (20951), 17971 states have internal predecessors, (20951), 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-19 18:03:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17972 states to 17972 states and 20951 transitions. [2024-11-19 18:03:27,902 INFO L78 Accepts]: Start accepts. Automaton has 17972 states and 20951 transitions. Word has length 291 [2024-11-19 18:03:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:27,903 INFO L471 AbstractCegarLoop]: Abstraction has 17972 states and 20951 transitions. [2024-11-19 18:03:27,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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-19 18:03:27,903 INFO L276 IsEmpty]: Start isEmpty. Operand 17972 states and 20951 transitions. [2024-11-19 18:03:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-11-19 18:03:27,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:27,909 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:03:27,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 18:03:28,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 18:03:28,111 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:28,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1567275683, now seen corresponding path program 1 times [2024-11-19 18:03:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:28,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266009015] [2024-11-19 18:03:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-19 18:03:28,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:28,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266009015] [2024-11-19 18:03:28,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266009015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:28,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:28,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:03:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971399005] [2024-11-19 18:03:28,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:28,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:28,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:28,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:28,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:28,277 INFO L87 Difference]: Start difference. First operand 17972 states and 20951 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 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-19 18:03:28,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:28,896 INFO L93 Difference]: Finished difference Result 37950 states and 44596 transitions. [2024-11-19 18:03:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:28,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 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 317 [2024-11-19 18:03:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:28,917 INFO L225 Difference]: With dead ends: 37950 [2024-11-19 18:03:28,917 INFO L226 Difference]: Without dead ends: 20348 [2024-11-19 18:03:28,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:28,930 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 126 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:28,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 153 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:03:28,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20348 states. [2024-11-19 18:03:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20348 to 17029. [2024-11-19 18:03:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17029 states, 17028 states have (on average 1.132957481794691) internal successors, (19292), 17028 states have internal predecessors, (19292), 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-19 18:03:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17029 states to 17029 states and 19292 transitions. [2024-11-19 18:03:29,079 INFO L78 Accepts]: Start accepts. Automaton has 17029 states and 19292 transitions. Word has length 317 [2024-11-19 18:03:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:29,079 INFO L471 AbstractCegarLoop]: Abstraction has 17029 states and 19292 transitions. [2024-11-19 18:03:29,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 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-19 18:03:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 17029 states and 19292 transitions. [2024-11-19 18:03:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-19 18:03:29,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:29,085 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 18:03:29,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 18:03:29,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:29,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1154072221, now seen corresponding path program 1 times [2024-11-19 18:03:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805262803] [2024-11-19 18:03:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-19 18:03:29,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805262803] [2024-11-19 18:03:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805262803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:29,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:29,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364962435] [2024-11-19 18:03:29,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:29,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:29,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:29,216 INFO L87 Difference]: Start difference. First operand 17029 states and 19292 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-19 18:03:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:29,819 INFO L93 Difference]: Finished difference Result 35707 states and 40462 transitions. [2024-11-19 18:03:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:29,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 325 [2024-11-19 18:03:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:29,837 INFO L225 Difference]: With dead ends: 35707 [2024-11-19 18:03:29,838 INFO L226 Difference]: Without dead ends: 21076 [2024-11-19 18:03:29,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:29,845 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 164 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:29,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 151 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:03:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21076 states. [2024-11-19 18:03:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21076 to 17396. [2024-11-19 18:03:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17396 states, 17395 states have (on average 1.133371658522564) internal successors, (19715), 17395 states have internal predecessors, (19715), 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-19 18:03:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17396 states to 17396 states and 19715 transitions. [2024-11-19 18:03:29,996 INFO L78 Accepts]: Start accepts. Automaton has 17396 states and 19715 transitions. Word has length 325 [2024-11-19 18:03:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:29,996 INFO L471 AbstractCegarLoop]: Abstraction has 17396 states and 19715 transitions. [2024-11-19 18:03:29,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-19 18:03:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 17396 states and 19715 transitions. [2024-11-19 18:03:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-19 18:03:30,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:30,003 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 18:03:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 18:03:30,003 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:30,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash -529817127, now seen corresponding path program 1 times [2024-11-19 18:03:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:30,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72088753] [2024-11-19 18:03:30,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-19 18:03:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72088753] [2024-11-19 18:03:30,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72088753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:30,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:30,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 18:03:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252295129] [2024-11-19 18:03:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:30,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:03:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:30,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:03:30,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:30,321 INFO L87 Difference]: Start difference. First operand 17396 states and 19715 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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-19 18:03:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:31,160 INFO L93 Difference]: Finished difference Result 40533 states and 46168 transitions. [2024-11-19 18:03:31,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:03:31,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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 329 [2024-11-19 18:03:31,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:31,184 INFO L225 Difference]: With dead ends: 40533 [2024-11-19 18:03:31,184 INFO L226 Difference]: Without dead ends: 24794 [2024-11-19 18:03:31,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:31,197 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 290 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:31,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 394 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:03:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24794 states. [2024-11-19 18:03:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24794 to 20352. [2024-11-19 18:03:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20352 states, 20351 states have (on average 1.1228932239202005) internal successors, (22852), 20351 states have internal predecessors, (22852), 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-19 18:03:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20352 states to 20352 states and 22852 transitions. [2024-11-19 18:03:31,372 INFO L78 Accepts]: Start accepts. Automaton has 20352 states and 22852 transitions. Word has length 329 [2024-11-19 18:03:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:31,372 INFO L471 AbstractCegarLoop]: Abstraction has 20352 states and 22852 transitions. [2024-11-19 18:03:31,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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-19 18:03:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20352 states and 22852 transitions. [2024-11-19 18:03:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-19 18:03:31,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:31,378 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:03:31,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 18:03:31,378 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:31,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1235290608, now seen corresponding path program 1 times [2024-11-19 18:03:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786688035] [2024-11-19 18:03:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:03:31,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:31,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786688035] [2024-11-19 18:03:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786688035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:31,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:31,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91337644] [2024-11-19 18:03:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:31,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:03:31,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:03:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:31,741 INFO L87 Difference]: Start difference. First operand 20352 states and 22852 transitions. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 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-19 18:03:32,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:32,766 INFO L93 Difference]: Finished difference Result 46790 states and 52589 transitions. [2024-11-19 18:03:32,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:03:32,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 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 338 [2024-11-19 18:03:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:32,796 INFO L225 Difference]: With dead ends: 46790 [2024-11-19 18:03:32,796 INFO L226 Difference]: Without dead ends: 26808 [2024-11-19 18:03:32,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:32,813 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 163 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:32,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 112 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 18:03:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26808 states. [2024-11-19 18:03:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26808 to 25512. [2024-11-19 18:03:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25512 states, 25511 states have (on average 1.1172043432244914) internal successors, (28501), 25511 states have internal predecessors, (28501), 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-19 18:03:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25512 states to 25512 states and 28501 transitions. [2024-11-19 18:03:33,154 INFO L78 Accepts]: Start accepts. Automaton has 25512 states and 28501 transitions. Word has length 338 [2024-11-19 18:03:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:33,154 INFO L471 AbstractCegarLoop]: Abstraction has 25512 states and 28501 transitions. [2024-11-19 18:03:33,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 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-19 18:03:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 25512 states and 28501 transitions. [2024-11-19 18:03:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-19 18:03:33,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:33,162 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 18:03:33,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 18:03:33,163 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:33,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:33,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1689526705, now seen corresponding path program 1 times [2024-11-19 18:03:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309410197] [2024-11-19 18:03:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:33,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 174 proven. 167 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-19 18:03:33,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:33,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309410197] [2024-11-19 18:03:33,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309410197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:03:33,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191520659] [2024-11-19 18:03:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:33,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:03:33,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:03:33,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:03:33,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 18:03:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:33,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 18:03:33,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:03:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-19 18:03:34,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:03:34,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191520659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:34,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:03:34,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-19 18:03:34,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966429480] [2024-11-19 18:03:34,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:34,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:03:34,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:34,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:03:34,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 18:03:34,241 INFO L87 Difference]: Start difference. First operand 25512 states and 28501 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 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-19 18:03:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:35,030 INFO L93 Difference]: Finished difference Result 48630 states and 54360 transitions. [2024-11-19 18:03:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:03:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 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 345 [2024-11-19 18:03:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:35,053 INFO L225 Difference]: With dead ends: 48630 [2024-11-19 18:03:35,053 INFO L226 Difference]: Without dead ends: 25884 [2024-11-19 18:03:35,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 18:03:35,067 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:35,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 158 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:03:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25884 states. [2024-11-19 18:03:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25884 to 25144. [2024-11-19 18:03:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25144 states, 25143 states have (on average 1.116772063795092) internal successors, (28079), 25143 states have internal predecessors, (28079), 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-19 18:03:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25144 states to 25144 states and 28079 transitions. [2024-11-19 18:03:35,267 INFO L78 Accepts]: Start accepts. Automaton has 25144 states and 28079 transitions. Word has length 345 [2024-11-19 18:03:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:35,268 INFO L471 AbstractCegarLoop]: Abstraction has 25144 states and 28079 transitions. [2024-11-19 18:03:35,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 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-19 18:03:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 25144 states and 28079 transitions. [2024-11-19 18:03:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-11-19 18:03:35,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:35,275 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:03:35,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 18:03:35,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 18:03:35,477 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:35,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:35,477 INFO L85 PathProgramCache]: Analyzing trace with hash -576147188, now seen corresponding path program 1 times [2024-11-19 18:03:35,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:35,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149602241] [2024-11-19 18:03:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:35,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-19 18:03:35,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:35,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149602241] [2024-11-19 18:03:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149602241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:35,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:35,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 18:03:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223542823] [2024-11-19 18:03:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:35,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:03:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:35,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:03:35,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:35,887 INFO L87 Difference]: Start difference. First operand 25144 states and 28079 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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-19 18:03:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:37,029 INFO L93 Difference]: Finished difference Result 53250 states and 59454 transitions. [2024-11-19 18:03:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:03:37,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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 367 [2024-11-19 18:03:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:37,061 INFO L225 Difference]: With dead ends: 53250 [2024-11-19 18:03:37,062 INFO L226 Difference]: Without dead ends: 30131 [2024-11-19 18:03:37,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:37,079 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 287 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:37,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 359 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 18:03:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30131 states. [2024-11-19 18:03:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30131 to 22542. [2024-11-19 18:03:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22542 states, 22541 states have (on average 1.108735193647132) internal successors, (24992), 22541 states have internal predecessors, (24992), 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-19 18:03:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22542 states to 22542 states and 24992 transitions. [2024-11-19 18:03:37,311 INFO L78 Accepts]: Start accepts. Automaton has 22542 states and 24992 transitions. Word has length 367 [2024-11-19 18:03:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:37,311 INFO L471 AbstractCegarLoop]: Abstraction has 22542 states and 24992 transitions. [2024-11-19 18:03:37,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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-19 18:03:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 22542 states and 24992 transitions. [2024-11-19 18:03:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2024-11-19 18:03:37,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:37,321 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:03:37,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 18:03:37,321 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:37,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1805254862, now seen corresponding path program 1 times [2024-11-19 18:03:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:37,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812044601] [2024-11-19 18:03:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 18:03:37,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:37,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812044601] [2024-11-19 18:03:37,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812044601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:03:37,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710194227] [2024-11-19 18:03:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:37,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:03:37,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:03:37,654 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:03:37,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 18:03:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:37,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 18:03:37,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:03:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 18:03:38,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 18:03:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 18:03:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710194227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 18:03:40,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 18:03:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 18:03:40,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126510540] [2024-11-19 18:03:40,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 18:03:40,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 18:03:40,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:40,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 18:03:40,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:03:40,337 INFO L87 Difference]: Start difference. First operand 22542 states and 24992 transitions. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 5 states have internal predecessors, (481), 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-19 18:03:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:42,288 INFO L93 Difference]: Finished difference Result 50245 states and 55685 transitions. [2024-11-19 18:03:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 18:03:42,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 5 states have internal predecessors, (481), 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 376 [2024-11-19 18:03:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:42,324 INFO L225 Difference]: With dead ends: 50245 [2024-11-19 18:03:42,324 INFO L226 Difference]: Without dead ends: 30285 [2024-11-19 18:03:42,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:03:42,342 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 379 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:42,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 196 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 18:03:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30285 states. [2024-11-19 18:03:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30285 to 21057. [2024-11-19 18:03:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21057 states, 21056 states have (on average 1.1078077507598785) internal successors, (23326), 21056 states have internal predecessors, (23326), 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-19 18:03:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21057 states to 21057 states and 23326 transitions. [2024-11-19 18:03:42,671 INFO L78 Accepts]: Start accepts. Automaton has 21057 states and 23326 transitions. Word has length 376 [2024-11-19 18:03:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:42,672 INFO L471 AbstractCegarLoop]: Abstraction has 21057 states and 23326 transitions. [2024-11-19 18:03:42,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 5 states have internal predecessors, (481), 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-19 18:03:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 21057 states and 23326 transitions. [2024-11-19 18:03:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-11-19 18:03:42,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:42,682 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 18:03:42,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 18:03:42,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:03:42,884 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:42,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:42,884 INFO L85 PathProgramCache]: Analyzing trace with hash 200929446, now seen corresponding path program 1 times [2024-11-19 18:03:42,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:42,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927888886] [2024-11-19 18:03:42,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 18:03:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:43,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927888886] [2024-11-19 18:03:43,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927888886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:43,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:43,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 18:03:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571412325] [2024-11-19 18:03:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:43,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:03:43,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:43,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:03:43,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:43,297 INFO L87 Difference]: Start difference. First operand 21057 states and 23326 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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-19 18:03:44,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:44,057 INFO L93 Difference]: Finished difference Result 41195 states and 45601 transitions. [2024-11-19 18:03:44,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:03:44,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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 380 [2024-11-19 18:03:44,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:44,078 INFO L225 Difference]: With dead ends: 41195 [2024-11-19 18:03:44,078 INFO L226 Difference]: Without dead ends: 22720 [2024-11-19 18:03:44,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:03:44,090 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 298 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:44,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 54 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:03:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22720 states. [2024-11-19 18:03:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22720 to 20132. [2024-11-19 18:03:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20132 states, 20131 states have (on average 1.104465749341811) internal successors, (22234), 20131 states have internal predecessors, (22234), 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-19 18:03:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 22234 transitions. [2024-11-19 18:03:44,261 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 22234 transitions. Word has length 380 [2024-11-19 18:03:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:44,261 INFO L471 AbstractCegarLoop]: Abstraction has 20132 states and 22234 transitions. [2024-11-19 18:03:44,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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-19 18:03:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 22234 transitions. [2024-11-19 18:03:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2024-11-19 18:03:44,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:44,277 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:03:44,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 18:03:44,277 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:44,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1289156856, now seen corresponding path program 1 times [2024-11-19 18:03:44,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:44,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283407637] [2024-11-19 18:03:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-19 18:03:44,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:44,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283407637] [2024-11-19 18:03:44,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283407637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:44,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:44,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47476102] [2024-11-19 18:03:44,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:44,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:44,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:44,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:44,578 INFO L87 Difference]: Start difference. First operand 20132 states and 22234 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-19 18:03:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:45,142 INFO L93 Difference]: Finished difference Result 38806 states and 42836 transitions. [2024-11-19 18:03:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 574 [2024-11-19 18:03:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:45,162 INFO L225 Difference]: With dead ends: 38806 [2024-11-19 18:03:45,163 INFO L226 Difference]: Without dead ends: 20888 [2024-11-19 18:03:45,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:45,176 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 102 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:45,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 148 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:03:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20888 states. [2024-11-19 18:03:45,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20888 to 19948. [2024-11-19 18:03:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19948 states, 19947 states have (on average 1.0968065373239084) internal successors, (21878), 19947 states have internal predecessors, (21878), 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-19 18:03:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19948 states to 19948 states and 21878 transitions. [2024-11-19 18:03:45,356 INFO L78 Accepts]: Start accepts. Automaton has 19948 states and 21878 transitions. Word has length 574 [2024-11-19 18:03:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:45,357 INFO L471 AbstractCegarLoop]: Abstraction has 19948 states and 21878 transitions. [2024-11-19 18:03:45,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-19 18:03:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19948 states and 21878 transitions. [2024-11-19 18:03:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2024-11-19 18:03:45,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:03:45,371 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:03:45,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 18:03:45,371 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:03:45,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:03:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash -726561439, now seen corresponding path program 1 times [2024-11-19 18:03:45,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:03:45,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407779737] [2024-11-19 18:03:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:03:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:03:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:03:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-19 18:03:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:03:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407779737] [2024-11-19 18:03:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407779737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:03:45,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:03:45,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:03:45,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003654859] [2024-11-19 18:03:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:03:45,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:03:45,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:03:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:03:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:45,569 INFO L87 Difference]: Start difference. First operand 19948 states and 21878 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-19 18:03:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:03:46,119 INFO L93 Difference]: Finished difference Result 40809 states and 44751 transitions. [2024-11-19 18:03:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:03:46,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 575 [2024-11-19 18:03:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:03:46,121 INFO L225 Difference]: With dead ends: 40809 [2024-11-19 18:03:46,121 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 18:03:46,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:03:46,135 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 101 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:03:46,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 130 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:03:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 18:03:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 18:03:46,136 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-19 18:03:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 18:03:46,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 575 [2024-11-19 18:03:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:03:46,137 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 18:03:46,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-19 18:03:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 18:03:46,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 18:03:46,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 18:03:46,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 18:03:46,142 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:03:46,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 18:03:52,239 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 600 DAG size of output: 691 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-19 18:03:55,321 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 18:03:55,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:03:55 BoogieIcfgContainer [2024-11-19 18:03:55,348 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 18:03:55,349 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 18:03:55,349 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 18:03:55,349 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 18:03:55,349 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:03:12" (3/4) ... [2024-11-19 18:03:55,351 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 18:03:55,370 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 18:03:55,371 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 18:03:55,372 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 18:03:55,373 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 18:03:55,520 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 18:03:55,521 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 18:03:55,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 18:03:55,522 INFO L158 Benchmark]: Toolchain (without parser) took 45038.88ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 85.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 639.2MB. Max. memory is 16.1GB. [2024-11-19 18:03:55,523 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 110.5MB in the beginning and 110.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 18:03:55,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.04ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 85.1MB in the beginning and 171.3MB in the end (delta: -86.1MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-11-19 18:03:55,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.14ms. Allocated memory is still 222.3MB. Free memory was 171.3MB in the beginning and 153.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 18:03:55,523 INFO L158 Benchmark]: Boogie Preprocessor took 156.72ms. Allocated memory is still 222.3MB. Free memory was 153.4MB in the beginning and 128.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 18:03:55,523 INFO L158 Benchmark]: RCFGBuilder took 1375.18ms. Allocated memory is still 222.3MB. Free memory was 128.3MB in the beginning and 160.7MB in the end (delta: -32.5MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2024-11-19 18:03:55,524 INFO L158 Benchmark]: TraceAbstraction took 42611.77ms. Allocated memory was 222.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 159.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-19 18:03:55,524 INFO L158 Benchmark]: Witness Printer took 172.28ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 18:03:55,525 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.14ms. Allocated memory is still 159.4MB. Free memory was 110.5MB in the beginning and 110.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.04ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 85.1MB in the beginning and 171.3MB in the end (delta: -86.1MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.14ms. Allocated memory is still 222.3MB. Free memory was 171.3MB in the beginning and 153.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 156.72ms. Allocated memory is still 222.3MB. Free memory was 153.4MB in the beginning and 128.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1375.18ms. Allocated memory is still 222.3MB. Free memory was 128.3MB in the beginning and 160.7MB in the end (delta: -32.5MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42611.77ms. Allocated memory was 222.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 159.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 172.28ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. 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: 190]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.4s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4368 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4368 mSDsluCounter, 4534 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 706 mSDsCounter, 2496 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18059 IncrementalHoareTripleChecker+Invalid, 20555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2496 mSolverCounterUnsat, 3828 mSDtfsCounter, 18059 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1453 GetRequests, 1412 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25512occurred in iteration=16, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 35402 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 7419 NumberOfCodeBlocks, 7419 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 7769 ConstructedInterpolants, 0 QuantifiedInterpolants, 31576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1364 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 7411/7944 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: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a29 <= 599999) && ((((((((a29 <= 275) && (a25 <= 10)) && (a23 <= 262)) && (a4 == 1)) && (130 <= a29)) || ((a25 == 13) && (a4 == 1))) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))) || (((a25 == 9) && (a4 == 1)) && (130 <= a29)))) || (((((long long) a23 + 43) <= 0) && (a29 <= 599999)) && (a25 == 9))) || (((a29 <= 140) && (a23 <= 262)) && (a25 == 9))) || ((((a25 == 12) && (a29 <= 599999)) && (a4 == 1)) && (130 <= a29))) || (((a25 == 11) && (((long long) a29 + 275824) <= 0)) && (a4 == 1))) || (((a29 <= 275) && (a25 == 12)) && (130 <= a29))) || ((((307 <= a23) && (a29 <= 599999)) && (a4 == 1)) && (a25 == 10))) || (((((long long) a23 + 43) <= 0) && (a25 == 11)) && (a29 <= 130))) || ((((a29 <= 140) && (a25 == 9)) && (a4 == 1)) && (a23 <= 312))) || (((a25 == 12) && (a29 <= 599999)) && (a23 <= 137))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (130 <= a29))) || (((a29 <= 140) && (a23 <= 262)) && (a25 == 10))) || ((((a25 == 11) && (a29 <= 599999)) && (a4 == 1)) && (130 <= a29))) || (((a29 <= 275) && (a4 == 1)) && (a25 == 10))) || (((a25 == 13) && (((long long) 35913 + a29) <= 0)) && (a23 <= 137))) || ((((a29 <= 275) && (a25 == 11)) && (a23 <= 262)) && (130 <= a29))) || ((a25 == 10) && (a29 <= 130))) || (((((long long) a23 + 127601) <= 0) && (a25 == 11)) && (a29 <= 599999))) || ((((a25 == 11) && (a29 <= 599999)) && (a4 == 1)) && (a23 <= 312))) || (((((300138 <= a29) && (307 <= a23)) && (a25 <= 10)) && (a29 <= 599999)) && (a4 == 1))) || ((a29 <= 599999) && ((((a25 == 12) && (a23 <= 262)) && (a4 == 1)) || ((((a25 <= 10) && (a29 <= 220)) && (a4 == 1)) && (a23 <= 137))))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 137))) || ((a25 == 12) && (((long long) a29 + 275824) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-19 18:03:55,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE