./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.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 d9dc4c1afb888b23c0ebc469c8090d62842d0a0c5570d5e56681453b5bd49afb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:53:16,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:53:17,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:53:17,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:53:17,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:53:17,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:53:17,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:53:17,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:53:17,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:53:17,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:53:17,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:53:17,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:53:17,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:53:17,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:53:17,076 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:53:17,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:53:17,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:53:17,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:53:17,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:53:17,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:53:17,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:53:17,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:53:17,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:53:17,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:53:17,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:53:17,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:53:17,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:53:17,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:53:17,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:53:17,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:53:17,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:53:17,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:53:17,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:53:17,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:53:17,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:53:17,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:53:17,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:53:17,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:53:17,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:53:17,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:53:17,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:53:17,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:53:17,086 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 -> d9dc4c1afb888b23c0ebc469c8090d62842d0a0c5570d5e56681453b5bd49afb [2024-10-14 03:53:17,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:53:17,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:53:17,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:53:17,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:53:17,388 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:53:17,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2024-10-14 03:53:18,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:53:19,163 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:53:19,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2024-10-14 03:53:19,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57597d8c1/ff3970b6c73642949b3556d08f40f349/FLAG16ed87434 [2024-10-14 03:53:19,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57597d8c1/ff3970b6c73642949b3556d08f40f349 [2024-10-14 03:53:19,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:53:19,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:53:19,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:53:19,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:53:19,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:53:19,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:53:19" (1/1) ... [2024-10-14 03:53:19,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de5d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:19, skipping insertion in model container [2024-10-14 03:53:19,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:53:19" (1/1) ... [2024-10-14 03:53:19,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:53:19,859 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[15364,15377] [2024-10-14 03:53:19,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:53:19,995 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:53:20,143 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[15364,15377] [2024-10-14 03:53:20,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:53:20,229 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:53:20,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20 WrapperNode [2024-10-14 03:53:20,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:53:20,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:53:20,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:53:20,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:53:20,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,326 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1712 [2024-10-14 03:53:20,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:53:20,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:53:20,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:53:20,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:53:20,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,389 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-10-14 03:53:20,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,407 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:53:20,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:53:20,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:53:20,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:53:20,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (1/1) ... [2024-10-14 03:53:20,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:53:20,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:53:20,493 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-10-14 03:53:20,500 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-10-14 03:53:20,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:53:20,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:53:20,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:53:20,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:53:20,722 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:53:20,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:53:22,173 INFO L? ?]: Removed 222 outVars from TransFormulas that were not future-live. [2024-10-14 03:53:22,173 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:53:22,258 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:53:22,258 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:53:22,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:53:22 BoogieIcfgContainer [2024-10-14 03:53:22,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:53:22,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:53:22,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:53:22,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:53:22,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:53:19" (1/3) ... [2024-10-14 03:53:22,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2c0883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:53:22, skipping insertion in model container [2024-10-14 03:53:22,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:20" (2/3) ... [2024-10-14 03:53:22,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2c0883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:53:22, skipping insertion in model container [2024-10-14 03:53:22,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:53:22" (3/3) ... [2024-10-14 03:53:22,274 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2024-10-14 03:53:22,291 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:53:22,292 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:53:22,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:53:22,400 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;@28628ddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:53:22,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:53:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 485 states, 483 states have (on average 1.6521739130434783) internal successors, (798), 484 states have internal predecessors, (798), 0 states have call successors, (0), 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-10-14 03:53:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 03:53:22,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:22,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:22,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:22,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1339861744, now seen corresponding path program 1 times [2024-10-14 03:53:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:22,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248552989] [2024-10-14 03:53:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248552989] [2024-10-14 03:53:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248552989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:23,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:23,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:53:23,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224733043] [2024-10-14 03:53:23,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:23,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:53:23,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:23,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:53:23,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:53:23,129 INFO L87 Difference]: Start difference. First operand has 485 states, 483 states have (on average 1.6521739130434783) internal successors, (798), 484 states have internal predecessors, (798), 0 states have call successors, (0), 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 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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-10-14 03:53:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:23,345 INFO L93 Difference]: Finished difference Result 929 states and 1514 transitions. [2024-10-14 03:53:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:53:23,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-14 03:53:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:23,364 INFO L225 Difference]: With dead ends: 929 [2024-10-14 03:53:23,364 INFO L226 Difference]: Without dead ends: 483 [2024-10-14 03:53:23,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:53:23,372 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 175 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:23,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 2144 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:53:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-14 03:53:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2024-10-14 03:53:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.549792531120332) internal successors, (747), 482 states have internal predecessors, (747), 0 states have call successors, (0), 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-10-14 03:53:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 747 transitions. [2024-10-14 03:53:23,436 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 747 transitions. Word has length 118 [2024-10-14 03:53:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:23,436 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 747 transitions. [2024-10-14 03:53:23,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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-10-14 03:53:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 747 transitions. [2024-10-14 03:53:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 03:53:23,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:23,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:23,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:53:23,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:23,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1644038239, now seen corresponding path program 1 times [2024-10-14 03:53:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:23,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511043617] [2024-10-14 03:53:23,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511043617] [2024-10-14 03:53:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511043617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157721436] [2024-10-14 03:53:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:23,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:23,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:23,660 INFO L87 Difference]: Start difference. First operand 483 states and 747 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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-10-14 03:53:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:23,729 INFO L93 Difference]: Finished difference Result 1158 states and 1826 transitions. [2024-10-14 03:53:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:23,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-14 03:53:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:23,734 INFO L225 Difference]: With dead ends: 1158 [2024-10-14 03:53:23,734 INFO L226 Difference]: Without dead ends: 745 [2024-10-14 03:53:23,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:23,737 INFO L432 NwaCegarLoop]: 882 mSDtfsCounter, 505 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:23,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1484 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:53:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-10-14 03:53:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 743. [2024-10-14 03:53:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.5633423180592991) internal successors, (1160), 742 states have internal predecessors, (1160), 0 states have call successors, (0), 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-10-14 03:53:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1160 transitions. [2024-10-14 03:53:23,782 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1160 transitions. Word has length 158 [2024-10-14 03:53:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:23,783 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1160 transitions. [2024-10-14 03:53:23,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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-10-14 03:53:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1160 transitions. [2024-10-14 03:53:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 03:53:23,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:23,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:23,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:53:23,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:23,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:23,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1874537501, now seen corresponding path program 1 times [2024-10-14 03:53:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:23,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943890719] [2024-10-14 03:53:23,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:23,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:23,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943890719] [2024-10-14 03:53:23,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943890719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:23,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679238648] [2024-10-14 03:53:23,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:23,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:23,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:23,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:23,976 INFO L87 Difference]: Start difference. First operand 743 states and 1160 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-10-14 03:53:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:24,043 INFO L93 Difference]: Finished difference Result 1862 states and 2946 transitions. [2024-10-14 03:53:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-10-14 03:53:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:24,050 INFO L225 Difference]: With dead ends: 1862 [2024-10-14 03:53:24,050 INFO L226 Difference]: Without dead ends: 1202 [2024-10-14 03:53:24,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:24,056 INFO L432 NwaCegarLoop]: 723 mSDtfsCounter, 491 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:24,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1300 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2024-10-14 03:53:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2024-10-14 03:53:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1199 states have (on average 1.5713094245204338) internal successors, (1884), 1199 states have internal predecessors, (1884), 0 states have call successors, (0), 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-10-14 03:53:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1884 transitions. [2024-10-14 03:53:24,094 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1884 transitions. Word has length 160 [2024-10-14 03:53:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:24,095 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1884 transitions. [2024-10-14 03:53:24,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-10-14 03:53:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1884 transitions. [2024-10-14 03:53:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 03:53:24,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:24,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:24,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:53:24,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:24,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1620868229, now seen corresponding path program 1 times [2024-10-14 03:53:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:24,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130959893] [2024-10-14 03:53:24,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:24,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:24,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130959893] [2024-10-14 03:53:24,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130959893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:24,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:24,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:24,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035414879] [2024-10-14 03:53:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:24,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:24,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:24,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:24,226 INFO L87 Difference]: Start difference. First operand 1200 states and 1884 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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-10-14 03:53:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:24,296 INFO L93 Difference]: Finished difference Result 3089 states and 4889 transitions. [2024-10-14 03:53:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:24,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-10-14 03:53:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:24,306 INFO L225 Difference]: With dead ends: 3089 [2024-10-14 03:53:24,307 INFO L226 Difference]: Without dead ends: 1985 [2024-10-14 03:53:24,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:24,311 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 476 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:24,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1265 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2024-10-14 03:53:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1983. [2024-10-14 03:53:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1982 states have (on average 1.5731584258324924) internal successors, (3118), 1982 states have internal predecessors, (3118), 0 states have call successors, (0), 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-10-14 03:53:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 3118 transitions. [2024-10-14 03:53:24,364 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 3118 transitions. Word has length 162 [2024-10-14 03:53:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:24,364 INFO L471 AbstractCegarLoop]: Abstraction has 1983 states and 3118 transitions. [2024-10-14 03:53:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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-10-14 03:53:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 3118 transitions. [2024-10-14 03:53:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 03:53:24,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:24,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:24,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:53:24,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:24,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:24,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1849273371, now seen corresponding path program 1 times [2024-10-14 03:53:24,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:24,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307651803] [2024-10-14 03:53:24,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:24,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:24,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307651803] [2024-10-14 03:53:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307651803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:24,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987329857] [2024-10-14 03:53:24,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:24,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:24,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:24,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:24,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:24,515 INFO L87 Difference]: Start difference. First operand 1983 states and 3118 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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-10-14 03:53:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:24,596 INFO L93 Difference]: Finished difference Result 5158 states and 8142 transitions. [2024-10-14 03:53:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:24,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2024-10-14 03:53:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:24,609 INFO L225 Difference]: With dead ends: 5158 [2024-10-14 03:53:24,610 INFO L226 Difference]: Without dead ends: 3284 [2024-10-14 03:53:24,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:24,616 INFO L432 NwaCegarLoop]: 852 mSDtfsCounter, 460 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:24,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1379 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2024-10-14 03:53:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 3282. [2024-10-14 03:53:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 3281 states have (on average 1.56903383114904) internal successors, (5148), 3281 states have internal predecessors, (5148), 0 states have call successors, (0), 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-10-14 03:53:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 5148 transitions. [2024-10-14 03:53:24,709 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 5148 transitions. Word has length 164 [2024-10-14 03:53:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:24,709 INFO L471 AbstractCegarLoop]: Abstraction has 3282 states and 5148 transitions. [2024-10-14 03:53:24,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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-10-14 03:53:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 5148 transitions. [2024-10-14 03:53:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 03:53:24,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:24,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:53:24,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:24,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1627398147, now seen corresponding path program 1 times [2024-10-14 03:53:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454126094] [2024-10-14 03:53:24,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:24,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:24,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:24,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454126094] [2024-10-14 03:53:24,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454126094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:24,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:24,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174562328] [2024-10-14 03:53:24,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:24,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:24,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:24,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:24,854 INFO L87 Difference]: Start difference. First operand 3282 states and 5148 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:24,970 INFO L93 Difference]: Finished difference Result 8503 states and 13343 transitions. [2024-10-14 03:53:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:24,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-10-14 03:53:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:24,991 INFO L225 Difference]: With dead ends: 8503 [2024-10-14 03:53:24,992 INFO L226 Difference]: Without dead ends: 5343 [2024-10-14 03:53:24,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:24,999 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 445 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:25,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1344 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2024-10-14 03:53:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 5341. [2024-10-14 03:53:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5341 states, 5340 states have (on average 1.5584269662921348) internal successors, (8322), 5340 states have internal predecessors, (8322), 0 states have call successors, (0), 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-10-14 03:53:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5341 states to 5341 states and 8322 transitions. [2024-10-14 03:53:25,157 INFO L78 Accepts]: Start accepts. Automaton has 5341 states and 8322 transitions. Word has length 166 [2024-10-14 03:53:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:25,158 INFO L471 AbstractCegarLoop]: Abstraction has 5341 states and 8322 transitions. [2024-10-14 03:53:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5341 states and 8322 transitions. [2024-10-14 03:53:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 03:53:25,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:25,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:25,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:53:25,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:25,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1652814419, now seen corresponding path program 1 times [2024-10-14 03:53:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935309405] [2024-10-14 03:53:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:25,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:25,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935309405] [2024-10-14 03:53:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935309405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:25,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:53:25,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79563168] [2024-10-14 03:53:25,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:25,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:53:25,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:25,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:53:25,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:53:25,487 INFO L87 Difference]: Start difference. First operand 5341 states and 8322 transitions. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 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-10-14 03:53:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:26,059 INFO L93 Difference]: Finished difference Result 36364 states and 56592 transitions. [2024-10-14 03:53:26,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:53:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-14 03:53:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:26,160 INFO L225 Difference]: With dead ends: 36364 [2024-10-14 03:53:26,161 INFO L226 Difference]: Without dead ends: 31149 [2024-10-14 03:53:26,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:53:26,186 INFO L432 NwaCegarLoop]: 696 mSDtfsCounter, 8353 mSDsluCounter, 6304 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8353 SdHoareTripleChecker+Valid, 7000 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:26,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8353 Valid, 7000 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31149 states. [2024-10-14 03:53:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31149 to 10624. [2024-10-14 03:53:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10624 states, 10623 states have (on average 1.5424079826790926) internal successors, (16385), 10623 states have internal predecessors, (16385), 0 states have call successors, (0), 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-10-14 03:53:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10624 states to 10624 states and 16385 transitions. [2024-10-14 03:53:26,816 INFO L78 Accepts]: Start accepts. Automaton has 10624 states and 16385 transitions. Word has length 168 [2024-10-14 03:53:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:26,817 INFO L471 AbstractCegarLoop]: Abstraction has 10624 states and 16385 transitions. [2024-10-14 03:53:26,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 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-10-14 03:53:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 10624 states and 16385 transitions. [2024-10-14 03:53:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 03:53:26,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:26,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:26,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:53:26,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:26,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash 711034943, now seen corresponding path program 1 times [2024-10-14 03:53:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728118765] [2024-10-14 03:53:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:26,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:26,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728118765] [2024-10-14 03:53:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728118765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:26,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589268130] [2024-10-14 03:53:26,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:26,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:26,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:26,954 INFO L87 Difference]: Start difference. First operand 10624 states and 16385 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-10-14 03:53:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:27,079 INFO L93 Difference]: Finished difference Result 30000 states and 46187 transitions. [2024-10-14 03:53:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:27,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-10-14 03:53:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:27,119 INFO L225 Difference]: With dead ends: 30000 [2024-10-14 03:53:27,119 INFO L226 Difference]: Without dead ends: 19428 [2024-10-14 03:53:27,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:27,143 INFO L432 NwaCegarLoop]: 993 mSDtfsCounter, 501 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:27,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1592 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19428 states. [2024-10-14 03:53:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19428 to 19426. [2024-10-14 03:53:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19426 states, 19425 states have (on average 1.5303989703989704) internal successors, (29728), 19425 states have internal predecessors, (29728), 0 states have call successors, (0), 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-10-14 03:53:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19426 states to 19426 states and 29728 transitions. [2024-10-14 03:53:27,712 INFO L78 Accepts]: Start accepts. Automaton has 19426 states and 29728 transitions. Word has length 171 [2024-10-14 03:53:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:27,713 INFO L471 AbstractCegarLoop]: Abstraction has 19426 states and 29728 transitions. [2024-10-14 03:53:27,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-10-14 03:53:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 19426 states and 29728 transitions. [2024-10-14 03:53:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 03:53:27,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:27,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:27,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:53:27,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:27,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2091915126, now seen corresponding path program 1 times [2024-10-14 03:53:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351062065] [2024-10-14 03:53:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:27,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351062065] [2024-10-14 03:53:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351062065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:27,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258373032] [2024-10-14 03:53:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:27,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:27,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:27,961 INFO L87 Difference]: Start difference. First operand 19426 states and 29728 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:28,162 INFO L93 Difference]: Finished difference Result 55496 states and 84709 transitions. [2024-10-14 03:53:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-10-14 03:53:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:28,237 INFO L225 Difference]: With dead ends: 55496 [2024-10-14 03:53:28,237 INFO L226 Difference]: Without dead ends: 36970 [2024-10-14 03:53:28,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:28,275 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 496 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:28,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1315 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36970 states. [2024-10-14 03:53:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36970 to 36968. [2024-10-14 03:53:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36968 states, 36967 states have (on average 1.5174615197338166) internal successors, (56096), 36967 states have internal predecessors, (56096), 0 states have call successors, (0), 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-10-14 03:53:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36968 states to 36968 states and 56096 transitions. [2024-10-14 03:53:29,092 INFO L78 Accepts]: Start accepts. Automaton has 36968 states and 56096 transitions. Word has length 172 [2024-10-14 03:53:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:29,094 INFO L471 AbstractCegarLoop]: Abstraction has 36968 states and 56096 transitions. [2024-10-14 03:53:29,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 36968 states and 56096 transitions. [2024-10-14 03:53:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 03:53:29,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:29,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:29,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:53:29,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1788707941, now seen corresponding path program 1 times [2024-10-14 03:53:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:29,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453897320] [2024-10-14 03:53:29,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:29,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:29,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453897320] [2024-10-14 03:53:29,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453897320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:29,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:29,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:53:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117757826] [2024-10-14 03:53:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:29,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:53:29,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:29,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:53:29,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:53:29,815 INFO L87 Difference]: Start difference. First operand 36968 states and 56096 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:31,207 INFO L93 Difference]: Finished difference Result 157406 states and 235700 transitions. [2024-10-14 03:53:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:53:31,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-10-14 03:53:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:31,557 INFO L225 Difference]: With dead ends: 157406 [2024-10-14 03:53:31,557 INFO L226 Difference]: Without dead ends: 122146 [2024-10-14 03:53:31,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:53:31,609 INFO L432 NwaCegarLoop]: 1814 mSDtfsCounter, 3829 mSDsluCounter, 3421 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3829 SdHoareTripleChecker+Valid, 5235 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:31,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3829 Valid, 5235 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:53:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122146 states. [2024-10-14 03:53:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122146 to 115408. [2024-10-14 03:53:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115408 states, 115407 states have (on average 1.4891297754902215) internal successors, (171856), 115407 states have internal predecessors, (171856), 0 states have call successors, (0), 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-10-14 03:53:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115408 states to 115408 states and 171856 transitions. [2024-10-14 03:53:33,809 INFO L78 Accepts]: Start accepts. Automaton has 115408 states and 171856 transitions. Word has length 172 [2024-10-14 03:53:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:33,809 INFO L471 AbstractCegarLoop]: Abstraction has 115408 states and 171856 transitions. [2024-10-14 03:53:33,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 115408 states and 171856 transitions. [2024-10-14 03:53:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 03:53:34,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:34,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:34,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:53:34,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:34,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 883703146, now seen corresponding path program 1 times [2024-10-14 03:53:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:34,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774948709] [2024-10-14 03:53:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:34,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:34,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774948709] [2024-10-14 03:53:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774948709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:34,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:34,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:34,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133816648] [2024-10-14 03:53:34,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:34,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:34,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:34,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:34,483 INFO L87 Difference]: Start difference. First operand 115408 states and 171856 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-10-14 03:53:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:35,671 INFO L93 Difference]: Finished difference Result 286119 states and 425943 transitions. [2024-10-14 03:53:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:35,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2024-10-14 03:53:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:36,042 INFO L225 Difference]: With dead ends: 286119 [2024-10-14 03:53:36,042 INFO L226 Difference]: Without dead ends: 200456 [2024-10-14 03:53:36,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:36,141 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 520 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:36,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1680 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200456 states. [2024-10-14 03:53:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200456 to 200454. [2024-10-14 03:53:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200454 states, 200453 states have (on average 1.4778077654113433) internal successors, (296231), 200453 states have internal predecessors, (296231), 0 states have call successors, (0), 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-10-14 03:53:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200454 states to 200454 states and 296231 transitions. [2024-10-14 03:53:39,848 INFO L78 Accepts]: Start accepts. Automaton has 200454 states and 296231 transitions. Word has length 175 [2024-10-14 03:53:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:39,848 INFO L471 AbstractCegarLoop]: Abstraction has 200454 states and 296231 transitions. [2024-10-14 03:53:39,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-10-14 03:53:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 200454 states and 296231 transitions. [2024-10-14 03:53:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 03:53:40,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:40,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:53:40,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1994988459, now seen corresponding path program 1 times [2024-10-14 03:53:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:40,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975094414] [2024-10-14 03:53:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:40,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:40,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:40,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975094414] [2024-10-14 03:53:40,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975094414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:40,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:40,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:40,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196289188] [2024-10-14 03:53:40,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:40,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:40,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:40,960 INFO L87 Difference]: Start difference. First operand 200454 states and 296231 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-10-14 03:53:43,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:43,169 INFO L93 Difference]: Finished difference Result 464974 states and 687031 transitions. [2024-10-14 03:53:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:43,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2024-10-14 03:53:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:43,666 INFO L225 Difference]: With dead ends: 464974 [2024-10-14 03:53:43,666 INFO L226 Difference]: Without dead ends: 331204 [2024-10-14 03:53:43,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:43,801 INFO L432 NwaCegarLoop]: 1177 mSDtfsCounter, 499 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:43,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1810 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331204 states. [2024-10-14 03:53:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331204 to 331202. [2024-10-14 03:53:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331202 states, 331201 states have (on average 1.4666411031367659) internal successors, (485753), 331201 states have internal predecessors, (485753), 0 states have call successors, (0), 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-10-14 03:53:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331202 states to 331202 states and 485753 transitions. [2024-10-14 03:53:50,478 INFO L78 Accepts]: Start accepts. Automaton has 331202 states and 485753 transitions. Word has length 175 [2024-10-14 03:53:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:50,479 INFO L471 AbstractCegarLoop]: Abstraction has 331202 states and 485753 transitions. [2024-10-14 03:53:50,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-10-14 03:53:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 331202 states and 485753 transitions. [2024-10-14 03:53:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 03:53:51,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:51,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:53:51,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:53:51,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1679683084, now seen corresponding path program 1 times [2024-10-14 03:53:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464921157] [2024-10-14 03:53:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:51,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464921157] [2024-10-14 03:53:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464921157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:51,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:51,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917534600] [2024-10-14 03:53:51,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:51,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:51,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:51,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:51,139 INFO L87 Difference]: Start difference. First operand 331202 states and 485753 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-10-14 03:53:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:53,645 INFO L93 Difference]: Finished difference Result 705192 states and 1032238 transitions. [2024-10-14 03:53:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:53,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2024-10-14 03:53:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:54,497 INFO L225 Difference]: With dead ends: 705192 [2024-10-14 03:53:54,497 INFO L226 Difference]: Without dead ends: 510654 [2024-10-14 03:53:55,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:55,490 INFO L432 NwaCegarLoop]: 1169 mSDtfsCounter, 480 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:55,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1802 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510654 states. [2024-10-14 03:54:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510654 to 510652. [2024-10-14 03:54:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510652 states, 510651 states have (on average 1.4521502944280928) internal successors, (741542), 510651 states have internal predecessors, (741542), 0 states have call successors, (0), 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-10-14 03:54:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510652 states to 510652 states and 741542 transitions. [2024-10-14 03:54:06,186 INFO L78 Accepts]: Start accepts. Automaton has 510652 states and 741542 transitions. Word has length 175 [2024-10-14 03:54:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:06,187 INFO L471 AbstractCegarLoop]: Abstraction has 510652 states and 741542 transitions. [2024-10-14 03:54:06,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-10-14 03:54:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 510652 states and 741542 transitions. [2024-10-14 03:54:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-14 03:54:06,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:06,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:54:06,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:54:06,888 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:54:06,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash -194922543, now seen corresponding path program 1 times [2024-10-14 03:54:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:06,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653280644] [2024-10-14 03:54:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:06,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653280644] [2024-10-14 03:54:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653280644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:06,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505661750] [2024-10-14 03:54:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:06,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:06,995 INFO L87 Difference]: Start difference. First operand 510652 states and 741542 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)