./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label38.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 d34933a1b994b8e38d771072f952fdcb97af91d6a5c53e5f6f0249e635acf216 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:00:49,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:00:49,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:00:49,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:00:49,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:00:49,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:00:49,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:00:49,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:00:49,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:00:49,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:00:49,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:00:49,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:00:49,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:00:49,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:00:49,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:00:49,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:00:49,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:00:49,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:00:49,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:00:49,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:00:49,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:00:49,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:00:49,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:00:49,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:00:49,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:00:49,994 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:00:49,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:00:49,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:00:49,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:00:49,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:00:49,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:00:49,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:00:49,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:00:49,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:00:49,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:00:49,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:00:49,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:00:49,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:00:49,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:00:49,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:00:49,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:00:49,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:00:49,999 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 -> d34933a1b994b8e38d771072f952fdcb97af91d6a5c53e5f6f0249e635acf216 [2024-11-11 17:00:50,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:00:50,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:00:50,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:00:50,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:00:50,267 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:00:50,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label38.c [2024-11-11 17:00:51,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:00:52,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:00:52,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label38.c [2024-11-11 17:00:52,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18fdab2f2/662a0129cc364d66bc56597fc264eaca/FLAG609577d2a [2024-11-11 17:00:52,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18fdab2f2/662a0129cc364d66bc56597fc264eaca [2024-11-11 17:00:52,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:00:52,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:00:52,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:00:52,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:00:52,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:00:52,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:00:52" (1/1) ... [2024-11-11 17:00:52,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b4230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:52, skipping insertion in model container [2024-11-11 17:00:52,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:00:52" (1/1) ... [2024-11-11 17:00:52,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:00:52,695 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_label38.c[8378,8391] [2024-11-11 17:00:53,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:00:53,495 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:00:53,526 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_label38.c[8378,8391] [2024-11-11 17:00:54,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:00:54,053 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:00:54,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54 WrapperNode [2024-11-11 17:00:54,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:00:54,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:00:54,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:00:54,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:00:54,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:54,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:54,741 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-11 17:00:54,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:00:54,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:00:54,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:00:54,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:00:54,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:54,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:54,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:55,323 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 17:00:55,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:55,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:55,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:55,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:55,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:55,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:55,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:00:55,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:00:55,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:00:55,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:00:55,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (1/1) ... [2024-11-11 17:00:55,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:00:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:00:55,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 17:00:55,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 17:00:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:00:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:00:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:00:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:00:55,859 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:00:55,860 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:01:01,528 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-11 17:01:01,528 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:01:01,577 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:01:01,577 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:01:01,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:01:01 BoogieIcfgContainer [2024-11-11 17:01:01,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:01:01,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:01:01,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:01:01,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:01:01,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:00:52" (1/3) ... [2024-11-11 17:01:01,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9083c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:01:01, skipping insertion in model container [2024-11-11 17:01:01,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:54" (2/3) ... [2024-11-11 17:01:01,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9083c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:01:01, skipping insertion in model container [2024-11-11 17:01:01,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:01:01" (3/3) ... [2024-11-11 17:01:01,586 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label38.c [2024-11-11 17:01:01,602 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:01:01,603 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:01:01,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:01:01,739 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;@7dde7019, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:01:01,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:01:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 17:01:01,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:01,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:01,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:01,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 118092897, now seen corresponding path program 1 times [2024-11-11 17:01:01,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:01,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550749173] [2024-11-11 17:01:01,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:01,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:02,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550749173] [2024-11-11 17:01:02,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550749173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:02,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:02,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15661347] [2024-11-11 17:01:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:02,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:02,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:02,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:02,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:02,237 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 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:06,617 INFO L93 Difference]: Finished difference Result 3121 states and 5804 transitions. [2024-11-11 17:01:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:06,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-11 17:01:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:06,642 INFO L225 Difference]: With dead ends: 3121 [2024-11-11 17:01:06,642 INFO L226 Difference]: Without dead ends: 1944 [2024-11-11 17:01:06,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:06,656 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 930 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:06,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 575 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-11 17:01:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2024-11-11 17:01:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2024-11-11 17:01:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2024-11-11 17:01:06,776 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 59 [2024-11-11 17:01:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:06,777 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2024-11-11 17:01:06,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2024-11-11 17:01:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 17:01:06,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:06,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:01:06,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:01:06,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:06,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1340601606, now seen corresponding path program 1 times [2024-11-11 17:01:06,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:06,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542419014] [2024-11-11 17:01:06,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:06,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:07,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:07,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542419014] [2024-11-11 17:01:07,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542419014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:07,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:07,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:07,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100778961] [2024-11-11 17:01:07,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:07,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:07,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:07,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:07,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:07,156 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:10,558 INFO L93 Difference]: Finished difference Result 5351 states and 9369 transitions. [2024-11-11 17:01:10,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:10,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-11 17:01:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:10,573 INFO L225 Difference]: With dead ends: 5351 [2024-11-11 17:01:10,573 INFO L226 Difference]: Without dead ends: 3480 [2024-11-11 17:01:10,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:10,579 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:10,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1079 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 17:01:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2024-11-11 17:01:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3479. [2024-11-11 17:01:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5282 transitions. [2024-11-11 17:01:10,644 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5282 transitions. Word has length 124 [2024-11-11 17:01:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:10,646 INFO L471 AbstractCegarLoop]: Abstraction has 3479 states and 5282 transitions. [2024-11-11 17:01:10,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5282 transitions. [2024-11-11 17:01:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 17:01:10,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:10,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:01:10,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:01:10,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 473644895, now seen corresponding path program 1 times [2024-11-11 17:01:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462540813] [2024-11-11 17:01:10,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462540813] [2024-11-11 17:01:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462540813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:10,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:10,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199559999] [2024-11-11 17:01:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:10,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:10,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:10,928 INFO L87 Difference]: Start difference. First operand 3479 states and 5282 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:14,321 INFO L93 Difference]: Finished difference Result 10142 states and 15438 transitions. [2024-11-11 17:01:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:14,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-11-11 17:01:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:14,350 INFO L225 Difference]: With dead ends: 10142 [2024-11-11 17:01:14,350 INFO L226 Difference]: Without dead ends: 6665 [2024-11-11 17:01:14,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:14,359 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:14,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 877 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 17:01:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2024-11-11 17:01:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6657. [2024-11-11 17:01:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6656 states have (on average 1.3728966346153846) internal successors, (9138), 6656 states have internal predecessors, (9138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 9138 transitions. [2024-11-11 17:01:14,506 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 9138 transitions. Word has length 126 [2024-11-11 17:01:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:14,508 INFO L471 AbstractCegarLoop]: Abstraction has 6657 states and 9138 transitions. [2024-11-11 17:01:14,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 9138 transitions. [2024-11-11 17:01:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 17:01:14,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:14,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:01:14,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:01:14,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:14,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1017971122, now seen corresponding path program 1 times [2024-11-11 17:01:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:14,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378444114] [2024-11-11 17:01:14,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:14,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378444114] [2024-11-11 17:01:14,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378444114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:14,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:14,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:14,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260336892] [2024-11-11 17:01:14,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:14,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:14,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:14,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:14,703 INFO L87 Difference]: Start difference. First operand 6657 states and 9138 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:17,622 INFO L93 Difference]: Finished difference Result 19637 states and 26969 transitions. [2024-11-11 17:01:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:17,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-11-11 17:01:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:17,668 INFO L225 Difference]: With dead ends: 19637 [2024-11-11 17:01:17,669 INFO L226 Difference]: Without dead ends: 12982 [2024-11-11 17:01:17,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:17,685 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 791 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:17,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1163 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 17:01:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12982 states. [2024-11-11 17:01:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12982 to 12175. [2024-11-11 17:01:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12175 states, 12174 states have (on average 1.2529160505996386) internal successors, (15253), 12174 states have internal predecessors, (15253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12175 states to 12175 states and 15253 transitions. [2024-11-11 17:01:17,892 INFO L78 Accepts]: Start accepts. Automaton has 12175 states and 15253 transitions. Word has length 132 [2024-11-11 17:01:17,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:17,892 INFO L471 AbstractCegarLoop]: Abstraction has 12175 states and 15253 transitions. [2024-11-11 17:01:17,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 12175 states and 15253 transitions. [2024-11-11 17:01:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-11 17:01:17,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:17,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:17,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:01:17,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:17,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash 96858422, now seen corresponding path program 1 times [2024-11-11 17:01:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:17,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602496706] [2024-11-11 17:01:17,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:18,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:18,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602496706] [2024-11-11 17:01:18,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602496706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:18,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:18,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665919766] [2024-11-11 17:01:18,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:18,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:18,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:18,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:18,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:18,227 INFO L87 Difference]: Start difference. First operand 12175 states and 15253 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:21,605 INFO L93 Difference]: Finished difference Result 25135 states and 31306 transitions. [2024-11-11 17:01:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-11-11 17:01:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:21,631 INFO L225 Difference]: With dead ends: 25135 [2024-11-11 17:01:21,631 INFO L226 Difference]: Without dead ends: 12962 [2024-11-11 17:01:21,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:21,645 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:21,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1212 Invalid, 2529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 17:01:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12962 states. [2024-11-11 17:01:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12962 to 12962. [2024-11-11 17:01:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12961 states have (on average 1.2379446030398888) internal successors, (16045), 12961 states have internal predecessors, (16045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 16045 transitions. [2024-11-11 17:01:21,832 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 16045 transitions. Word has length 148 [2024-11-11 17:01:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:21,833 INFO L471 AbstractCegarLoop]: Abstraction has 12962 states and 16045 transitions. [2024-11-11 17:01:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 16045 transitions. [2024-11-11 17:01:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-11 17:01:21,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:21,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:01:21,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:01:21,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:21,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash -486892641, now seen corresponding path program 1 times [2024-11-11 17:01:21,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:21,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681732342] [2024-11-11 17:01:21,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:21,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:21,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681732342] [2024-11-11 17:01:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681732342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:21,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:21,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222710041] [2024-11-11 17:01:21,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:21,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:21,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:21,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:21,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:21,972 INFO L87 Difference]: Start difference. First operand 12962 states and 16045 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:25,291 INFO L93 Difference]: Finished difference Result 31448 states and 39970 transitions. [2024-11-11 17:01:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:25,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-11-11 17:01:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:25,324 INFO L225 Difference]: With dead ends: 31448 [2024-11-11 17:01:25,324 INFO L226 Difference]: Without dead ends: 19275 [2024-11-11 17:01:25,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:25,336 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 904 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:25,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 957 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 17:01:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19275 states. [2024-11-11 17:01:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19275 to 18478. [2024-11-11 17:01:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18478 states, 18477 states have (on average 1.2248200465443524) internal successors, (22631), 18477 states have internal predecessors, (22631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18478 states to 18478 states and 22631 transitions. [2024-11-11 17:01:25,554 INFO L78 Accepts]: Start accepts. Automaton has 18478 states and 22631 transitions. Word has length 155 [2024-11-11 17:01:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:25,554 INFO L471 AbstractCegarLoop]: Abstraction has 18478 states and 22631 transitions. [2024-11-11 17:01:25,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18478 states and 22631 transitions. [2024-11-11 17:01:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-11 17:01:25,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:25,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:25,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:01:25,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:25,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1558430792, now seen corresponding path program 1 times [2024-11-11 17:01:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:25,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647540295] [2024-11-11 17:01:25,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-11 17:01:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:25,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647540295] [2024-11-11 17:01:25,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647540295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:25,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:25,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:25,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286902505] [2024-11-11 17:01:25,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:25,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:25,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:25,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:25,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:25,752 INFO L87 Difference]: Start difference. First operand 18478 states and 22631 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:29,165 INFO L93 Difference]: Finished difference Result 42487 states and 53153 transitions. [2024-11-11 17:01:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:29,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2024-11-11 17:01:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:29,206 INFO L225 Difference]: With dead ends: 42487 [2024-11-11 17:01:29,207 INFO L226 Difference]: Without dead ends: 24798 [2024-11-11 17:01:29,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:29,231 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 991 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 3412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:29,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 795 Invalid, 3412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1023 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 17:01:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2024-11-11 17:01:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 24786. [2024-11-11 17:01:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24786 states, 24785 states have (on average 1.230260238047206) internal successors, (30492), 24785 states have internal predecessors, (30492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24786 states to 24786 states and 30492 transitions. [2024-11-11 17:01:29,722 INFO L78 Accepts]: Start accepts. Automaton has 24786 states and 30492 transitions. Word has length 244 [2024-11-11 17:01:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:29,723 INFO L471 AbstractCegarLoop]: Abstraction has 24786 states and 30492 transitions. [2024-11-11 17:01:29,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 24786 states and 30492 transitions. [2024-11-11 17:01:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-11 17:01:29,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:29,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:29,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:01:29,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:29,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1718315709, now seen corresponding path program 1 times [2024-11-11 17:01:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488570469] [2024-11-11 17:01:29,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:30,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:30,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488570469] [2024-11-11 17:01:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488570469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:30,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:30,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727229792] [2024-11-11 17:01:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:30,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:01:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:30,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:01:30,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:01:30,222 INFO L87 Difference]: Start difference. First operand 24786 states and 30492 transitions. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:34,816 INFO L93 Difference]: Finished difference Result 73224 states and 90680 transitions. [2024-11-11 17:01:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:01:34,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 321 [2024-11-11 17:01:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:34,878 INFO L225 Difference]: With dead ends: 73224 [2024-11-11 17:01:34,878 INFO L226 Difference]: Without dead ends: 49227 [2024-11-11 17:01:34,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:01:34,901 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 2244 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 3987 mSolverCounterSat, 826 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2244 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 4813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 826 IncrementalHoareTripleChecker+Valid, 3987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:34,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2244 Valid, 757 Invalid, 4813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [826 Valid, 3987 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-11 17:01:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49227 states. [2024-11-11 17:01:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49227 to 49213. [2024-11-11 17:01:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49213 states, 49212 states have (on average 1.2029992684711046) internal successors, (59202), 49212 states have internal predecessors, (59202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49213 states to 49213 states and 59202 transitions. [2024-11-11 17:01:35,395 INFO L78 Accepts]: Start accepts. Automaton has 49213 states and 59202 transitions. Word has length 321 [2024-11-11 17:01:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:35,396 INFO L471 AbstractCegarLoop]: Abstraction has 49213 states and 59202 transitions. [2024-11-11 17:01:35,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 49213 states and 59202 transitions. [2024-11-11 17:01:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-11 17:01:35,404 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:35,404 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:35,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:01:35,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:35,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1612041382, now seen corresponding path program 1 times [2024-11-11 17:01:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990937026] [2024-11-11 17:01:35,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-11 17:01:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990937026] [2024-11-11 17:01:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990937026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:35,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145853743] [2024-11-11 17:01:35,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:35,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:01:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:01:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:01:35,736 INFO L87 Difference]: Start difference. First operand 49213 states and 59202 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:42,594 INFO L93 Difference]: Finished difference Result 138783 states and 168389 transitions. [2024-11-11 17:01:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:01:42,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2024-11-11 17:01:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:42,711 INFO L225 Difference]: With dead ends: 138783 [2024-11-11 17:01:42,712 INFO L226 Difference]: Without dead ends: 90359 [2024-11-11 17:01:42,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:01:42,762 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1710 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 7205 mSolverCounterSat, 979 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 8184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 979 IncrementalHoareTripleChecker+Valid, 7205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:42,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 1141 Invalid, 8184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [979 Valid, 7205 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-11 17:01:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90359 states. [2024-11-11 17:01:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90359 to 90227. [2024-11-11 17:01:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90227 states, 90226 states have (on average 1.1907099949016913) internal successors, (107433), 90226 states have internal predecessors, (107433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90227 states to 90227 states and 107433 transitions. [2024-11-11 17:01:44,254 INFO L78 Accepts]: Start accepts. Automaton has 90227 states and 107433 transitions. Word has length 347 [2024-11-11 17:01:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:44,255 INFO L471 AbstractCegarLoop]: Abstraction has 90227 states and 107433 transitions. [2024-11-11 17:01:44,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 90227 states and 107433 transitions. [2024-11-11 17:01:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-11 17:01:44,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:44,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:44,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:01:44,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:44,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2079155787, now seen corresponding path program 1 times [2024-11-11 17:01:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:44,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720346439] [2024-11-11 17:01:44,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:44,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 127 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:45,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720346439] [2024-11-11 17:01:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720346439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:01:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746348126] [2024-11-11 17:01:45,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:45,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:01:45,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:01:45,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:01:45,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 17:01:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:45,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 17:01:45,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:01:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-11 17:01:46,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:01:46,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746348126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:46,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:01:46,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-11 17:01:46,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789488166] [2024-11-11 17:01:46,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:46,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:46,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:46,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:46,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:01:46,815 INFO L87 Difference]: Start difference. First operand 90227 states and 107433 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:49,721 INFO L93 Difference]: Finished difference Result 167867 states and 201412 transitions. [2024-11-11 17:01:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:49,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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 350 [2024-11-11 17:01:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:49,933 INFO L225 Difference]: With dead ends: 167867 [2024-11-11 17:01:49,934 INFO L226 Difference]: Without dead ends: 93390 [2024-11-11 17:01:49,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:01:49,992 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 643 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:49,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1225 Invalid, 2616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 17:01:50,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93390 states. [2024-11-11 17:01:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93390 to 91801. [2024-11-11 17:01:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91801 states, 91800 states have (on average 1.187875816993464) internal successors, (109047), 91800 states have internal predecessors, (109047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91801 states to 91801 states and 109047 transitions. [2024-11-11 17:01:51,362 INFO L78 Accepts]: Start accepts. Automaton has 91801 states and 109047 transitions. Word has length 350 [2024-11-11 17:01:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:51,362 INFO L471 AbstractCegarLoop]: Abstraction has 91801 states and 109047 transitions. [2024-11-11 17:01:51,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 91801 states and 109047 transitions. [2024-11-11 17:01:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-11 17:01:51,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:51,371 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:51,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 17:01:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 17:01:51,576 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:51,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash -758867451, now seen corresponding path program 1 times [2024-11-11 17:01:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756488403] [2024-11-11 17:01:51,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:51,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-11 17:01:52,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:52,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756488403] [2024-11-11 17:01:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756488403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:52,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:52,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:52,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085636677] [2024-11-11 17:01:52,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:52,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:52,339 INFO L87 Difference]: Start difference. First operand 91801 states and 109047 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:56,149 INFO L93 Difference]: Finished difference Result 182817 states and 217312 transitions. [2024-11-11 17:01:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:56,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2024-11-11 17:01:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:56,273 INFO L225 Difference]: With dead ends: 182817 [2024-11-11 17:01:56,273 INFO L226 Difference]: Without dead ends: 91805 [2024-11-11 17:01:56,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:56,300 INFO L435 NwaCegarLoop]: 1425 mSDtfsCounter, 954 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 614 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:56,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1520 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [614 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 17:01:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91805 states. [2024-11-11 17:01:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91805 to 91793. [2024-11-11 17:01:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91793 states, 91792 states have (on average 1.1373431235837546) internal successors, (104399), 91792 states have internal predecessors, (104399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91793 states to 91793 states and 104399 transitions. [2024-11-11 17:01:57,438 INFO L78 Accepts]: Start accepts. Automaton has 91793 states and 104399 transitions. Word has length 408 [2024-11-11 17:01:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:57,438 INFO L471 AbstractCegarLoop]: Abstraction has 91793 states and 104399 transitions. [2024-11-11 17:01:57,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 91793 states and 104399 transitions. [2024-11-11 17:01:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-11-11 17:01:57,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:57,447 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:57,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:01:57,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:57,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1585784281, now seen corresponding path program 1 times [2024-11-11 17:01:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140811853] [2024-11-11 17:01:57,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-11-11 17:01:58,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140811853] [2024-11-11 17:01:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140811853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:58,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:58,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:58,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841690579] [2024-11-11 17:01:58,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:58,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:58,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:58,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:58,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:58,191 INFO L87 Difference]: Start difference. First operand 91793 states and 104399 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:02:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:02:01,796 INFO L93 Difference]: Finished difference Result 167847 states and 192292 transitions. [2024-11-11 17:02:01,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:02:01,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 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-11 17:02:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:02:01,913 INFO L225 Difference]: With dead ends: 167847 [2024-11-11 17:02:01,913 INFO L226 Difference]: Without dead ends: 91804 [2024-11-11 17:02:01,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:02:01,956 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 725 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:02:01,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1234 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 17:02:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91804 states. [2024-11-11 17:02:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91804 to 91793. [2024-11-11 17:02:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91793 states, 91792 states have (on average 1.1367984138051246) internal successors, (104349), 91792 states have internal predecessors, (104349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:02:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91793 states to 91793 states and 104349 transitions. [2024-11-11 17:02:03,201 INFO L78 Accepts]: Start accepts. Automaton has 91793 states and 104349 transitions. Word has length 432 [2024-11-11 17:02:03,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:02:03,201 INFO L471 AbstractCegarLoop]: Abstraction has 91793 states and 104349 transitions. [2024-11-11 17:02:03,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:02:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 91793 states and 104349 transitions. [2024-11-11 17:02:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-11-11 17:02:03,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:02:03,209 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:02:03,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:02:03,209 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:02:03,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:02:03,210 INFO L85 PathProgramCache]: Analyzing trace with hash 980121630, now seen corresponding path program 1 times [2024-11-11 17:02:03,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:02:03,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913005765] [2024-11-11 17:02:03,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:02:03,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:02:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:02:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-11 17:02:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:02:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913005765] [2024-11-11 17:02:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913005765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:02:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:02:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:02:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238786869] [2024-11-11 17:02:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:02:03,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:02:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:02:03,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:02:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:02:03,415 INFO L87 Difference]: Start difference. First operand 91793 states and 104349 transitions. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)