./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/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.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/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.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 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:30:21,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:30:21,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:30:21,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:30:21,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:30:21,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:30:21,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:30:21,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:30:21,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:30:21,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:30:21,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:30:21,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:30:21,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:30:21,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:30:21,146 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:30:21,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:30:21,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:30:21,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:30:21,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:30:21,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:30:21,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:30:21,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:30:21,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:30:21,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:30:21,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:30:21,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:30:21,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:30:21,153 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:30:21,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:30:21,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:30:21,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:30:21,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:30:21,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:30:21,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:30:21,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:30:21,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:30:21,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:30:21,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:30:21,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:30:21,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:30:21,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:30:21,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:30:21,157 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 -> 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 [2024-10-14 03:30:21,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:30:21,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:30:21,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:30:21,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:30:21,402 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:30:21,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-10-14 03:30:22,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:30:22,972 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:30:22,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-10-14 03:30:22,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054a50580/d81cd2c91bc24d2c8ccffc2f21b076d7/FLAG0770c772f [2024-10-14 03:30:22,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054a50580/d81cd2c91bc24d2c8ccffc2f21b076d7 [2024-10-14 03:30:22,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:30:23,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:30:23,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:30:23,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:30:23,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:30:23,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:30:22" (1/1) ... [2024-10-14 03:30:23,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13715a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23, skipping insertion in model container [2024-10-14 03:30:23,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:30:22" (1/1) ... [2024-10-14 03:30:23,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:30:23,249 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/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c[9529,9542] [2024-10-14 03:30:23,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:30:23,268 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:30:23,355 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/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c[9529,9542] [2024-10-14 03:30:23,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:30:23,399 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:30:23,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23 WrapperNode [2024-10-14 03:30:23,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:30:23,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:30:23,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:30:23,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:30:23,409 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:30:23" (1/1) ... [2024-10-14 03:30:23,417 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:30:23" (1/1) ... [2024-10-14 03:30:23,443 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 316 [2024-10-14 03:30:23,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:30:23,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:30:23,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:30:23,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:30:23,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,487 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:30:23,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:30:23,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:30:23,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:30:23,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:30:23,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (1/1) ... [2024-10-14 03:30:23,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:30:23,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:30:23,545 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:30:23,548 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:30:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:30:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:30:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:30:23,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:30:23,675 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:30:23,676 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:30:24,010 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-14 03:30:24,010 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:30:24,046 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:30:24,047 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:30:24,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:30:24 BoogieIcfgContainer [2024-10-14 03:30:24,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:30:24,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:30:24,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:30:24,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:30:24,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:30:22" (1/3) ... [2024-10-14 03:30:24,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd23e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:30:24, skipping insertion in model container [2024-10-14 03:30:24,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:23" (2/3) ... [2024-10-14 03:30:24,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd23e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:30:24, skipping insertion in model container [2024-10-14 03:30:24,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:30:24" (3/3) ... [2024-10-14 03:30:24,054 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-10-14 03:30:24,069 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:30:24,070 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:30:24,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:30:24,127 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;@5f7318d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:30:24,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:30:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 79 states have (on average 1.7721518987341771) internal successors, (140), 80 states have internal predecessors, (140), 0 states have call successors, (0), 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:30:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:30:24,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:24,136 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] [2024-10-14 03:30:24,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:24,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash -436537251, now seen corresponding path program 1 times [2024-10-14 03:30:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:24,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994654290] [2024-10-14 03:30:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:24,375 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:30:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994654290] [2024-10-14 03:30:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994654290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:30:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50482158] [2024-10-14 03:30:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:24,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:30:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:30:24,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:30:24,402 INFO L87 Difference]: Start difference. First operand has 81 states, 79 states have (on average 1.7721518987341771) internal successors, (140), 80 states have internal predecessors, (140), 0 states have call successors, (0), 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 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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:30:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:24,459 INFO L93 Difference]: Finished difference Result 133 states and 227 transitions. [2024-10-14 03:30:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:30:24,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-14 03:30:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:24,470 INFO L225 Difference]: With dead ends: 133 [2024-10-14 03:30:24,470 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 03:30:24,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:30:24,477 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:24,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 03:30:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 03:30:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 78 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2024-10-14 03:30:24,542 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 26 [2024-10-14 03:30:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:24,542 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2024-10-14 03:30:24,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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:30:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2024-10-14 03:30:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:30:24,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:24,544 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] [2024-10-14 03:30:24,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:30:24,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:24,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2052991711, now seen corresponding path program 1 times [2024-10-14 03:30:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:24,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866905392] [2024-10-14 03:30:24,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:24,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:24,649 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:30:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866905392] [2024-10-14 03:30:24,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866905392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:24,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:24,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:30:24,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005268579] [2024-10-14 03:30:24,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:24,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:30:24,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:24,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:30:24,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:24,652 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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:30:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:24,719 INFO L93 Difference]: Finished difference Result 133 states and 221 transitions. [2024-10-14 03:30:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:30:24,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-14 03:30:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:24,721 INFO L225 Difference]: With dead ends: 133 [2024-10-14 03:30:24,721 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 03:30:24,721 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:30:24,722 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:24,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 03:30:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 03:30:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 0 states have call successors, (0), 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:30:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2024-10-14 03:30:24,734 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 26 [2024-10-14 03:30:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:24,734 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2024-10-14 03:30:24,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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:30:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2024-10-14 03:30:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:30:24,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:24,736 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] [2024-10-14 03:30:24,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:30:24,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:24,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash 794604760, now seen corresponding path program 1 times [2024-10-14 03:30:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:24,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954881018] [2024-10-14 03:30:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:24,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:24,879 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:30:24,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954881018] [2024-10-14 03:30:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954881018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:24,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836545118] [2024-10-14 03:30:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:24,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:24,884 INFO L87 Difference]: Start difference. First operand 79 states and 111 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:30:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:24,912 INFO L93 Difference]: Finished difference Result 173 states and 263 transitions. [2024-10-14 03:30:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:24,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-14 03:30:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:24,914 INFO L225 Difference]: With dead ends: 173 [2024-10-14 03:30:24,916 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 03:30:24,916 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:30:24,917 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 59 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:24,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 209 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 03:30:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-10-14 03:30:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 0 states have call successors, (0), 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:30:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2024-10-14 03:30:24,932 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 49 [2024-10-14 03:30:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:24,934 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2024-10-14 03:30:24,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:30:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2024-10-14 03:30:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:30:24,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:24,935 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] [2024-10-14 03:30:24,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:30:24,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:24,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1181399799, now seen corresponding path program 1 times [2024-10-14 03:30:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563614002] [2024-10-14 03:30:24,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:25,098 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:30:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563614002] [2024-10-14 03:30:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563614002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:25,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:25,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999464627] [2024-10-14 03:30:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:25,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:25,103 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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:30:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:25,220 INFO L93 Difference]: Finished difference Result 580 states and 928 transitions. [2024-10-14 03:30:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:25,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-14 03:30:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:25,226 INFO L225 Difference]: With dead ends: 580 [2024-10-14 03:30:25,226 INFO L226 Difference]: Without dead ends: 488 [2024-10-14 03:30:25,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:25,230 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 653 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:25,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 590 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-14 03:30:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 210. [2024-10-14 03:30:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 0 states have call successors, (0), 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:30:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 323 transitions. [2024-10-14 03:30:25,249 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 323 transitions. Word has length 49 [2024-10-14 03:30:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:25,249 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 323 transitions. [2024-10-14 03:30:25,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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:30:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 323 transitions. [2024-10-14 03:30:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:30:25,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:25,251 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] [2024-10-14 03:30:25,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:30:25,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:25,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:25,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2044342744, now seen corresponding path program 1 times [2024-10-14 03:30:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:25,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727369919] [2024-10-14 03:30:25,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:25,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:25,446 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:30:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727369919] [2024-10-14 03:30:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727369919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:25,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:30:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268825618] [2024-10-14 03:30:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:25,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:30:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:25,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:30:25,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:25,449 INFO L87 Difference]: Start difference. First operand 210 states and 323 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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:30:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:25,473 INFO L93 Difference]: Finished difference Result 220 states and 336 transitions. [2024-10-14 03:30:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:30:25,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-14 03:30:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:25,475 INFO L225 Difference]: With dead ends: 220 [2024-10-14 03:30:25,476 INFO L226 Difference]: Without dead ends: 218 [2024-10-14 03:30:25,476 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:30:25,476 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:25,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-14 03:30:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-10-14 03:30:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.5253456221198156) internal successors, (331), 217 states have internal predecessors, (331), 0 states have call successors, (0), 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:30:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 331 transitions. [2024-10-14 03:30:25,491 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 331 transitions. Word has length 50 [2024-10-14 03:30:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:25,491 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 331 transitions. [2024-10-14 03:30:25,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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:30:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 331 transitions. [2024-10-14 03:30:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:30:25,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:25,492 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] [2024-10-14 03:30:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:30:25,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:25,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1050914879, now seen corresponding path program 1 times [2024-10-14 03:30:25,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:25,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185716167] [2024-10-14 03:30:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:25,544 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:30:25,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:25,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185716167] [2024-10-14 03:30:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185716167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:25,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:25,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:25,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31399530] [2024-10-14 03:30:25,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:25,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:25,546 INFO L87 Difference]: Start difference. First operand 218 states and 331 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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:30:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:25,568 INFO L93 Difference]: Finished difference Result 570 states and 889 transitions. [2024-10-14 03:30:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:25,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-14 03:30:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:25,570 INFO L225 Difference]: With dead ends: 570 [2024-10-14 03:30:25,570 INFO L226 Difference]: Without dead ends: 380 [2024-10-14 03:30:25,570 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:30:25,571 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 51 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:25,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 182 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-14 03:30:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 374. [2024-10-14 03:30:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.5361930294906165) internal successors, (573), 373 states have internal predecessors, (573), 0 states have call successors, (0), 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:30:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 573 transitions. [2024-10-14 03:30:25,582 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 573 transitions. Word has length 51 [2024-10-14 03:30:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:25,582 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 573 transitions. [2024-10-14 03:30:25,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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:30:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 573 transitions. [2024-10-14 03:30:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:30:25,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:25,584 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] [2024-10-14 03:30:25,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:30:25,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:25,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2005837455, now seen corresponding path program 1 times [2024-10-14 03:30:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119607667] [2024-10-14 03:30:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:25,627 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:30:25,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119607667] [2024-10-14 03:30:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119607667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:25,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:25,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:25,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016155386] [2024-10-14 03:30:25,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:25,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:25,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:25,629 INFO L87 Difference]: Start difference. First operand 374 states and 573 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:30:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:25,659 INFO L93 Difference]: Finished difference Result 1002 states and 1551 transitions. [2024-10-14 03:30:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-14 03:30:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:25,663 INFO L225 Difference]: With dead ends: 1002 [2024-10-14 03:30:25,663 INFO L226 Difference]: Without dead ends: 656 [2024-10-14 03:30:25,664 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:30:25,664 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 63 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:25,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-14 03:30:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 654. [2024-10-14 03:30:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.5267993874425727) internal successors, (997), 653 states have internal predecessors, (997), 0 states have call successors, (0), 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:30:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 997 transitions. [2024-10-14 03:30:25,689 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 997 transitions. Word has length 52 [2024-10-14 03:30:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:25,690 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 997 transitions. [2024-10-14 03:30:25,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:30:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 997 transitions. [2024-10-14 03:30:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:30:25,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:25,694 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] [2024-10-14 03:30:25,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:30:25,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:25,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1823510447, now seen corresponding path program 1 times [2024-10-14 03:30:25,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:25,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159158811] [2024-10-14 03:30:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:25,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:25,748 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:30:25,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159158811] [2024-10-14 03:30:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159158811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:25,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:25,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:25,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193847401] [2024-10-14 03:30:25,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:25,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:25,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:25,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:25,754 INFO L87 Difference]: Start difference. First operand 654 states and 997 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:30:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:25,792 INFO L93 Difference]: Finished difference Result 1778 states and 2711 transitions. [2024-10-14 03:30:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:25,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-14 03:30:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:25,797 INFO L225 Difference]: With dead ends: 1778 [2024-10-14 03:30:25,797 INFO L226 Difference]: Without dead ends: 1152 [2024-10-14 03:30:25,798 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:30:25,799 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:25,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 236 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-10-14 03:30:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1150. [2024-10-14 03:30:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.5013054830287207) internal successors, (1725), 1149 states have internal predecessors, (1725), 0 states have call successors, (0), 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:30:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1725 transitions. [2024-10-14 03:30:25,827 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1725 transitions. Word has length 52 [2024-10-14 03:30:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:25,828 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1725 transitions. [2024-10-14 03:30:25,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:30:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1725 transitions. [2024-10-14 03:30:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:30:25,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:25,831 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] [2024-10-14 03:30:25,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:30:25,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:25,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 484386469, now seen corresponding path program 1 times [2024-10-14 03:30:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:25,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910529931] [2024-10-14 03:30:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:25,890 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:30:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:25,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910529931] [2024-10-14 03:30:25,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910529931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:25,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:25,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712133417] [2024-10-14 03:30:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:25,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:25,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:25,894 INFO L87 Difference]: Start difference. First operand 1150 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:30:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:25,960 INFO L93 Difference]: Finished difference Result 2245 states and 3395 transitions. [2024-10-14 03:30:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:25,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-14 03:30:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:25,966 INFO L225 Difference]: With dead ends: 2245 [2024-10-14 03:30:25,966 INFO L226 Difference]: Without dead ends: 1618 [2024-10-14 03:30:25,967 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:30:25,967 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 68 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:25,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 245 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2024-10-14 03:30:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1616. [2024-10-14 03:30:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 1.4904024767801858) internal successors, (2407), 1615 states have internal predecessors, (2407), 0 states have call successors, (0), 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:30:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2407 transitions. [2024-10-14 03:30:26,009 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2407 transitions. Word has length 53 [2024-10-14 03:30:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:26,009 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2407 transitions. [2024-10-14 03:30:26,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:30:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2407 transitions. [2024-10-14 03:30:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:26,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:26,011 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:26,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:30:26,012 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:26,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash -573145706, now seen corresponding path program 1 times [2024-10-14 03:30:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927056871] [2024-10-14 03:30:26,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:26,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:30:26,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:26,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927056871] [2024-10-14 03:30:26,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927056871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:26,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:26,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:26,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361730898] [2024-10-14 03:30:26,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:26,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:26,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:26,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:26,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:26,143 INFO L87 Difference]: Start difference. First operand 1616 states and 2407 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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:30:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:26,250 INFO L93 Difference]: Finished difference Result 4554 states and 6888 transitions. [2024-10-14 03:30:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:26,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 74 [2024-10-14 03:30:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:26,259 INFO L225 Difference]: With dead ends: 4554 [2024-10-14 03:30:26,260 INFO L226 Difference]: Without dead ends: 3752 [2024-10-14 03:30:26,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:26,262 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 548 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:26,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 581 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2024-10-14 03:30:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2400. [2024-10-14 03:30:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2399 states have (on average 1.491871613172155) internal successors, (3579), 2399 states have internal predecessors, (3579), 0 states have call successors, (0), 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:30:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3579 transitions. [2024-10-14 03:30:26,315 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3579 transitions. Word has length 74 [2024-10-14 03:30:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:26,315 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3579 transitions. [2024-10-14 03:30:26,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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:30:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3579 transitions. [2024-10-14 03:30:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:26,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:26,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:26,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:30:26,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:26,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1433669481, now seen corresponding path program 1 times [2024-10-14 03:30:26,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:26,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771018156] [2024-10-14 03:30:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:26,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 03:30:26,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771018156] [2024-10-14 03:30:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771018156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:26,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:26,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238719524] [2024-10-14 03:30:26,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:26,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:26,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:26,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:26,452 INFO L87 Difference]: Start difference. First operand 2400 states and 3579 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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:30:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:26,586 INFO L93 Difference]: Finished difference Result 5338 states and 8060 transitions. [2024-10-14 03:30:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 74 [2024-10-14 03:30:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:26,599 INFO L225 Difference]: With dead ends: 5338 [2024-10-14 03:30:26,599 INFO L226 Difference]: Without dead ends: 4536 [2024-10-14 03:30:26,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:26,601 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 492 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:26,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 618 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2024-10-14 03:30:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3184. [2024-10-14 03:30:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3183 states have (on average 1.4926170279610431) internal successors, (4751), 3183 states have internal predecessors, (4751), 0 states have call successors, (0), 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:30:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4751 transitions. [2024-10-14 03:30:26,694 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4751 transitions. Word has length 74 [2024-10-14 03:30:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:26,695 INFO L471 AbstractCegarLoop]: Abstraction has 3184 states and 4751 transitions. [2024-10-14 03:30:26,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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:30:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4751 transitions. [2024-10-14 03:30:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:26,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:26,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:26,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:30:26,696 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1615996489, now seen corresponding path program 1 times [2024-10-14 03:30:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:26,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213833995] [2024-10-14 03:30:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:30:26,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:26,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213833995] [2024-10-14 03:30:26,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213833995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:26,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:26,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492116267] [2024-10-14 03:30:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:26,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:26,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:26,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:26,784 INFO L87 Difference]: Start difference. First operand 3184 states and 4751 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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:30:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:26,948 INFO L93 Difference]: Finished difference Result 6122 states and 9232 transitions. [2024-10-14 03:30:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:26,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 74 [2024-10-14 03:30:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:26,960 INFO L225 Difference]: With dead ends: 6122 [2024-10-14 03:30:26,961 INFO L226 Difference]: Without dead ends: 5320 [2024-10-14 03:30:26,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:26,962 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 531 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:26,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 626 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2024-10-14 03:30:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 3968. [2024-10-14 03:30:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3967 states have (on average 1.4930678094277792) internal successors, (5923), 3967 states have internal predecessors, (5923), 0 states have call successors, (0), 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:30:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5923 transitions. [2024-10-14 03:30:27,049 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5923 transitions. Word has length 74 [2024-10-14 03:30:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:27,049 INFO L471 AbstractCegarLoop]: Abstraction has 3968 states and 5923 transitions. [2024-10-14 03:30:27,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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:30:27,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5923 transitions. [2024-10-14 03:30:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:30:27,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:27,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:27,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:30:27,051 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:27,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2003246849, now seen corresponding path program 1 times [2024-10-14 03:30:27,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:27,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570534940] [2024-10-14 03:30:27,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:27,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:27,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570534940] [2024-10-14 03:30:27,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570534940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:27,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:27,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:27,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213634738] [2024-10-14 03:30:27,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:27,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:27,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:27,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:27,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:27,114 INFO L87 Difference]: Start difference. First operand 3968 states and 5923 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:30:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:27,179 INFO L93 Difference]: Finished difference Result 7908 states and 11817 transitions. [2024-10-14 03:30:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:27,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-14 03:30:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:27,189 INFO L225 Difference]: With dead ends: 7908 [2024-10-14 03:30:27,189 INFO L226 Difference]: Without dead ends: 3970 [2024-10-14 03:30:27,193 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:30:27,193 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 55 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:27,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 236 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:27,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3970 states. [2024-10-14 03:30:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3970 to 3968. [2024-10-14 03:30:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3967 states have (on average 1.4779430299974792) internal successors, (5863), 3967 states have internal predecessors, (5863), 0 states have call successors, (0), 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:30:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5863 transitions. [2024-10-14 03:30:27,270 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5863 transitions. Word has length 75 [2024-10-14 03:30:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:27,271 INFO L471 AbstractCegarLoop]: Abstraction has 3968 states and 5863 transitions. [2024-10-14 03:30:27,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:30:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5863 transitions. [2024-10-14 03:30:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:30:27,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:27,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:27,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:30:27,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:27,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:27,273 INFO L85 PathProgramCache]: Analyzing trace with hash 120108448, now seen corresponding path program 1 times [2024-10-14 03:30:27,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:27,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9958974] [2024-10-14 03:30:27,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:27,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9958974] [2024-10-14 03:30:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9958974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885364898] [2024-10-14 03:30:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:27,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:27,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:27,359 INFO L87 Difference]: Start difference. First operand 3968 states and 5863 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:30:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:27,399 INFO L93 Difference]: Finished difference Result 5940 states and 8781 transitions. [2024-10-14 03:30:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:27,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-14 03:30:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:27,405 INFO L225 Difference]: With dead ends: 5940 [2024-10-14 03:30:27,405 INFO L226 Difference]: Without dead ends: 2002 [2024-10-14 03:30:27,408 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:30:27,408 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 49 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:27,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 217 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-10-14 03:30:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 2000. [2024-10-14 03:30:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1999 states have (on average 1.4592296148074038) internal successors, (2917), 1999 states have internal predecessors, (2917), 0 states have call successors, (0), 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:30:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2917 transitions. [2024-10-14 03:30:27,445 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2917 transitions. Word has length 75 [2024-10-14 03:30:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:27,445 INFO L471 AbstractCegarLoop]: Abstraction has 2000 states and 2917 transitions. [2024-10-14 03:30:27,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:30:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2917 transitions. [2024-10-14 03:30:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:30:27,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:27,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:27,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:30:27,446 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:27,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 626393793, now seen corresponding path program 1 times [2024-10-14 03:30:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:27,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137948084] [2024-10-14 03:30:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:27,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:27,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137948084] [2024-10-14 03:30:27,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137948084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:30:27,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936740206] [2024-10-14 03:30:27,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:27,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:30:27,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:30:27,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:30:27,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:30:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:27,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 03:30:27,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:30:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:28,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:30:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:28,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936740206] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:30:28,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:30:28,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-14 03:30:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893948470] [2024-10-14 03:30:28,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:30:28,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 03:30:28,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 03:30:28,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-14 03:30:28,878 INFO L87 Difference]: Start difference. First operand 2000 states and 2917 transitions. Second operand has 22 states, 22 states have (on average 9.863636363636363) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:34,019 INFO L93 Difference]: Finished difference Result 18326 states and 26534 transitions. [2024-10-14 03:30:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-10-14 03:30:34,020 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.863636363636363) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-14 03:30:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:34,042 INFO L225 Difference]: With dead ends: 18326 [2024-10-14 03:30:34,043 INFO L226 Difference]: Without dead ends: 16356 [2024-10-14 03:30:34,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4601 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2260, Invalid=10622, Unknown=0, NotChecked=0, Total=12882 [2024-10-14 03:30:34,049 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 7095 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7095 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:34,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7095 Valid, 1375 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:30:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16356 states. [2024-10-14 03:30:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16356 to 14076. [2024-10-14 03:30:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14076 states, 14075 states have (on average 1.4238721136767318) internal successors, (20041), 14075 states have internal predecessors, (20041), 0 states have call successors, (0), 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:30:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14076 states to 14076 states and 20041 transitions. [2024-10-14 03:30:34,533 INFO L78 Accepts]: Start accepts. Automaton has 14076 states and 20041 transitions. Word has length 75 [2024-10-14 03:30:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:34,534 INFO L471 AbstractCegarLoop]: Abstraction has 14076 states and 20041 transitions. [2024-10-14 03:30:34,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.863636363636363) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 14076 states and 20041 transitions. [2024-10-14 03:30:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:30:34,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:34,535 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:34,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:30:34,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 03:30:34,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:34,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2112085428, now seen corresponding path program 1 times [2024-10-14 03:30:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:34,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115489281] [2024-10-14 03:30:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:30:34,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115489281] [2024-10-14 03:30:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115489281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:34,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:34,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:34,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348836218] [2024-10-14 03:30:34,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:34,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:34,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:34,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:34,869 INFO L87 Difference]: Start difference. First operand 14076 states and 20041 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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:30:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:35,290 INFO L93 Difference]: Finished difference Result 25573 states and 36777 transitions. [2024-10-14 03:30:35,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:35,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 76 [2024-10-14 03:30:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:35,323 INFO L225 Difference]: With dead ends: 25573 [2024-10-14 03:30:35,323 INFO L226 Difference]: Without dead ends: 22682 [2024-10-14 03:30:35,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:35,331 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 456 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:35,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 626 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22682 states. [2024-10-14 03:30:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22682 to 16873. [2024-10-14 03:30:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16873 states, 16872 states have (on average 1.4227714556661926) internal successors, (24005), 16872 states have internal predecessors, (24005), 0 states have call successors, (0), 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:30:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16873 states to 16873 states and 24005 transitions. [2024-10-14 03:30:35,789 INFO L78 Accepts]: Start accepts. Automaton has 16873 states and 24005 transitions. Word has length 76 [2024-10-14 03:30:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:35,790 INFO L471 AbstractCegarLoop]: Abstraction has 16873 states and 24005 transitions. [2024-10-14 03:30:35,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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:30:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16873 states and 24005 transitions. [2024-10-14 03:30:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:30:35,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:35,791 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:35,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:30:35,791 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash 464528149, now seen corresponding path program 1 times [2024-10-14 03:30:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:35,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689087622] [2024-10-14 03:30:35,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:37,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689087622] [2024-10-14 03:30:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689087622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:30:37,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225788518] [2024-10-14 03:30:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:37,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:30:37,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:30:37,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:30:37,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:30:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:37,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 03:30:37,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:30:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:37,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:30:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225788518] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:30:38,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:30:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 29 [2024-10-14 03:30:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178513705] [2024-10-14 03:30:38,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:30:38,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 03:30:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:38,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 03:30:38,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2024-10-14 03:30:38,909 INFO L87 Difference]: Start difference. First operand 16873 states and 24005 transitions. Second operand has 30 states, 30 states have (on average 7.366666666666666) internal successors, (221), 29 states have internal predecessors, (221), 0 states have call successors, (0), 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:30:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:40,141 INFO L93 Difference]: Finished difference Result 64772 states and 92523 transitions. [2024-10-14 03:30:40,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 03:30:40,141 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.366666666666666) internal successors, (221), 29 states have internal predecessors, (221), 0 states have call successors, (0), 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 79 [2024-10-14 03:30:40,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:40,213 INFO L225 Difference]: With dead ends: 64772 [2024-10-14 03:30:40,213 INFO L226 Difference]: Without dead ends: 47941 [2024-10-14 03:30:40,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=492, Invalid=1764, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 03:30:40,229 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1268 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:40,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 738 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:30:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47941 states. [2024-10-14 03:30:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47941 to 39544. [2024-10-14 03:30:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39544 states, 39543 states have (on average 1.411425536757454) internal successors, (55812), 39543 states have internal predecessors, (55812), 0 states have call successors, (0), 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:30:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39544 states to 39544 states and 55812 transitions. [2024-10-14 03:30:41,240 INFO L78 Accepts]: Start accepts. Automaton has 39544 states and 55812 transitions. Word has length 79 [2024-10-14 03:30:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:41,240 INFO L471 AbstractCegarLoop]: Abstraction has 39544 states and 55812 transitions. [2024-10-14 03:30:41,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.366666666666666) internal successors, (221), 29 states have internal predecessors, (221), 0 states have call successors, (0), 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:30:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 39544 states and 55812 transitions. [2024-10-14 03:30:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:30:41,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:41,241 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:41,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:30:41,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 03:30:41,442 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:41,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash 851323188, now seen corresponding path program 1 times [2024-10-14 03:30:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:41,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293355478] [2024-10-14 03:30:41,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:41,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293355478] [2024-10-14 03:30:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293355478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:41,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:41,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:41,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893915537] [2024-10-14 03:30:41,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:41,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:41,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:41,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:41,506 INFO L87 Difference]: Start difference. First operand 39544 states and 55812 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:30:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:42,148 INFO L93 Difference]: Finished difference Result 61590 states and 86920 transitions. [2024-10-14 03:30:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-14 03:30:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:42,181 INFO L225 Difference]: With dead ends: 61590 [2024-10-14 03:30:42,181 INFO L226 Difference]: Without dead ends: 22523 [2024-10-14 03:30:42,204 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:30:42,205 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 37 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:42,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 198 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22523 states. [2024-10-14 03:30:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22523 to 22521. [2024-10-14 03:30:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22521 states, 22520 states have (on average 1.3860124333925399) internal successors, (31213), 22520 states have internal predecessors, (31213), 0 states have call successors, (0), 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:30:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22521 states to 22521 states and 31213 transitions. [2024-10-14 03:30:42,952 INFO L78 Accepts]: Start accepts. Automaton has 22521 states and 31213 transitions. Word has length 79 [2024-10-14 03:30:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:42,953 INFO L471 AbstractCegarLoop]: Abstraction has 22521 states and 31213 transitions. [2024-10-14 03:30:42,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:30:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 22521 states and 31213 transitions. [2024-10-14 03:30:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:30:42,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:42,954 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:42,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:30:42,954 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:42,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash -159971565, now seen corresponding path program 1 times [2024-10-14 03:30:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108838566] [2024-10-14 03:30:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:43,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108838566] [2024-10-14 03:30:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108838566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:30:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831560531] [2024-10-14 03:30:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:43,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:30:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:30:43,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:30:43,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:30:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:43,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:30:43,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:30:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:44,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:30:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:44,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831560531] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:30:44,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:30:44,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2024-10-14 03:30:44,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595582341] [2024-10-14 03:30:44,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:30:44,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 03:30:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:44,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 03:30:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:30:44,634 INFO L87 Difference]: Start difference. First operand 22521 states and 31213 transitions. Second operand has 26 states, 26 states have (on average 7.961538461538462) internal successors, (207), 25 states have internal predecessors, (207), 0 states have call successors, (0), 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:30:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:51,129 INFO L93 Difference]: Finished difference Result 272269 states and 373203 transitions. [2024-10-14 03:30:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 03:30:51,130 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.961538461538462) internal successors, (207), 25 states have internal predecessors, (207), 0 states have call successors, (0), 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 79 [2024-10-14 03:30:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:51,424 INFO L225 Difference]: With dead ends: 272269 [2024-10-14 03:30:51,424 INFO L226 Difference]: Without dead ends: 249961 [2024-10-14 03:30:51,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3096 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1767, Invalid=8133, Unknown=0, NotChecked=0, Total=9900 [2024-10-14 03:30:51,468 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 2975 mSDsluCounter, 2005 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2975 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:51,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2975 Valid, 2207 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:30:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249961 states. [2024-10-14 03:30:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249961 to 147708. [2024-10-14 03:30:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147708 states, 147707 states have (on average 1.3630362812866013) internal successors, (201330), 147707 states have internal predecessors, (201330), 0 states have call successors, (0), 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:30:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147708 states to 147708 states and 201330 transitions. [2024-10-14 03:30:56,821 INFO L78 Accepts]: Start accepts. Automaton has 147708 states and 201330 transitions. Word has length 79 [2024-10-14 03:30:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:56,822 INFO L471 AbstractCegarLoop]: Abstraction has 147708 states and 201330 transitions. [2024-10-14 03:30:56,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.961538461538462) internal successors, (207), 25 states have internal predecessors, (207), 0 states have call successors, (0), 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:30:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 147708 states and 201330 transitions. [2024-10-14 03:30:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:30:56,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:56,825 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:56,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:30:57,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:30:57,029 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:57,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1808943462, now seen corresponding path program 1 times [2024-10-14 03:30:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:57,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943490991] [2024-10-14 03:30:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:57,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943490991] [2024-10-14 03:30:57,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943490991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:57,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:57,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:57,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285399852] [2024-10-14 03:30:57,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:57,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:57,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:57,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:57,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:57,094 INFO L87 Difference]: Start difference. First operand 147708 states and 201330 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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:31:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:02,760 INFO L93 Difference]: Finished difference Result 382222 states and 519403 transitions. [2024-10-14 03:31:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:31:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-14 03:31:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:03,150 INFO L225 Difference]: With dead ends: 382222 [2024-10-14 03:31:03,151 INFO L226 Difference]: Without dead ends: 235649 [2024-10-14 03:31:03,276 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:31:03,277 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 54 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:03,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 209 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235649 states. [2024-10-14 03:31:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235649 to 235647. [2024-10-14 03:31:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235647 states, 235646 states have (on average 1.3418432733846533) internal successors, (316200), 235646 states have internal predecessors, (316200), 0 states have call successors, (0), 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:31:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235647 states to 235647 states and 316200 transitions. [2024-10-14 03:31:10,743 INFO L78 Accepts]: Start accepts. Automaton has 235647 states and 316200 transitions. Word has length 80 [2024-10-14 03:31:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:10,744 INFO L471 AbstractCegarLoop]: Abstraction has 235647 states and 316200 transitions. [2024-10-14 03:31:10,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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:31:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 235647 states and 316200 transitions. [2024-10-14 03:31:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:31:10,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:10,750 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:10,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:31:10,750 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:10,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:10,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2142364890, now seen corresponding path program 1 times [2024-10-14 03:31:10,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:10,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917832907] [2024-10-14 03:31:10,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:10,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:10,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:10,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917832907] [2024-10-14 03:31:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917832907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:31:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602641644] [2024-10-14 03:31:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:10,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:31:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:31:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:10,788 INFO L87 Difference]: Start difference. First operand 235647 states and 316200 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)