./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label33.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 aaccf385f935203878b819a92144fc9de308865fc678d0507ba69ad2b46a0a7a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:00:12,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:00:12,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:00:12,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:00:12,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:00:12,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:00:12,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:00:12,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:00:12,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:00:12,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:00:12,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:00:12,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:00:12,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:00:12,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:00:12,770 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:00:12,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:00:12,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:00:12,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:00:12,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:00:12,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:00:12,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:00:12,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:00:12,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:00:12,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:00:12,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:00:12,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:00:12,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:00:12,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:00:12,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:00:12,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:00:12,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:00:12,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:00:12,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:00:12,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:00:12,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:00:12,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:00:12,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:00:12,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:00:12,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:00:12,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:00:12,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:00:12,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:00:12,782 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 -> aaccf385f935203878b819a92144fc9de308865fc678d0507ba69ad2b46a0a7a [2024-11-11 17:00:13,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:00:13,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:00:13,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:00:13,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:00:13,084 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:00:13,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label33.c [2024-11-11 17:00:14,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:00:14,923 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:00:14,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label33.c [2024-11-11 17:00:14,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0167b2141/d4f3f2a5ebb94605a88c8869a4eab9b1/FLAG30d301889 [2024-11-11 17:00:14,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0167b2141/d4f3f2a5ebb94605a88c8869a4eab9b1 [2024-11-11 17:00:14,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:00:14,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:00:14,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:00:14,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:00:15,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:00:15,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:00:14" (1/1) ... [2024-11-11 17:00:15,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6565b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:15, skipping insertion in model container [2024-11-11 17:00:15,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:00:14" (1/1) ... [2024-11-11 17:00:15,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:00:15,361 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/Problem13_label33.c[5177,5190] [2024-11-11 17:00:16,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:00:16,252 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:00:16,278 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/Problem13_label33.c[5177,5190] [2024-11-11 17:00:16,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:00:16,781 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:00:16,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16 WrapperNode [2024-11-11 17:00:16,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:00:16,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:00:16,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:00:16,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:00:16,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:16,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:17,400 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-11 17:00:17,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:00:17,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:00:17,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:00:17,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:00:17,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:17,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:17,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:17,782 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 17:00:17,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:17,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:18,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:18,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:18,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:18,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:18,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:00:18,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:00:18,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:00:18,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:00:18,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (1/1) ... [2024-11-11 17:00:18,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:00:18,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:00:18,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 17:00:18,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 17:00:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:00:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:00:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:00:18,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:00:18,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:00:18,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:00:24,782 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-11 17:00:24,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:00:24,831 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:00:24,831 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:00:24,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:00:24 BoogieIcfgContainer [2024-11-11 17:00:24,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:00:24,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:00:24,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:00:24,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:00:24,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:00:14" (1/3) ... [2024-11-11 17:00:24,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee2c198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:00:24, skipping insertion in model container [2024-11-11 17:00:24,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:16" (2/3) ... [2024-11-11 17:00:24,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee2c198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:00:24, skipping insertion in model container [2024-11-11 17:00:24,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:00:24" (3/3) ... [2024-11-11 17:00:24,841 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label33.c [2024-11-11 17:00:24,859 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:00:24,859 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:00:24,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:00:24,972 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;@18c85416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:00:24,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:00:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 17:00:24,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:24,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:24,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:24,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:24,995 INFO L85 PathProgramCache]: Analyzing trace with hash -596708735, now seen corresponding path program 1 times [2024-11-11 17:00:25,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:25,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044123903] [2024-11-11 17:00:25,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:00:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:25,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044123903] [2024-11-11 17:00:25,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044123903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:25,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:25,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:00:25,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423266820] [2024-11-11 17:00:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:25,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:25,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:25,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:25,534 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:30,042 INFO L93 Difference]: Finished difference Result 3082 states and 5689 transitions. [2024-11-11 17:00:30,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:30,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-11 17:00:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:30,095 INFO L225 Difference]: With dead ends: 3082 [2024-11-11 17:00:30,095 INFO L226 Difference]: Without dead ends: 1899 [2024-11-11 17:00:30,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:30,111 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1004 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:30,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 641 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-11 17:00:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-11-11 17:00:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2024-11-11 17:00:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2024-11-11 17:00:30,240 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 35 [2024-11-11 17:00:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:00:30,241 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2024-11-11 17:00:30,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2024-11-11 17:00:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 17:00:30,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:30,245 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:00:30,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:30,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1328340326, now seen corresponding path program 1 times [2024-11-11 17:00:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363858669] [2024-11-11 17:00:30,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:00:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:30,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363858669] [2024-11-11 17:00:30,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363858669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:30,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:00:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115672827] [2024-11-11 17:00:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:30,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:30,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:30,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:30,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:30,497 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:34,083 INFO L93 Difference]: Finished difference Result 5384 states and 9441 transitions. [2024-11-11 17:00:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:34,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-11 17:00:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:34,096 INFO L225 Difference]: With dead ends: 5384 [2024-11-11 17:00:34,097 INFO L226 Difference]: Without dead ends: 3492 [2024-11-11 17:00:34,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:34,100 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:34,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1013 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-11 17:00:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2024-11-11 17:00:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3491. [2024-11-11 17:00:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3490 states have (on average 1.5383954154727795) internal successors, (5369), 3490 states have internal predecessors, (5369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 5369 transitions. [2024-11-11 17:00:34,157 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 5369 transitions. Word has length 100 [2024-11-11 17:00:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:00:34,158 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 5369 transitions. [2024-11-11 17:00:34,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 5369 transitions. [2024-11-11 17:00:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 17:00:34,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:34,160 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:34,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:00:34,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 497243647, now seen corresponding path program 1 times [2024-11-11 17:00:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139986505] [2024-11-11 17:00:34,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:00:34,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:34,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139986505] [2024-11-11 17:00:34,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139986505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:34,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:00:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917794640] [2024-11-11 17:00:34,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:34,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:34,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:34,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:34,313 INFO L87 Difference]: Start difference. First operand 3491 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:37,316 INFO L93 Difference]: Finished difference Result 10169 states and 15700 transitions. [2024-11-11 17:00:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:37,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-11 17:00:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:37,341 INFO L225 Difference]: With dead ends: 10169 [2024-11-11 17:00:37,341 INFO L226 Difference]: Without dead ends: 6680 [2024-11-11 17:00:37,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:37,350 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:37,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 847 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 17:00:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2024-11-11 17:00:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 6669. [2024-11-11 17:00:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6669 states, 6668 states have (on average 1.375224955008998) internal successors, (9170), 6668 states have internal predecessors, (9170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6669 states to 6669 states and 9170 transitions. [2024-11-11 17:00:37,465 INFO L78 Accepts]: Start accepts. Automaton has 6669 states and 9170 transitions. Word has length 102 [2024-11-11 17:00:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:00:37,466 INFO L471 AbstractCegarLoop]: Abstraction has 6669 states and 9170 transitions. [2024-11-11 17:00:37,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 6669 states and 9170 transitions. [2024-11-11 17:00:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 17:00:37,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:37,469 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:37,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:00:37,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1488021875, now seen corresponding path program 1 times [2024-11-11 17:00:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:37,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116165342] [2024-11-11 17:00:37,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:00:38,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116165342] [2024-11-11 17:00:38,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116165342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:38,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:38,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:00:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907136578] [2024-11-11 17:00:38,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:38,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:38,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:38,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:38,027 INFO L87 Difference]: Start difference. First operand 6669 states and 9170 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:40,790 INFO L93 Difference]: Finished difference Result 14123 states and 19185 transitions. [2024-11-11 17:00:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-11-11 17:00:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:40,811 INFO L225 Difference]: With dead ends: 14123 [2024-11-11 17:00:40,812 INFO L226 Difference]: Without dead ends: 7456 [2024-11-11 17:00:40,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:40,825 INFO L435 NwaCegarLoop]: 1086 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:40,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1215 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 17:00:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2024-11-11 17:00:40,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7456. [2024-11-11 17:00:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3362843729040912) internal successors, (9962), 7455 states have internal predecessors, (9962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9962 transitions. [2024-11-11 17:00:40,997 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9962 transitions. Word has length 146 [2024-11-11 17:00:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:00:40,998 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9962 transitions. [2024-11-11 17:00:40,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9962 transitions. [2024-11-11 17:00:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-11 17:00:41,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:41,001 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:41,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:00:41,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1668473655, now seen corresponding path program 1 times [2024-11-11 17:00:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013985721] [2024-11-11 17:00:41,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 17:00:41,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:41,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013985721] [2024-11-11 17:00:41,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013985721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:41,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:00:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795663386] [2024-11-11 17:00:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:41,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:41,252 INFO L87 Difference]: Start difference. First operand 7456 states and 9962 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:44,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:44,369 INFO L93 Difference]: Finished difference Result 19656 states and 26991 transitions. [2024-11-11 17:00:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:44,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 160 [2024-11-11 17:00:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:44,401 INFO L225 Difference]: With dead ends: 19656 [2024-11-11 17:00:44,401 INFO L226 Difference]: Without dead ends: 12989 [2024-11-11 17:00:44,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:44,411 INFO L435 NwaCegarLoop]: 1071 mSDtfsCounter, 737 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:44,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1222 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 17:00:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12989 states. [2024-11-11 17:00:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12989 to 12972. [2024-11-11 17:00:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.235910878112713) internal successors, (16031), 12971 states have internal predecessors, (16031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16031 transitions. [2024-11-11 17:00:44,602 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16031 transitions. Word has length 160 [2024-11-11 17:00:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:00:44,603 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16031 transitions. [2024-11-11 17:00:44,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16031 transitions. [2024-11-11 17:00:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-11 17:00:44,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:44,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:44,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:00:44,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:44,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1749118278, now seen corresponding path program 1 times [2024-11-11 17:00:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:44,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705745985] [2024-11-11 17:00:44,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:44,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-11 17:00:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705745985] [2024-11-11 17:00:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705745985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:44,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:44,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:00:44,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047952423] [2024-11-11 17:00:44,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:44,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:44,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:44,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:44,964 INFO L87 Difference]: Start difference. First operand 12972 states and 16031 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:47,827 INFO L93 Difference]: Finished difference Result 22792 states and 28651 transitions. [2024-11-11 17:00:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:47,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 247 [2024-11-11 17:00:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:47,855 INFO L225 Difference]: With dead ends: 22792 [2024-11-11 17:00:47,855 INFO L226 Difference]: Without dead ends: 12980 [2024-11-11 17:00:47,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:47,868 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:47,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1211 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 17:00:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12980 states. [2024-11-11 17:00:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12980 to 12972. [2024-11-11 17:00:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.2347544522396114) internal successors, (16016), 12971 states have internal predecessors, (16016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16016 transitions. [2024-11-11 17:00:48,047 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16016 transitions. Word has length 247 [2024-11-11 17:00:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:00:48,048 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16016 transitions. [2024-11-11 17:00:48,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16016 transitions. [2024-11-11 17:00:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-11 17:00:48,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:48,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:48,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:00:48,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:48,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash 265245920, now seen corresponding path program 1 times [2024-11-11 17:00:48,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817052313] [2024-11-11 17:00:48,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:48,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:00:48,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:48,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817052313] [2024-11-11 17:00:48,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817052313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:48,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:48,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:00:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962090770] [2024-11-11 17:00:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:48,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:48,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:48,295 INFO L87 Difference]: Start difference. First operand 12972 states and 16016 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:51,469 INFO L93 Difference]: Finished difference Result 36166 states and 45134 transitions. [2024-11-11 17:00:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2024-11-11 17:00:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:51,511 INFO L225 Difference]: With dead ends: 36166 [2024-11-11 17:00:51,511 INFO L226 Difference]: Without dead ends: 23196 [2024-11-11 17:00:51,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:51,532 INFO L435 NwaCegarLoop]: 1851 mSDtfsCounter, 841 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:51,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1989 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 17:00:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23196 states. [2024-11-11 17:00:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23196 to 22404. [2024-11-11 17:00:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22404 states, 22403 states have (on average 1.1931884122662144) internal successors, (26731), 22403 states have internal predecessors, (26731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22404 states to 22404 states and 26731 transitions. [2024-11-11 17:00:51,797 INFO L78 Accepts]: Start accepts. Automaton has 22404 states and 26731 transitions. Word has length 249 [2024-11-11 17:00:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:00:51,797 INFO L471 AbstractCegarLoop]: Abstraction has 22404 states and 26731 transitions. [2024-11-11 17:00:51,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 22404 states and 26731 transitions. [2024-11-11 17:00:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-11 17:00:51,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:51,802 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:00:51,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:51,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1770450640, now seen corresponding path program 1 times [2024-11-11 17:00:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447538662] [2024-11-11 17:00:51,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 17:00:51,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447538662] [2024-11-11 17:00:51,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447538662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:51,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:51,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:00:51,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387244839] [2024-11-11 17:00:51,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:51,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:51,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:51,986 INFO L87 Difference]: Start difference. First operand 22404 states and 26731 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:55,296 INFO L93 Difference]: Finished difference Result 55046 states and 66948 transitions. [2024-11-11 17:00:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:55,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 271 [2024-11-11 17:00:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:55,343 INFO L225 Difference]: With dead ends: 55046 [2024-11-11 17:00:55,344 INFO L226 Difference]: Without dead ends: 33431 [2024-11-11 17:00:55,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:55,364 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 882 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:55,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 928 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 17:00:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33431 states. [2024-11-11 17:00:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33431 to 32635. [2024-11-11 17:00:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32635 states, 32634 states have (on average 1.176135318992462) internal successors, (38382), 32634 states have internal predecessors, (38382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32635 states to 32635 states and 38382 transitions. [2024-11-11 17:00:55,738 INFO L78 Accepts]: Start accepts. Automaton has 32635 states and 38382 transitions. Word has length 271 [2024-11-11 17:00:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:00:55,738 INFO L471 AbstractCegarLoop]: Abstraction has 32635 states and 38382 transitions. [2024-11-11 17:00:55,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 32635 states and 38382 transitions. [2024-11-11 17:00:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-11 17:00:55,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:55,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-11 17:00:55,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:00:55,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:55,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1030407125, now seen corresponding path program 1 times [2024-11-11 17:00:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273128054] [2024-11-11 17:00:55,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-11 17:00:55,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:55,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273128054] [2024-11-11 17:00:55,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273128054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:55,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:55,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:00:55,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126521762] [2024-11-11 17:00:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:55,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:55,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:55,982 INFO L87 Difference]: Start difference. First operand 32635 states and 38382 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:59,546 INFO L93 Difference]: Finished difference Result 76294 states and 91193 transitions. [2024-11-11 17:00:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:59,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 326 [2024-11-11 17:00:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:59,618 INFO L225 Difference]: With dead ends: 76294 [2024-11-11 17:00:59,618 INFO L226 Difference]: Without dead ends: 44448 [2024-11-11 17:00:59,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:59,646 INFO L435 NwaCegarLoop]: 1806 mSDtfsCounter, 829 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:59,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1950 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 17:00:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44448 states. [2024-11-11 17:01:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44448 to 43657. [2024-11-11 17:01:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43657 states, 43656 states have (on average 1.151663001649258) internal successors, (50277), 43656 states have internal predecessors, (50277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43657 states to 43657 states and 50277 transitions. [2024-11-11 17:01:00,224 INFO L78 Accepts]: Start accepts. Automaton has 43657 states and 50277 transitions. Word has length 326 [2024-11-11 17:01:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:00,224 INFO L471 AbstractCegarLoop]: Abstraction has 43657 states and 50277 transitions. [2024-11-11 17:01:00,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 43657 states and 50277 transitions. [2024-11-11 17:01:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-11 17:01:00,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:00,230 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:00,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:01:00,231 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:00,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2107588233, now seen corresponding path program 1 times [2024-11-11 17:01:00,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:00,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955520122] [2024-11-11 17:01:00,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 197 proven. 110 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 17:01:01,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:01,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955520122] [2024-11-11 17:01:01,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955520122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:01:01,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363441753] [2024-11-11 17:01:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:01,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:01:01,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:01:01,364 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-11 17:01:01,365 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-11 17:01:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:01,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:01:01,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:01:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-11 17:01:01,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:01:01,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363441753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:01,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:01:01,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 17:01:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788539986] [2024-11-11 17:01:01,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:01,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:01,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:01,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:01,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:01:01,663 INFO L87 Difference]: Start difference. First operand 43657 states and 50277 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:04,544 INFO L93 Difference]: Finished difference Result 86516 states and 99752 transitions. [2024-11-11 17:01:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:04,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2024-11-11 17:01:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:04,592 INFO L225 Difference]: With dead ends: 86516 [2024-11-11 17:01:04,592 INFO L226 Difference]: Without dead ends: 43648 [2024-11-11 17:01:04,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:01:04,625 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1076 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:04,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 818 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 17:01:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43648 states. [2024-11-11 17:01:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43648 to 43647. [2024-11-11 17:01:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43647 states, 43646 states have (on average 1.1132749851074555) internal successors, (48590), 43646 states have internal predecessors, (48590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43647 states to 43647 states and 48590 transitions. [2024-11-11 17:01:05,039 INFO L78 Accepts]: Start accepts. Automaton has 43647 states and 48590 transitions. Word has length 341 [2024-11-11 17:01:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:05,040 INFO L471 AbstractCegarLoop]: Abstraction has 43647 states and 48590 transitions. [2024-11-11 17:01:05,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 43647 states and 48590 transitions. [2024-11-11 17:01:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-11 17:01:05,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:05,047 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:05,065 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-11 17:01:05,247 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,SelfDestructingSolverStorable9 [2024-11-11 17:01:05,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:05,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1592896073, now seen corresponding path program 1 times [2024-11-11 17:01:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:05,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888441691] [2024-11-11 17:01:05,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:05,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-11-11 17:01:05,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:05,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888441691] [2024-11-11 17:01:05,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888441691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:05,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:05,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:05,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459077508] [2024-11-11 17:01:05,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:05,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:05,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:05,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:05,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:05,785 INFO L87 Difference]: Start difference. First operand 43647 states and 48590 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:08,553 INFO L93 Difference]: Finished difference Result 86503 states and 96385 transitions. [2024-11-11 17:01:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:08,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 360 [2024-11-11 17:01:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:08,594 INFO L225 Difference]: With dead ends: 86503 [2024-11-11 17:01:08,595 INFO L226 Difference]: Without dead ends: 43645 [2024-11-11 17:01:08,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:08,620 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 1167 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:08,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1421 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 17:01:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43645 states. [2024-11-11 17:01:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43645 to 43644. [2024-11-11 17:01:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43644 states, 43643 states have (on average 1.086588914602571) internal successors, (47422), 43643 states have internal predecessors, (47422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43644 states to 43644 states and 47422 transitions. [2024-11-11 17:01:09,016 INFO L78 Accepts]: Start accepts. Automaton has 43644 states and 47422 transitions. Word has length 360 [2024-11-11 17:01:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:09,017 INFO L471 AbstractCegarLoop]: Abstraction has 43644 states and 47422 transitions. [2024-11-11 17:01:09,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 43644 states and 47422 transitions. [2024-11-11 17:01:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-11-11 17:01:09,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:09,023 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:09,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:01:09,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:09,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:09,024 INFO L85 PathProgramCache]: Analyzing trace with hash -489551286, now seen corresponding path program 1 times [2024-11-11 17:01:09,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:09,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309765508] [2024-11-11 17:01:09,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:09,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-11 17:01:09,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:09,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309765508] [2024-11-11 17:01:09,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309765508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:09,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:09,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:09,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305253107] [2024-11-11 17:01:09,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:09,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:01:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:09,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:01:09,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:01:09,338 INFO L87 Difference]: Start difference. First operand 43644 states and 47422 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:15,366 INFO L93 Difference]: Finished difference Result 150458 states and 163809 transitions. [2024-11-11 17:01:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:01:15,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 383 [2024-11-11 17:01:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:15,495 INFO L225 Difference]: With dead ends: 150458 [2024-11-11 17:01:15,495 INFO L226 Difference]: Without dead ends: 107603 [2024-11-11 17:01:15,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:01:15,531 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1703 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 6635 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 7670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 6635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:15,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 801 Invalid, 7670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 6635 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-11 17:01:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107603 states. [2024-11-11 17:01:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107603 to 104326. [2024-11-11 17:01:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104326 states, 104325 states have (on average 1.0794344596213754) internal successors, (112612), 104325 states have internal predecessors, (112612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104326 states to 104326 states and 112612 transitions. [2024-11-11 17:01:17,225 INFO L78 Accepts]: Start accepts. Automaton has 104326 states and 112612 transitions. Word has length 383 [2024-11-11 17:01:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:17,225 INFO L471 AbstractCegarLoop]: Abstraction has 104326 states and 112612 transitions. [2024-11-11 17:01:17,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 104326 states and 112612 transitions. [2024-11-11 17:01:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-11-11 17:01:17,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:17,234 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 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-11 17:01:17,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:01:17,234 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:17,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1060659488, now seen corresponding path program 1 times [2024-11-11 17:01:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122007037] [2024-11-11 17:01:17,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 363 proven. 113 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-11 17:01:18,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:18,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122007037] [2024-11-11 17:01:18,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122007037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:01:18,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450408036] [2024-11-11 17:01:18,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:18,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:01:18,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:01:18,844 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-11 17:01:18,847 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-11 17:01:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:19,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:01:19,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:01:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2024-11-11 17:01:19,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:01:19,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450408036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:19,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:01:19,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-11 17:01:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486275138] [2024-11-11 17:01:19,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:19,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:19,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:19,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 17:01:19,082 INFO L87 Difference]: Start difference. First operand 104326 states and 112612 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:22,569 INFO L93 Difference]: Finished difference Result 233052 states and 253448 transitions. [2024-11-11 17:01:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:22,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 426 [2024-11-11 17:01:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:22,705 INFO L225 Difference]: With dead ends: 233052 [2024-11-11 17:01:22,705 INFO L226 Difference]: Without dead ends: 129515 [2024-11-11 17:01:22,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 17:01:22,945 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 954 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:22,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 880 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [939 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 17:01:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129515 states. [2024-11-11 17:01:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129515 to 127922. [2024-11-11 17:01:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127922 states, 127921 states have (on average 1.0841925876126672) internal successors, (138691), 127921 states have internal predecessors, (138691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127922 states to 127922 states and 138691 transitions. [2024-11-11 17:01:24,789 INFO L78 Accepts]: Start accepts. Automaton has 127922 states and 138691 transitions. Word has length 426 [2024-11-11 17:01:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:24,790 INFO L471 AbstractCegarLoop]: Abstraction has 127922 states and 138691 transitions. [2024-11-11 17:01:24,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 127922 states and 138691 transitions. [2024-11-11 17:01:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2024-11-11 17:01:24,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:24,806 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:24,820 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-11 17:01:25,006 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,SelfDestructingSolverStorable12 [2024-11-11 17:01:25,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:25,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1560615882, now seen corresponding path program 1 times [2024-11-11 17:01:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:25,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262235504] [2024-11-11 17:01:25,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-11 17:01:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:25,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262235504] [2024-11-11 17:01:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262235504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:25,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386801698] [2024-11-11 17:01:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:25,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:25,891 INFO L87 Difference]: Start difference. First operand 127922 states and 138691 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:29,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:29,227 INFO L93 Difference]: Finished difference Result 256633 states and 278180 transitions. [2024-11-11 17:01:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:29,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 495 [2024-11-11 17:01:29,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:29,381 INFO L225 Difference]: With dead ends: 256633 [2024-11-11 17:01:29,381 INFO L226 Difference]: Without dead ends: 129500 [2024-11-11 17:01:29,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:29,431 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 835 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:29,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1470 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 17:01:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129500 states.