./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label04.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 2adccaef3712b0295c8f7cfd3e1ed73b8b25a6bf1026bcea89334476cfd41a2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:11:34,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:11:34,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:11:34,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:11:34,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:11:34,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:11:34,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:11:34,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:11:34,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:11:34,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:11:34,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:11:34,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:11:34,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:11:34,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:11:34,615 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:11:34,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:11:34,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:11:34,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:11:34,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:11:34,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:11:34,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:11:34,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:11:34,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:11:34,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:11:34,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:11:34,619 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:11:34,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:11:34,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:11:34,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:11:34,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:11:34,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:11:34,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:11:34,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:11:34,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:11:34,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:11:34,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:11:34,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:11:34,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:11:34,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:11:34,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:11:34,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:11:34,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:11:34,622 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 -> 2adccaef3712b0295c8f7cfd3e1ed73b8b25a6bf1026bcea89334476cfd41a2b [2024-11-21 22:11:34,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:11:34,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:11:34,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:11:34,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:11:34,856 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:11:34,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label04.c [2024-11-21 22:11:36,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:11:36,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:11:36,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label04.c [2024-11-21 22:11:36,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794148e99/e112309dd54c49099fbddb4a5536983e/FLAGeb93a994b [2024-11-21 22:11:36,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794148e99/e112309dd54c49099fbddb4a5536983e [2024-11-21 22:11:36,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:11:36,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:11:36,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:11:36,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:11:36,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:11:36,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:11:36" (1/1) ... [2024-11-21 22:11:36,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca996e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:36, skipping insertion in model container [2024-11-21 22:11:36,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:11:36" (1/1) ... [2024-11-21 22:11:36,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:11:36,744 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_label04.c[2611,2624] [2024-11-21 22:11:37,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:11:37,342 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:11:37,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_label04.c[2611,2624] [2024-11-21 22:11:37,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:11:37,711 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:11:37,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37 WrapperNode [2024-11-21 22:11:37,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:11:37,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:11:37,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:11:37,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:11:37,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:37,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,135 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-21 22:11:38,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:11:38,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:11:38,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:11:38,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:11:38,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,486 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-21 22:11:38,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:11:38,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:11:38,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:11:38,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:11:38,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (1/1) ... [2024-11-21 22:11:38,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:11:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:11:38,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 22:11:38,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 22:11:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:11:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:11:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:11:38,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:11:38,923 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:11:38,925 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:11:43,570 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-21 22:11:43,570 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:11:43,603 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:11:43,603 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:11:43,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:11:43 BoogieIcfgContainer [2024-11-21 22:11:43,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:11:43,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:11:43,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:11:43,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:11:43,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:11:36" (1/3) ... [2024-11-21 22:11:43,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a41d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:11:43, skipping insertion in model container [2024-11-21 22:11:43,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:11:37" (2/3) ... [2024-11-21 22:11:43,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a41d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:11:43, skipping insertion in model container [2024-11-21 22:11:43,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:11:43" (3/3) ... [2024-11-21 22:11:43,613 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label04.c [2024-11-21 22:11:43,626 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:11:43,626 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:11:43,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:11:43,697 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;@7784fc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:11:43,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:11:43,705 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-21 22:11:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 22:11:43,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:11:43,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:11:43,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:11:43,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:11:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1657508526, now seen corresponding path program 1 times [2024-11-21 22:11:43,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:11:43,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85936598] [2024-11-21 22:11:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:11:43,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:11:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:11:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:11:43,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:11:43,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85936598] [2024-11-21 22:11:43,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85936598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:11:43,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:11:43,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:11:43,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454270462] [2024-11-21 22:11:43,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:11:43,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:11:43,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:11:43,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:11:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:43,982 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:11:47,326 INFO L93 Difference]: Finished difference Result 3147 states and 5806 transitions. [2024-11-21 22:11:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:11:47,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-21 22:11:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:11:47,351 INFO L225 Difference]: With dead ends: 3147 [2024-11-21 22:11:47,352 INFO L226 Difference]: Without dead ends: 1964 [2024-11-21 22:11:47,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:47,358 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 1163 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-21 22:11:47,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 992 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-21 22:11:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-11-21 22:11:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2024-11-21 22:11:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2024-11-21 22:11:47,442 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 16 [2024-11-21 22:11:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:11:47,444 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2024-11-21 22:11:47,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2024-11-21 22:11:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-21 22:11:47,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:11:47,446 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-21 22:11:47,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:11:47,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:11:47,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:11:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash -9926837, now seen corresponding path program 1 times [2024-11-21 22:11:47,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:11:47,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988458883] [2024-11-21 22:11:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:11:47,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:11:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:11:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:11:47,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:11:47,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988458883] [2024-11-21 22:11:47,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988458883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:11:47,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:11:47,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:11:47,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419113435] [2024-11-21 22:11:47,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:11:47,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:11:47,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:11:47,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:11:47,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:47,644 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:11:50,871 INFO L93 Difference]: Finished difference Result 5540 states and 9221 transitions. [2024-11-21 22:11:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:11:50,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-21 22:11:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:11:50,883 INFO L225 Difference]: With dead ends: 5540 [2024-11-21 22:11:50,883 INFO L226 Difference]: Without dead ends: 3591 [2024-11-21 22:11:50,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:50,889 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 923 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-21 22:11:50,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-21 22:11:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2024-11-21 22:11:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3581. [2024-11-21 22:11:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2024-11-21 22:11:50,954 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 87 [2024-11-21 22:11:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:11:50,954 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2024-11-21 22:11:50,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2024-11-21 22:11:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-21 22:11:50,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:11:50,961 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:11:50,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 22:11:50,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:11:50,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:11:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash 152230728, now seen corresponding path program 1 times [2024-11-21 22:11:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:11:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807832929] [2024-11-21 22:11:50,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:11:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:11:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:11:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:11:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:11:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807832929] [2024-11-21 22:11:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807832929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:11:51,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:11:51,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:11:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772887491] [2024-11-21 22:11:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:11:51,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:11:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:11:51,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:11:51,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:51,095 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:11:53,685 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2024-11-21 22:11:53,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:11:53,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-21 22:11:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:11:53,703 INFO L225 Difference]: With dead ends: 10352 [2024-11-21 22:11:53,703 INFO L226 Difference]: Without dead ends: 6773 [2024-11-21 22:11:53,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:53,709 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:11:53,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1172 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-21 22:11:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-21 22:11:53,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2024-11-21 22:11:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8943 transitions. [2024-11-21 22:11:53,787 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8943 transitions. Word has length 101 [2024-11-21 22:11:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:11:53,788 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8943 transitions. [2024-11-21 22:11:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8943 transitions. [2024-11-21 22:11:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-21 22:11:53,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:11:53,794 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:11:53,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 22:11:53,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:11:53,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:11:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1958755326, now seen corresponding path program 1 times [2024-11-21 22:11:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:11:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369566879] [2024-11-21 22:11:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:11:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:11:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:11:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:11:53,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:11:53,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369566879] [2024-11-21 22:11:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369566879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:11:53,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:11:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:11:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184448931] [2024-11-21 22:11:53,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:11:53,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:11:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:11:53,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:11:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:53,981 INFO L87 Difference]: Start difference. First operand 6749 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:11:56,413 INFO L93 Difference]: Finished difference Result 19804 states and 26220 transitions. [2024-11-21 22:11:56,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:11:56,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2024-11-21 22:11:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:11:56,441 INFO L225 Difference]: With dead ends: 19804 [2024-11-21 22:11:56,442 INFO L226 Difference]: Without dead ends: 13057 [2024-11-21 22:11:56,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:56,447 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 865 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:11:56,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1035 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-21 22:11:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2024-11-21 22:11:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 13052. [2024-11-21 22:11:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13052 states, 13051 states have (on average 1.217914336066202) internal successors, (15895), 13051 states have internal predecessors, (15895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13052 states to 13052 states and 15895 transitions. [2024-11-21 22:11:56,596 INFO L78 Accepts]: Start accepts. Automaton has 13052 states and 15895 transitions. Word has length 130 [2024-11-21 22:11:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:11:56,597 INFO L471 AbstractCegarLoop]: Abstraction has 13052 states and 15895 transitions. [2024-11-21 22:11:56,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13052 states and 15895 transitions. [2024-11-21 22:11:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-21 22:11:56,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:11:56,602 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:11:56,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 22:11:56,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:11:56,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:11:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1184373553, now seen corresponding path program 1 times [2024-11-21 22:11:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:11:56,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482445452] [2024-11-21 22:11:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:11:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:11:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:11:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 22:11:56,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:11:56,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482445452] [2024-11-21 22:11:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482445452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:11:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:11:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:11:56,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916681978] [2024-11-21 22:11:56,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:11:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:11:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:11:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:11:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:56,956 INFO L87 Difference]: Start difference. First operand 13052 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:11:59,087 INFO L93 Difference]: Finished difference Result 26889 states and 32590 transitions. [2024-11-21 22:11:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:11:59,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2024-11-21 22:11:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:11:59,112 INFO L225 Difference]: With dead ends: 26889 [2024-11-21 22:11:59,112 INFO L226 Difference]: Without dead ends: 13839 [2024-11-21 22:11:59,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:59,124 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-21 22:11:59,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-21 22:11:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2024-11-21 22:11:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13839. [2024-11-21 22:11:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13839 states, 13838 states have (on average 1.2058823529411764) internal successors, (16687), 13838 states have internal predecessors, (16687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13839 states to 13839 states and 16687 transitions. [2024-11-21 22:11:59,327 INFO L78 Accepts]: Start accepts. Automaton has 13839 states and 16687 transitions. Word has length 208 [2024-11-21 22:11:59,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:11:59,327 INFO L471 AbstractCegarLoop]: Abstraction has 13839 states and 16687 transitions. [2024-11-21 22:11:59,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:11:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 13839 states and 16687 transitions. [2024-11-21 22:11:59,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-21 22:11:59,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:11:59,332 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:11:59,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:11:59,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:11:59,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:11:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash 25568218, now seen corresponding path program 1 times [2024-11-21 22:11:59,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:11:59,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957306270] [2024-11-21 22:11:59,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:11:59,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:11:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:11:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:11:59,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:11:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957306270] [2024-11-21 22:11:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957306270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:11:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:11:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:11:59,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826158281] [2024-11-21 22:11:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:11:59,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:11:59,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:11:59,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:11:59,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:11:59,518 INFO L87 Difference]: Start difference. First operand 13839 states and 16687 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:02,193 INFO L93 Difference]: Finished difference Result 33200 states and 41058 transitions. [2024-11-21 22:12:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-21 22:12:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:02,228 INFO L225 Difference]: With dead ends: 33200 [2024-11-21 22:12:02,229 INFO L226 Difference]: Without dead ends: 20150 [2024-11-21 22:12:02,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:02,243 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 862 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:02,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 942 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-21 22:12:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2024-11-21 22:12:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 20140. [2024-11-21 22:12:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20140 states, 20139 states have (on average 1.1900789512885446) internal successors, (23967), 20139 states have internal predecessors, (23967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20140 states to 20140 states and 23967 transitions. [2024-11-21 22:12:02,421 INFO L78 Accepts]: Start accepts. Automaton has 20140 states and 23967 transitions. Word has length 215 [2024-11-21 22:12:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:02,422 INFO L471 AbstractCegarLoop]: Abstraction has 20140 states and 23967 transitions. [2024-11-21 22:12:02,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 20140 states and 23967 transitions. [2024-11-21 22:12:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-21 22:12:02,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:02,424 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:12:02,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 22:12:02,424 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:02,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:02,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1322212109, now seen corresponding path program 1 times [2024-11-21 22:12:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:02,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301816090] [2024-11-21 22:12:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:12:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301816090] [2024-11-21 22:12:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301816090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:02,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:12:02,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:12:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002136138] [2024-11-21 22:12:02,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:02,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:02,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:02,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:02,533 INFO L87 Difference]: Start difference. First operand 20140 states and 23967 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:05,054 INFO L93 Difference]: Finished difference Result 39361 states and 46961 transitions. [2024-11-21 22:12:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2024-11-21 22:12:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:05,081 INFO L225 Difference]: With dead ends: 39361 [2024-11-21 22:12:05,082 INFO L226 Difference]: Without dead ends: 20010 [2024-11-21 22:12:05,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:05,099 INFO L432 NwaCegarLoop]: 1505 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:05,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1642 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-21 22:12:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states. [2024-11-21 22:12:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 19219. [2024-11-21 22:12:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19219 states, 19218 states have (on average 1.1323238630450618) internal successors, (21761), 19218 states have internal predecessors, (21761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19219 states to 19219 states and 21761 transitions. [2024-11-21 22:12:05,268 INFO L78 Accepts]: Start accepts. Automaton has 19219 states and 21761 transitions. Word has length 230 [2024-11-21 22:12:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:05,268 INFO L471 AbstractCegarLoop]: Abstraction has 19219 states and 21761 transitions. [2024-11-21 22:12:05,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 19219 states and 21761 transitions. [2024-11-21 22:12:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-21 22:12:05,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:05,272 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:12:05,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 22:12:05,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:05,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:05,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1023656445, now seen corresponding path program 1 times [2024-11-21 22:12:05,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:05,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641762239] [2024-11-21 22:12:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:05,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 22:12:05,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:05,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641762239] [2024-11-21 22:12:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641762239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:05,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:12:05,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:12:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14590038] [2024-11-21 22:12:05,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:05,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:12:05,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:05,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:12:05,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:12:05,457 INFO L87 Difference]: Start difference. First operand 19219 states and 21761 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:10,566 INFO L93 Difference]: Finished difference Result 70903 states and 80409 transitions. [2024-11-21 22:12:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:12:10,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 299 [2024-11-21 22:12:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:10,620 INFO L225 Difference]: With dead ends: 70903 [2024-11-21 22:12:10,621 INFO L226 Difference]: Without dead ends: 52473 [2024-11-21 22:12:10,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:12:10,637 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 1705 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 6640 mSolverCounterSat, 1036 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 7676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1036 IncrementalHoareTripleChecker+Valid, 6640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:10,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 810 Invalid, 7676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1036 Valid, 6640 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-21 22:12:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52473 states. [2024-11-21 22:12:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52473 to 50782. [2024-11-21 22:12:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50782 states, 50781 states have (on average 1.116401803824265) internal successors, (56692), 50781 states have internal predecessors, (56692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50782 states to 50782 states and 56692 transitions. [2024-11-21 22:12:11,081 INFO L78 Accepts]: Start accepts. Automaton has 50782 states and 56692 transitions. Word has length 299 [2024-11-21 22:12:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:11,081 INFO L471 AbstractCegarLoop]: Abstraction has 50782 states and 56692 transitions. [2024-11-21 22:12:11,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 50782 states and 56692 transitions. [2024-11-21 22:12:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-21 22:12:11,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:11,086 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:12:11,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 22:12:11,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:11,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:11,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1837894397, now seen corresponding path program 1 times [2024-11-21 22:12:11,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:11,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692913049] [2024-11-21 22:12:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-21 22:12:11,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:11,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692913049] [2024-11-21 22:12:11,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692913049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:11,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:12:11,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:12:11,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737938030] [2024-11-21 22:12:11,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:11,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:11,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:11,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:11,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:11,439 INFO L87 Difference]: Start difference. First operand 50782 states and 56692 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:13,965 INFO L93 Difference]: Finished difference Result 111025 states and 123695 transitions. [2024-11-21 22:12:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 313 [2024-11-21 22:12:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:14,028 INFO L225 Difference]: With dead ends: 111025 [2024-11-21 22:12:14,028 INFO L226 Difference]: Without dead ends: 60245 [2024-11-21 22:12:14,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:14,063 INFO L432 NwaCegarLoop]: 1001 mSDtfsCounter, 726 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:14,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1177 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-21 22:12:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60245 states. [2024-11-21 22:12:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60245 to 59450. [2024-11-21 22:12:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59450 states, 59449 states have (on average 1.1065282847482716) internal successors, (65782), 59449 states have internal predecessors, (65782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59450 states to 59450 states and 65782 transitions. [2024-11-21 22:12:14,784 INFO L78 Accepts]: Start accepts. Automaton has 59450 states and 65782 transitions. Word has length 313 [2024-11-21 22:12:14,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:14,785 INFO L471 AbstractCegarLoop]: Abstraction has 59450 states and 65782 transitions. [2024-11-21 22:12:14,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 59450 states and 65782 transitions. [2024-11-21 22:12:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-21 22:12:14,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:14,790 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:12:14,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 22:12:14,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash -820854567, now seen corresponding path program 1 times [2024-11-21 22:12:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801605349] [2024-11-21 22:12:14,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 196 proven. 113 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 22:12:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801605349] [2024-11-21 22:12:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801605349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:12:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280531696] [2024-11-21 22:12:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:12:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:12:15,754 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-21 22:12:15,756 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-21 22:12:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:15,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:12:15,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:12:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-21 22:12:15,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:12:15,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280531696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:15,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:12:15,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-21 22:12:15,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170171839] [2024-11-21 22:12:15,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:15,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:15,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:15,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-21 22:12:15,982 INFO L87 Difference]: Start difference. First operand 59450 states and 65782 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:18,579 INFO L93 Difference]: Finished difference Result 118109 states and 130769 transitions. [2024-11-21 22:12:18,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:18,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 342 [2024-11-21 22:12:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:18,642 INFO L225 Difference]: With dead ends: 118109 [2024-11-21 22:12:18,642 INFO L226 Difference]: Without dead ends: 59448 [2024-11-21 22:12:18,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-21 22:12:18,677 INFO L432 NwaCegarLoop]: 1344 mSDtfsCounter, 1113 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1424 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.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:18,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1424 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-21 22:12:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59448 states. [2024-11-21 22:12:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59448 to 59447. [2024-11-21 22:12:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59447 states, 59446 states have (on average 1.0850015139790734) internal successors, (64499), 59446 states have internal predecessors, (64499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59447 states to 59447 states and 64499 transitions. [2024-11-21 22:12:19,148 INFO L78 Accepts]: Start accepts. Automaton has 59447 states and 64499 transitions. Word has length 342 [2024-11-21 22:12:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:19,149 INFO L471 AbstractCegarLoop]: Abstraction has 59447 states and 64499 transitions. [2024-11-21 22:12:19,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 59447 states and 64499 transitions. [2024-11-21 22:12:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-21 22:12:19,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:19,151 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:12:19,158 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-21 22:12:19,355 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-21 22:12:19,356 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:19,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1208469246, now seen corresponding path program 1 times [2024-11-21 22:12:19,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:19,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441708512] [2024-11-21 22:12:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-21 22:12:20,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:20,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441708512] [2024-11-21 22:12:20,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441708512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:20,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:12:20,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:12:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735162623] [2024-11-21 22:12:20,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:20,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:20,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:20,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:20,049 INFO L87 Difference]: Start difference. First operand 59447 states and 64499 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:23,104 INFO L93 Difference]: Finished difference Result 133075 states and 145734 transitions. [2024-11-21 22:12:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:23,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345 [2024-11-21 22:12:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:23,194 INFO L225 Difference]: With dead ends: 133075 [2024-11-21 22:12:23,194 INFO L226 Difference]: Without dead ends: 83085 [2024-11-21 22:12:23,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:23,310 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 951 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 3474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:23,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 795 Invalid, 3474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-21 22:12:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83085 states. [2024-11-21 22:12:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83085 to 83076. [2024-11-21 22:12:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83076 states, 83075 states have (on average 1.087896479085164) internal successors, (90377), 83075 states have internal predecessors, (90377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83076 states to 83076 states and 90377 transitions. [2024-11-21 22:12:23,999 INFO L78 Accepts]: Start accepts. Automaton has 83076 states and 90377 transitions. Word has length 345 [2024-11-21 22:12:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:23,999 INFO L471 AbstractCegarLoop]: Abstraction has 83076 states and 90377 transitions. [2024-11-21 22:12:23,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 83076 states and 90377 transitions. [2024-11-21 22:12:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-21 22:12:24,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:24,003 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-21 22:12:24,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 22:12:24,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:24,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1519622775, now seen corresponding path program 1 times [2024-11-21 22:12:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:24,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113035910] [2024-11-21 22:12:24,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-21 22:12:24,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:24,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113035910] [2024-11-21 22:12:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113035910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:24,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:12:24,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:12:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357264914] [2024-11-21 22:12:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:24,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:24,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:24,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:24,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:24,164 INFO L87 Difference]: Start difference. First operand 83076 states and 90377 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:27,210 INFO L93 Difference]: Finished difference Result 192128 states and 210608 transitions. [2024-11-21 22:12:27,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:27,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372 [2024-11-21 22:12:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:27,329 INFO L225 Difference]: With dead ends: 192128 [2024-11-21 22:12:27,329 INFO L226 Difference]: Without dead ends: 109841 [2024-11-21 22:12:27,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:27,371 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 884 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 930 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 930 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:27,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 904 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [930 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-21 22:12:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109841 states. [2024-11-21 22:12:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109841 to 107461. [2024-11-21 22:12:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107461 states, 107460 states have (on average 1.091531732737763) internal successors, (117296), 107460 states have internal predecessors, (117296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107461 states to 107461 states and 117296 transitions. [2024-11-21 22:12:28,835 INFO L78 Accepts]: Start accepts. Automaton has 107461 states and 117296 transitions. Word has length 372 [2024-11-21 22:12:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 107461 states and 117296 transitions. [2024-11-21 22:12:28,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 107461 states and 117296 transitions. [2024-11-21 22:12:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-21 22:12:28,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:28,840 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:12:28,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 22:12:28,840 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:28,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash -201282790, now seen corresponding path program 1 times [2024-11-21 22:12:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:28,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723294212] [2024-11-21 22:12:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:28,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-21 22:12:29,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:29,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723294212] [2024-11-21 22:12:29,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723294212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:29,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:12:29,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:12:29,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328700436] [2024-11-21 22:12:29,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:29,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:29,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:29,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:29,189 INFO L87 Difference]: Start difference. First operand 107461 states and 117296 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:33,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:33,220 INFO L93 Difference]: Finished difference Result 246489 states and 269698 transitions. [2024-11-21 22:12:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:33,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2024-11-21 22:12:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:33,504 INFO L225 Difference]: With dead ends: 246489 [2024-11-21 22:12:33,504 INFO L226 Difference]: Without dead ends: 139817 [2024-11-21 22:12:33,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:33,521 INFO L432 NwaCegarLoop]: 1728 mSDtfsCounter, 874 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:33,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1862 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 3093 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-21 22:12:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139817 states. [2024-11-21 22:12:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139817 to 138985. [2024-11-21 22:12:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138985 states, 138984 states have (on average 1.0857077073619985) internal successors, (150896), 138984 states have internal predecessors, (150896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138985 states to 138985 states and 150896 transitions. [2024-11-21 22:12:35,067 INFO L78 Accepts]: Start accepts. Automaton has 138985 states and 150896 transitions. Word has length 405 [2024-11-21 22:12:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:35,067 INFO L471 AbstractCegarLoop]: Abstraction has 138985 states and 150896 transitions. [2024-11-21 22:12:35,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 138985 states and 150896 transitions. [2024-11-21 22:12:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-21 22:12:35,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:35,075 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-11-21 22:12:35,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 22:12:35,075 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:35,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash 238883004, now seen corresponding path program 1 times [2024-11-21 22:12:35,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:35,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036196506] [2024-11-21 22:12:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-21 22:12:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:35,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036196506] [2024-11-21 22:12:35,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036196506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:35,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:12:35,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:12:35,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6957063] [2024-11-21 22:12:35,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:35,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:35,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:35,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:35,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:35,360 INFO L87 Difference]: Start difference. First operand 138985 states and 150896 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:38,899 INFO L93 Difference]: Finished difference Result 307106 states and 335125 transitions. [2024-11-21 22:12:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:38,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 410 [2024-11-21 22:12:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:39,293 INFO L225 Difference]: With dead ends: 307106 [2024-11-21 22:12:39,293 INFO L226 Difference]: Without dead ends: 166549 [2024-11-21 22:12:39,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:39,348 INFO L432 NwaCegarLoop]: 1745 mSDtfsCounter, 786 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:39,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1889 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [714 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-21 22:12:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166549 states. [2024-11-21 22:12:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166549 to 164954. [2024-11-21 22:12:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164954 states, 164953 states have (on average 1.0745727570883827) internal successors, (177254), 164953 states have internal predecessors, (177254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164954 states to 164954 states and 177254 transitions. [2024-11-21 22:12:41,250 INFO L78 Accepts]: Start accepts. Automaton has 164954 states and 177254 transitions. Word has length 410 [2024-11-21 22:12:41,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:41,250 INFO L471 AbstractCegarLoop]: Abstraction has 164954 states and 177254 transitions. [2024-11-21 22:12:41,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 164954 states and 177254 transitions. [2024-11-21 22:12:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-11-21 22:12:41,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:41,255 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:12:41,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 22:12:41,256 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:41,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash -93281513, now seen corresponding path program 1 times [2024-11-21 22:12:41,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:41,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270303697] [2024-11-21 22:12:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:41,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 268 proven. 110 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 22:12:42,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270303697] [2024-11-21 22:12:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270303697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:12:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084406126] [2024-11-21 22:12:42,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:42,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:12:42,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:12:42,439 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-21 22:12:42,439 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-21 22:12:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:42,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:12:42,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:12:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2024-11-21 22:12:42,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:12:42,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084406126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:42,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:12:42,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-21 22:12:42,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226429764] [2024-11-21 22:12:42,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:42,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:42,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:12:42,583 INFO L87 Difference]: Start difference. First operand 164954 states and 177254 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:45,599 INFO L93 Difference]: Finished difference Result 331489 states and 356083 transitions. [2024-11-21 22:12:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:45,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 432 [2024-11-21 22:12:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:45,816 INFO L225 Difference]: With dead ends: 331489 [2024-11-21 22:12:45,816 INFO L226 Difference]: Without dead ends: 167324 [2024-11-21 22:12:45,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:12:45,932 INFO L432 NwaCegarLoop]: 1400 mSDtfsCounter, 1021 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:45,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 1486 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-21 22:12:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167324 states. [2024-11-21 22:12:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167324 to 164161. [2024-11-21 22:12:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164161 states, 164160 states have (on average 1.0581079434697855) internal successors, (173699), 164160 states have internal predecessors, (173699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164161 states to 164161 states and 173699 transitions. [2024-11-21 22:12:47,965 INFO L78 Accepts]: Start accepts. Automaton has 164161 states and 173699 transitions. Word has length 432 [2024-11-21 22:12:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:47,965 INFO L471 AbstractCegarLoop]: Abstraction has 164161 states and 173699 transitions. [2024-11-21 22:12:47,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 164161 states and 173699 transitions. [2024-11-21 22:12:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-11-21 22:12:47,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:47,975 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:12:47,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 22:12:48,176 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,SelfDestructingSolverStorable14 [2024-11-21 22:12:48,176 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:48,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1634580838, now seen corresponding path program 1 times [2024-11-21 22:12:48,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:48,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769660317] [2024-11-21 22:12:48,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:48,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-21 22:12:48,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:48,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769660317] [2024-11-21 22:12:48,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769660317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:48,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:12:48,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:12:48,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40191572] [2024-11-21 22:12:48,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:48,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:48,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:48,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:48,426 INFO L87 Difference]: Start difference. First operand 164161 states and 173699 transitions. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:12:52,415 INFO L93 Difference]: Finished difference Result 398509 states and 422492 transitions. [2024-11-21 22:12:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:12:52,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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 485 [2024-11-21 22:12:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:12:52,710 INFO L225 Difference]: With dead ends: 398509 [2024-11-21 22:12:52,710 INFO L226 Difference]: Without dead ends: 235137 [2024-11-21 22:12:52,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:12:52,781 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 841 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2982 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-21 22:12:52,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 789 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2982 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-21 22:12:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235137 states. [2024-11-21 22:12:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235137 to 231087. [2024-11-21 22:12:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231087 states, 231086 states have (on average 1.0572600676804307) internal successors, (244318), 231086 states have internal predecessors, (244318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231087 states to 231087 states and 244318 transitions. [2024-11-21 22:12:55,683 INFO L78 Accepts]: Start accepts. Automaton has 231087 states and 244318 transitions. Word has length 485 [2024-11-21 22:12:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:12:55,684 INFO L471 AbstractCegarLoop]: Abstraction has 231087 states and 244318 transitions. [2024-11-21 22:12:55,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:12:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 231087 states and 244318 transitions. [2024-11-21 22:12:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-11-21 22:12:55,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:12:55,702 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:12:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 22:12:55,706 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:12:55,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:12:55,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1893946046, now seen corresponding path program 1 times [2024-11-21 22:12:55,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:12:55,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780498534] [2024-11-21 22:12:55,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:12:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 265 proven. 113 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 22:12:57,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:12:57,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780498534] [2024-11-21 22:12:57,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780498534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:12:57,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863440109] [2024-11-21 22:12:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:12:57,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:12:57,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:12:57,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:12:57,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 22:12:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:12:57,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 22:12:57,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:12:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-21 22:12:57,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:12:57,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863440109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:12:57,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:12:57,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-21 22:12:57,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900097616] [2024-11-21 22:12:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:12:57,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:12:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:12:57,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:12:57,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-21 22:12:57,794 INFO L87 Difference]: Start difference. First operand 231087 states and 244318 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)