./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_floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_floodmax.3.3.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 b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:59:44,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:59:44,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:59:44,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:59:44,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:59:44,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:59:44,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:59:44,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:59:44,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:59:44,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:59:44,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:59:44,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:59:44,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:59:44,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:59:44,239 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:59:44,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:59:44,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:59:44,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:59:44,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:59:44,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:59:44,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:59:44,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:59:44,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:59:44,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:59:44,245 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:59:44,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:59:44,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:59:44,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:59:44,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:59:44,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:59:44,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:59:44,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:59:44,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:59:44,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:59:44,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:59:44,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:59:44,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:59:44,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:59:44,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:59:44,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:59:44,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:59:44,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:59:44,254 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 -> b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a [2024-10-12 19:59:44,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:59:44,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:59:44,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:59:44,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:59:44,572 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:59:44,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-10-12 19:59:45,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:59:46,170 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:59:46,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-10-12 19:59:46,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a33ca6d/ed30f435147341bdb54d871121093414/FLAG36c32c78d [2024-10-12 19:59:46,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a33ca6d/ed30f435147341bdb54d871121093414 [2024-10-12 19:59:46,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:59:46,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:59:46,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:59:46,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:59:46,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:59:46,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:46,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6d5cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46, skipping insertion in model container [2024-10-12 19:59:46,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:46,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:59:46,817 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_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2024-10-12 19:59:46,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:59:46,842 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:59:46,904 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_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2024-10-12 19:59:46,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:59:46,929 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:59:46,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46 WrapperNode [2024-10-12 19:59:46,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:59:46,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:59:46,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:59:46,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:59:46,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:46,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:46,980 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 454 [2024-10-12 19:59:46,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:59:46,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:59:46,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:59:46,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:59:46,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:46,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:46,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:47,015 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-12 19:59:47,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:47,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:47,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:47,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:47,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:47,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:47,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:59:47,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:59:47,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:59:47,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:59:47,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (1/1) ... [2024-10-12 19:59:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:59:47,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:59:47,092 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-12 19:59:47,095 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-12 19:59:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:59:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:59:47,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:59:47,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:59:47,266 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:59:47,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:59:47,799 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-12 19:59:47,800 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:59:47,857 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:59:47,857 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:59:47,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:59:47 BoogieIcfgContainer [2024-10-12 19:59:47,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:59:47,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:59:47,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:59:47,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:59:47,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:59:46" (1/3) ... [2024-10-12 19:59:47,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccef000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:59:47, skipping insertion in model container [2024-10-12 19:59:47,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:59:46" (2/3) ... [2024-10-12 19:59:47,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccef000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:59:47, skipping insertion in model container [2024-10-12 19:59:47,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:59:47" (3/3) ... [2024-10-12 19:59:47,871 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-10-12 19:59:47,888 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:59:47,889 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:59:47,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:59:47,977 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;@2b0459f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:59:47,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:59:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 118 states have (on average 1.805084745762712) internal successors, (213), 119 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:59:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 19:59:48,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:48,004 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] [2024-10-12 19:59:48,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:48,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1208619071, now seen corresponding path program 1 times [2024-10-12 19:59:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:48,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644338291] [2024-10-12 19:59:48,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:48,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:48,330 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-12 19:59:48,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:48,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644338291] [2024-10-12 19:59:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644338291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:59:48,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272727040] [2024-10-12 19:59:48,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:48,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:59:48,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:48,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:59:48,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:59:48,366 INFO L87 Difference]: Start difference. First operand has 120 states, 118 states have (on average 1.805084745762712) internal successors, (213), 119 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-12 19:59:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:48,413 INFO L93 Difference]: Finished difference Result 184 states and 325 transitions. [2024-10-12 19:59:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:59:48,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-12 19:59:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:48,433 INFO L225 Difference]: With dead ends: 184 [2024-10-12 19:59:48,433 INFO L226 Difference]: Without dead ends: 118 [2024-10-12 19:59:48,437 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-12 19:59:48,444 INFO L432 NwaCegarLoop]: 205 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, 205 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-12 19:59:48,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:59:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-12 19:59:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-12 19:59:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.7777777777777777) internal successors, (208), 117 states have internal predecessors, (208), 0 states have call successors, (0), 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-12 19:59:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 208 transitions. [2024-10-12 19:59:48,485 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 208 transitions. Word has length 34 [2024-10-12 19:59:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:48,486 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 208 transitions. [2024-10-12 19:59:48,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-12 19:59:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 208 transitions. [2024-10-12 19:59:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 19:59:48,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:48,488 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] [2024-10-12 19:59:48,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:59:48,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:48,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1397404483, now seen corresponding path program 1 times [2024-10-12 19:59:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176582141] [2024-10-12 19:59:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:48,840 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-12 19:59:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:48,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176582141] [2024-10-12 19:59:48,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176582141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:48,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:48,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:59:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288110050] [2024-10-12 19:59:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:48,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:59:48,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:48,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:59:48,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:59:48,846 INFO L87 Difference]: Start difference. First operand 118 states and 208 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12 19:59:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:48,933 INFO L93 Difference]: Finished difference Result 184 states and 319 transitions. [2024-10-12 19:59:48,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:59:48,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-12 19:59:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:48,936 INFO L225 Difference]: With dead ends: 184 [2024-10-12 19:59:48,936 INFO L226 Difference]: Without dead ends: 118 [2024-10-12 19:59:48,937 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-12 19:59:48,938 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:48,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:59:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-12 19:59:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-12 19:59:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.547008547008547) internal successors, (181), 117 states have internal predecessors, (181), 0 states have call successors, (0), 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-12 19:59:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 181 transitions. [2024-10-12 19:59:48,947 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 181 transitions. Word has length 34 [2024-10-12 19:59:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:48,948 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 181 transitions. [2024-10-12 19:59:48,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12 19:59:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 181 transitions. [2024-10-12 19:59:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:59:48,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:48,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:48,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:59:48,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:48,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1613385332, now seen corresponding path program 1 times [2024-10-12 19:59:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:48,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556858908] [2024-10-12 19:59:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:49,123 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-12 19:59:49,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:49,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556858908] [2024-10-12 19:59:49,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556858908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:49,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:49,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:59:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437763214] [2024-10-12 19:59:49,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:49,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:59:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:49,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:59:49,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:49,130 INFO L87 Difference]: Start difference. First operand 118 states and 181 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-12 19:59:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:49,198 INFO L93 Difference]: Finished difference Result 235 states and 380 transitions. [2024-10-12 19:59:49,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:59:49,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-12 19:59:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:49,201 INFO L225 Difference]: With dead ends: 235 [2024-10-12 19:59:49,201 INFO L226 Difference]: Without dead ends: 172 [2024-10-12 19:59:49,202 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-12 19:59:49,205 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 82 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:49,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 311 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:59:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-12 19:59:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2024-10-12 19:59:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.5714285714285714) internal successors, (264), 168 states have internal predecessors, (264), 0 states have call successors, (0), 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-12 19:59:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 264 transitions. [2024-10-12 19:59:49,220 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 264 transitions. Word has length 60 [2024-10-12 19:59:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:49,224 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 264 transitions. [2024-10-12 19:59:49,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-12 19:59:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 264 transitions. [2024-10-12 19:59:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 19:59:49,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:49,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:49,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:59:49,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:49,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1362282236, now seen corresponding path program 1 times [2024-10-12 19:59:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460078814] [2024-10-12 19:59:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:49,348 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-12 19:59:49,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:49,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460078814] [2024-10-12 19:59:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460078814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:49,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:49,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:59:49,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373590717] [2024-10-12 19:59:49,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:49,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:59:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:49,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:59:49,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:49,352 INFO L87 Difference]: Start difference. First operand 169 states and 264 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-12 19:59:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:49,386 INFO L93 Difference]: Finished difference Result 383 states and 620 transitions. [2024-10-12 19:59:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:59:49,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 19:59:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:49,390 INFO L225 Difference]: With dead ends: 383 [2024-10-12 19:59:49,391 INFO L226 Difference]: Without dead ends: 269 [2024-10-12 19:59:49,392 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-12 19:59:49,393 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 84 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:49,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 324 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:59:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-12 19:59:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2024-10-12 19:59:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5984848484848484) internal successors, (422), 264 states have internal predecessors, (422), 0 states have call successors, (0), 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-12 19:59:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 422 transitions. [2024-10-12 19:59:49,423 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 422 transitions. Word has length 62 [2024-10-12 19:59:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:49,424 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 422 transitions. [2024-10-12 19:59:49,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-12 19:59:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 422 transitions. [2024-10-12 19:59:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 19:59:49,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:49,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:49,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:59:49,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:49,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash -677250468, now seen corresponding path program 1 times [2024-10-12 19:59:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:49,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139599432] [2024-10-12 19:59:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:49,573 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-12 19:59:49,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:49,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139599432] [2024-10-12 19:59:49,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139599432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:49,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:49,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:59:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379656514] [2024-10-12 19:59:49,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:49,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:59:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:49,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:59:49,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:49,580 INFO L87 Difference]: Start difference. First operand 265 states and 422 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-12 19:59:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:49,619 INFO L93 Difference]: Finished difference Result 657 states and 1068 transitions. [2024-10-12 19:59:49,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:59:49,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 19:59:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:49,623 INFO L225 Difference]: With dead ends: 657 [2024-10-12 19:59:49,623 INFO L226 Difference]: Without dead ends: 447 [2024-10-12 19:59:49,625 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-12 19:59:49,627 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 78 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:49,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 325 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:59:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-12 19:59:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2024-10-12 19:59:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.6045454545454545) internal successors, (706), 440 states have internal predecessors, (706), 0 states have call successors, (0), 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-12 19:59:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 706 transitions. [2024-10-12 19:59:49,658 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 706 transitions. Word has length 64 [2024-10-12 19:59:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:49,659 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 706 transitions. [2024-10-12 19:59:49,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-12 19:59:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 706 transitions. [2024-10-12 19:59:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 19:59:49,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:49,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:49,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:59:49,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:49,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:49,664 INFO L85 PathProgramCache]: Analyzing trace with hash -338664426, now seen corresponding path program 1 times [2024-10-12 19:59:49,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:49,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838043057] [2024-10-12 19:59:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:49,828 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-12 19:59:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838043057] [2024-10-12 19:59:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838043057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:49,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:49,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:59:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106927829] [2024-10-12 19:59:49,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:49,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:59:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:59:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:59:49,832 INFO L87 Difference]: Start difference. First operand 441 states and 706 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-12 19:59:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:50,017 INFO L93 Difference]: Finished difference Result 1869 states and 3096 transitions. [2024-10-12 19:59:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:59:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-12 19:59:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:50,027 INFO L225 Difference]: With dead ends: 1869 [2024-10-12 19:59:50,028 INFO L226 Difference]: Without dead ends: 1483 [2024-10-12 19:59:50,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:59:50,031 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 726 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:50,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 973 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:59:50,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-10-12 19:59:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 778. [2024-10-12 19:59:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.6216216216216217) internal successors, (1260), 777 states have internal predecessors, (1260), 0 states have call successors, (0), 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-12 19:59:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1260 transitions. [2024-10-12 19:59:50,082 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1260 transitions. Word has length 66 [2024-10-12 19:59:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:50,082 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1260 transitions. [2024-10-12 19:59:50,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-12 19:59:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1260 transitions. [2024-10-12 19:59:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:59:50,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:50,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:50,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:59:50,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:50,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1971383680, now seen corresponding path program 1 times [2024-10-12 19:59:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655565606] [2024-10-12 19:59:50,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:50,204 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-12 19:59:50,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:50,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655565606] [2024-10-12 19:59:50,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655565606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:50,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:50,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:59:50,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275953622] [2024-10-12 19:59:50,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:50,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:59:50,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:50,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:59:50,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:59:50,207 INFO L87 Difference]: Start difference. First operand 778 states and 1260 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-12 19:59:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:50,301 INFO L93 Difference]: Finished difference Result 2263 states and 3739 transitions. [2024-10-12 19:59:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:59:50,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-12 19:59:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:50,308 INFO L225 Difference]: With dead ends: 2263 [2024-10-12 19:59:50,308 INFO L226 Difference]: Without dead ends: 1540 [2024-10-12 19:59:50,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:59:50,310 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 307 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:50,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 513 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:59:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-10-12 19:59:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1150. [2024-10-12 19:59:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.6335944299390774) internal successors, (1877), 1149 states have internal predecessors, (1877), 0 states have call successors, (0), 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-12 19:59:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1877 transitions. [2024-10-12 19:59:50,342 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1877 transitions. Word has length 67 [2024-10-12 19:59:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:50,342 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1877 transitions. [2024-10-12 19:59:50,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-12 19:59:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1877 transitions. [2024-10-12 19:59:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 19:59:50,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:50,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:50,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:59:50,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1040621249, now seen corresponding path program 1 times [2024-10-12 19:59:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269912884] [2024-10-12 19:59:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:50,479 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-12 19:59:50,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:50,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269912884] [2024-10-12 19:59:50,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269912884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:50,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:50,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:59:50,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011296374] [2024-10-12 19:59:50,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:50,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:59:50,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:50,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:59:50,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:59:50,481 INFO L87 Difference]: Start difference. First operand 1150 states and 1877 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-12 19:59:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:50,578 INFO L93 Difference]: Finished difference Result 3331 states and 5497 transitions. [2024-10-12 19:59:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:59:50,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-12 19:59:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:50,587 INFO L225 Difference]: With dead ends: 3331 [2024-10-12 19:59:50,587 INFO L226 Difference]: Without dead ends: 2236 [2024-10-12 19:59:50,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:59:50,590 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 305 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 577 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:50,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 577 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:59:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2024-10-12 19:59:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1681. [2024-10-12 19:59:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1680 states have (on average 1.6333333333333333) internal successors, (2744), 1680 states have internal predecessors, (2744), 0 states have call successors, (0), 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-12 19:59:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2744 transitions. [2024-10-12 19:59:50,655 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2744 transitions. Word has length 68 [2024-10-12 19:59:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:50,656 INFO L471 AbstractCegarLoop]: Abstraction has 1681 states and 2744 transitions. [2024-10-12 19:59:50,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-12 19:59:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2744 transitions. [2024-10-12 19:59:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:59:50,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:50,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:50,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:59:50,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:50,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2048662089, now seen corresponding path program 1 times [2024-10-12 19:59:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:50,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822070770] [2024-10-12 19:59:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:50,770 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-12 19:59:50,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:50,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822070770] [2024-10-12 19:59:50,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822070770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:50,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:50,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:59:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685874922] [2024-10-12 19:59:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:50,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:59:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:50,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:59:50,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:59:50,772 INFO L87 Difference]: Start difference. First operand 1681 states and 2744 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-12 19:59:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:50,879 INFO L93 Difference]: Finished difference Result 4851 states and 7989 transitions. [2024-10-12 19:59:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:59:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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 69 [2024-10-12 19:59:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:50,891 INFO L225 Difference]: With dead ends: 4851 [2024-10-12 19:59:50,891 INFO L226 Difference]: Without dead ends: 3225 [2024-10-12 19:59:50,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:59:50,895 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 303 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 584 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:50,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 584 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:59:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2024-10-12 19:59:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 2437. [2024-10-12 19:59:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2436 states have (on average 1.6313628899835797) internal successors, (3974), 2436 states have internal predecessors, (3974), 0 states have call successors, (0), 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-12 19:59:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3974 transitions. [2024-10-12 19:59:50,962 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3974 transitions. Word has length 69 [2024-10-12 19:59:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:50,962 INFO L471 AbstractCegarLoop]: Abstraction has 2437 states and 3974 transitions. [2024-10-12 19:59:50,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-12 19:59:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3974 transitions. [2024-10-12 19:59:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:59:50,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:50,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:50,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:59:50,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:50,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:50,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1069193331, now seen corresponding path program 1 times [2024-10-12 19:59:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:50,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995144277] [2024-10-12 19:59:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:51,057 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-12 19:59:51,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995144277] [2024-10-12 19:59:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995144277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:51,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:59:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362795395] [2024-10-12 19:59:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:51,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:59:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:59:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:51,059 INFO L87 Difference]: Start difference. First operand 2437 states and 3974 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-12 19:59:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:51,123 INFO L93 Difference]: Finished difference Result 5608 states and 9156 transitions. [2024-10-12 19:59:51,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:59:51,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2024-10-12 19:59:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:51,137 INFO L225 Difference]: With dead ends: 5608 [2024-10-12 19:59:51,138 INFO L226 Difference]: Without dead ends: 3870 [2024-10-12 19:59:51,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:51,141 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 77 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 374 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-12 19:59:51,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 374 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:59:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2024-10-12 19:59:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3868. [2024-10-12 19:59:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3868 states, 3867 states have (on average 1.6141711921386088) internal successors, (6242), 3867 states have internal predecessors, (6242), 0 states have call successors, (0), 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-12 19:59:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 6242 transitions. [2024-10-12 19:59:51,245 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 6242 transitions. Word has length 69 [2024-10-12 19:59:51,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:51,246 INFO L471 AbstractCegarLoop]: Abstraction has 3868 states and 6242 transitions. [2024-10-12 19:59:51,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-12 19:59:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 6242 transitions. [2024-10-12 19:59:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:59:51,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:51,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:51,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:59:51,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:51,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash -999927296, now seen corresponding path program 1 times [2024-10-12 19:59:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406187836] [2024-10-12 19:59:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:51,308 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-12 19:59:51,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:51,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406187836] [2024-10-12 19:59:51,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406187836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:51,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:51,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:59:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18878909] [2024-10-12 19:59:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:51,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:59:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:51,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:59:51,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:51,310 INFO L87 Difference]: Start difference. First operand 3868 states and 6242 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-12 19:59:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:51,443 INFO L93 Difference]: Finished difference Result 8552 states and 13864 transitions. [2024-10-12 19:59:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:59:51,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2024-10-12 19:59:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:51,466 INFO L225 Difference]: With dead ends: 8552 [2024-10-12 19:59:51,467 INFO L226 Difference]: Without dead ends: 5809 [2024-10-12 19:59:51,473 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-12 19:59:51,474 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 83 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 397 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-12 19:59:51,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 397 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:59:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5809 states. [2024-10-12 19:59:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5809 to 5807. [2024-10-12 19:59:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5807 states, 5806 states have (on average 1.6036858422321736) internal successors, (9311), 5806 states have internal predecessors, (9311), 0 states have call successors, (0), 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-12 19:59:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5807 states to 5807 states and 9311 transitions. [2024-10-12 19:59:51,655 INFO L78 Accepts]: Start accepts. Automaton has 5807 states and 9311 transitions. Word has length 69 [2024-10-12 19:59:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:51,655 INFO L471 AbstractCegarLoop]: Abstraction has 5807 states and 9311 transitions. [2024-10-12 19:59:51,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-12 19:59:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5807 states and 9311 transitions. [2024-10-12 19:59:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:59:51,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:51,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:51,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:59:51,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash 610996403, now seen corresponding path program 1 times [2024-10-12 19:59:51,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:51,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203167513] [2024-10-12 19:59:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:51,723 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-12 19:59:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203167513] [2024-10-12 19:59:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203167513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:59:51,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387522456] [2024-10-12 19:59:51,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:59:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:51,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:59:51,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:51,725 INFO L87 Difference]: Start difference. First operand 5807 states and 9311 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-12 19:59:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:51,907 INFO L93 Difference]: Finished difference Result 13153 states and 21350 transitions. [2024-10-12 19:59:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:59:51,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2024-10-12 19:59:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:51,946 INFO L225 Difference]: With dead ends: 13153 [2024-10-12 19:59:51,950 INFO L226 Difference]: Without dead ends: 8874 [2024-10-12 19:59:51,959 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-12 19:59:51,960 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 89 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 412 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-12 19:59:51,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:59:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8874 states. [2024-10-12 19:59:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8874 to 8872. [2024-10-12 19:59:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8872 states, 8871 states have (on average 1.599030548979822) internal successors, (14185), 8871 states have internal predecessors, (14185), 0 states have call successors, (0), 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-12 19:59:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8872 states to 8872 states and 14185 transitions. [2024-10-12 19:59:52,284 INFO L78 Accepts]: Start accepts. Automaton has 8872 states and 14185 transitions. Word has length 69 [2024-10-12 19:59:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:52,284 INFO L471 AbstractCegarLoop]: Abstraction has 8872 states and 14185 transitions. [2024-10-12 19:59:52,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-12 19:59:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8872 states and 14185 transitions. [2024-10-12 19:59:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 19:59:52,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:52,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:59:52,286 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash 192928305, now seen corresponding path program 1 times [2024-10-12 19:59:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:52,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54832678] [2024-10-12 19:59:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:52,479 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-12 19:59:52,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54832678] [2024-10-12 19:59:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54832678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:52,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:59:52,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601432642] [2024-10-12 19:59:52,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:52,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:59:52,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:52,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:59:52,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:59:52,482 INFO L87 Difference]: Start difference. First operand 8872 states and 14185 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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-12 19:59:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:52,754 INFO L93 Difference]: Finished difference Result 17677 states and 28280 transitions. [2024-10-12 19:59:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:59:52,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-12 19:59:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:52,779 INFO L225 Difference]: With dead ends: 17677 [2024-10-12 19:59:52,779 INFO L226 Difference]: Without dead ends: 8874 [2024-10-12 19:59:52,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:59:52,788 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 235 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:52,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 479 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:59:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8874 states. [2024-10-12 19:59:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8874 to 8872. [2024-10-12 19:59:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8872 states, 8871 states have (on average 1.584939691128396) internal successors, (14060), 8871 states have internal predecessors, (14060), 0 states have call successors, (0), 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-12 19:59:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8872 states to 8872 states and 14060 transitions. [2024-10-12 19:59:53,100 INFO L78 Accepts]: Start accepts. Automaton has 8872 states and 14060 transitions. Word has length 71 [2024-10-12 19:59:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:53,100 INFO L471 AbstractCegarLoop]: Abstraction has 8872 states and 14060 transitions. [2024-10-12 19:59:53,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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-12 19:59:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 8872 states and 14060 transitions. [2024-10-12 19:59:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 19:59:53,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:53,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:53,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:59:53,102 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:53,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash -604805220, now seen corresponding path program 1 times [2024-10-12 19:59:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132229687] [2024-10-12 19:59:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:53,340 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-12 19:59:53,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:53,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132229687] [2024-10-12 19:59:53,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132229687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:53,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:53,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:59:53,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130897565] [2024-10-12 19:59:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:53,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:59:53,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:53,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:59:53,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:59:53,344 INFO L87 Difference]: Start difference. First operand 8872 states and 14060 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-12 19:59:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:53,716 INFO L93 Difference]: Finished difference Result 25427 states and 40452 transitions. [2024-10-12 19:59:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:59:53,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-12 19:59:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:53,806 INFO L225 Difference]: With dead ends: 25427 [2024-10-12 19:59:53,807 INFO L226 Difference]: Without dead ends: 16624 [2024-10-12 19:59:53,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:59:53,820 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 229 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:53,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 483 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:59:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16624 states. [2024-10-12 19:59:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16624 to 16622. [2024-10-12 19:59:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16622 states, 16621 states have (on average 1.5698814752421635) internal successors, (26093), 16621 states have internal predecessors, (26093), 0 states have call successors, (0), 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-12 19:59:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16622 states to 16622 states and 26093 transitions. [2024-10-12 19:59:54,279 INFO L78 Accepts]: Start accepts. Automaton has 16622 states and 26093 transitions. Word has length 74 [2024-10-12 19:59:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:54,280 INFO L471 AbstractCegarLoop]: Abstraction has 16622 states and 26093 transitions. [2024-10-12 19:59:54,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-12 19:59:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 16622 states and 26093 transitions. [2024-10-12 19:59:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 19:59:54,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:54,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:54,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:59:54,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:54,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:54,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1583611864, now seen corresponding path program 1 times [2024-10-12 19:59:54,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:54,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703425387] [2024-10-12 19:59:54,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:54,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:54,500 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-12 19:59:54,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:54,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703425387] [2024-10-12 19:59:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703425387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:54,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:59:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955902585] [2024-10-12 19:59:54,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:54,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:59:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:54,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:59:54,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:59:54,503 INFO L87 Difference]: Start difference. First operand 16622 states and 26093 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-12 19:59:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:54,806 INFO L93 Difference]: Finished difference Result 17348 states and 27180 transitions. [2024-10-12 19:59:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:59:54,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-12 19:59:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:54,840 INFO L225 Difference]: With dead ends: 17348 [2024-10-12 19:59:54,840 INFO L226 Difference]: Without dead ends: 17346 [2024-10-12 19:59:54,847 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-12 19:59:54,847 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:54,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 518 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:59:54,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17346 states. [2024-10-12 19:59:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17346 to 17346. [2024-10-12 19:59:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17346 states, 17345 states have (on average 1.5455750936869415) internal successors, (26808), 17345 states have internal predecessors, (26808), 0 states have call successors, (0), 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-12 19:59:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17346 states to 17346 states and 26808 transitions. [2024-10-12 19:59:55,334 INFO L78 Accepts]: Start accepts. Automaton has 17346 states and 26808 transitions. Word has length 75 [2024-10-12 19:59:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:55,335 INFO L471 AbstractCegarLoop]: Abstraction has 17346 states and 26808 transitions. [2024-10-12 19:59:55,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-12 19:59:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17346 states and 26808 transitions. [2024-10-12 19:59:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 19:59:55,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:55,338 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, 1, 1, 1, 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-12 19:59:55,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:59:55,338 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:55,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1304758470, now seen corresponding path program 1 times [2024-10-12 19:59:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:55,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340903654] [2024-10-12 19:59:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:55,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:59:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:55,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340903654] [2024-10-12 19:59:55,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340903654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:55,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:59:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471290066] [2024-10-12 19:59:55,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:55,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:59:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:59:55,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:55,449 INFO L87 Difference]: Start difference. First operand 17346 states and 26808 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-12 19:59:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:56,064 INFO L93 Difference]: Finished difference Result 51789 states and 79970 transitions. [2024-10-12 19:59:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:59:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 19:59:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:56,143 INFO L225 Difference]: With dead ends: 51789 [2024-10-12 19:59:56,144 INFO L226 Difference]: Without dead ends: 34503 [2024-10-12 19:59:56,172 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-12 19:59:56,173 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 116 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:56,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 407 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:59:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34503 states. [2024-10-12 19:59:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34503 to 34501. [2024-10-12 19:59:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34501 states, 34500 states have (on average 1.5310434782608695) internal successors, (52821), 34500 states have internal predecessors, (52821), 0 states have call successors, (0), 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-12 19:59:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34501 states to 34501 states and 52821 transitions. [2024-10-12 19:59:57,038 INFO L78 Accepts]: Start accepts. Automaton has 34501 states and 52821 transitions. Word has length 101 [2024-10-12 19:59:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:57,038 INFO L471 AbstractCegarLoop]: Abstraction has 34501 states and 52821 transitions. [2024-10-12 19:59:57,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-12 19:59:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 34501 states and 52821 transitions. [2024-10-12 19:59:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 19:59:57,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:57,041 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, 1, 1, 1, 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-12 19:59:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:59:57,042 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:57,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1374024505, now seen corresponding path program 1 times [2024-10-12 19:59:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917901431] [2024-10-12 19:59:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:59:57,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917901431] [2024-10-12 19:59:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917901431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:59:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27719418] [2024-10-12 19:59:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:59:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:57,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:59:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:57,130 INFO L87 Difference]: Start difference. First operand 34501 states and 52821 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-12 19:59:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:57,800 INFO L93 Difference]: Finished difference Result 103023 states and 157587 transitions. [2024-10-12 19:59:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:59:57,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 19:59:57,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:58,114 INFO L225 Difference]: With dead ends: 103023 [2024-10-12 19:59:58,114 INFO L226 Difference]: Without dead ends: 68624 [2024-10-12 19:59:58,160 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-12 19:59:58,162 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 102 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:58,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 392 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:59:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68624 states. [2024-10-12 19:59:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68624 to 68622. [2024-10-12 19:59:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68622 states, 68621 states have (on average 1.5163433934218389) internal successors, (104053), 68621 states have internal predecessors, (104053), 0 states have call successors, (0), 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-12 19:59:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68622 states to 68622 states and 104053 transitions. [2024-10-12 19:59:59,786 INFO L78 Accepts]: Start accepts. Automaton has 68622 states and 104053 transitions. Word has length 101 [2024-10-12 19:59:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:59,787 INFO L471 AbstractCegarLoop]: Abstraction has 68622 states and 104053 transitions. [2024-10-12 19:59:59,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-12 19:59:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 68622 states and 104053 transitions. [2024-10-12 19:59:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 19:59:59,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:59,792 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, 1, 1, 1, 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-12 19:59:59,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:59:59,792 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:59,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1310019092, now seen corresponding path program 1 times [2024-10-12 19:59:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187300372] [2024-10-12 19:59:59,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:59:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:59,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187300372] [2024-10-12 19:59:59,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187300372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:59:59,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:59:59,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:59:59,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084983953] [2024-10-12 19:59:59,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:59:59,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:59:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:59:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:59:59,878 INFO L87 Difference]: Start difference. First operand 68622 states and 104053 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:01,593 INFO L93 Difference]: Finished difference Result 204954 states and 310505 transitions. [2024-10-12 20:00:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:01,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:00:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:01,937 INFO L225 Difference]: With dead ends: 204954 [2024-10-12 20:00:01,937 INFO L226 Difference]: Without dead ends: 136528 [2024-10-12 20:00:01,999 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-12 20:00:02,000 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 117 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:02,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 406 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:00:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136528 states. [2024-10-12 20:00:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136528 to 136526. [2024-10-12 20:00:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136526 states, 136525 states have (on average 1.501549166819264) internal successors, (204999), 136525 states have internal predecessors, (204999), 0 states have call successors, (0), 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-12 20:00:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136526 states to 136526 states and 204999 transitions. [2024-10-12 20:00:05,100 INFO L78 Accepts]: Start accepts. Automaton has 136526 states and 204999 transitions. Word has length 101 [2024-10-12 20:00:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:05,100 INFO L471 AbstractCegarLoop]: Abstraction has 136526 states and 204999 transitions. [2024-10-12 20:00:05,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 136526 states and 204999 transitions. [2024-10-12 20:00:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:00:05,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:05,108 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:00:05,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:00:05,108 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:05,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:05,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1325537810, now seen corresponding path program 1 times [2024-10-12 20:00:05,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:05,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033651512] [2024-10-12 20:00:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:05,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:00:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:05,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033651512] [2024-10-12 20:00:05,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033651512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:05,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:05,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736429233] [2024-10-12 20:00:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:05,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:05,199 INFO L87 Difference]: Start difference. First operand 136526 states and 204999 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:08,364 INFO L93 Difference]: Finished difference Result 407782 states and 611758 transitions. [2024-10-12 20:00:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:00:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:09,020 INFO L225 Difference]: With dead ends: 407782 [2024-10-12 20:00:09,020 INFO L226 Difference]: Without dead ends: 271656 [2024-10-12 20:00:09,130 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-12 20:00:09,130 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 136 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:09,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 423 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271656 states. [2024-10-12 20:00:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271656 to 271654. [2024-10-12 20:00:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271654 states, 271653 states have (on average 1.4866612921631641) internal successors, (403856), 271653 states have internal predecessors, (403856), 0 states have call successors, (0), 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-12 20:00:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271654 states to 271654 states and 403856 transitions. [2024-10-12 20:00:15,692 INFO L78 Accepts]: Start accepts. Automaton has 271654 states and 403856 transitions. Word has length 101 [2024-10-12 20:00:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:15,693 INFO L471 AbstractCegarLoop]: Abstraction has 271654 states and 403856 transitions. [2024-10-12 20:00:15,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 271654 states and 403856 transitions. [2024-10-12 20:00:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:00:15,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:15,710 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, 1, 1, 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-12 20:00:15,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:00:15,710 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2072036208, now seen corresponding path program 1 times [2024-10-12 20:00:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:15,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063142796] [2024-10-12 20:00:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:00:15,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:15,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063142796] [2024-10-12 20:00:15,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063142796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:15,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:15,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549604599] [2024-10-12 20:00:15,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:15,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:15,783 INFO L87 Difference]: Start difference. First operand 271654 states and 403856 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:00:20,619 INFO L93 Difference]: Finished difference Result 571874 states and 856070 transitions. [2024-10-12 20:00:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:00:20,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:00:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:00:21,556 INFO L225 Difference]: With dead ends: 571874 [2024-10-12 20:00:21,556 INFO L226 Difference]: Without dead ends: 438752 [2024-10-12 20:00:22,186 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-12 20:00:22,191 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 67 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:00:22,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 326 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:00:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438752 states. [2024-10-12 20:00:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438752 to 437986. [2024-10-12 20:00:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437986 states, 437985 states have (on average 1.4883066771693094) internal successors, (651856), 437985 states have internal predecessors, (651856), 0 states have call successors, (0), 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-12 20:00:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437986 states to 437986 states and 651856 transitions. [2024-10-12 20:00:31,610 INFO L78 Accepts]: Start accepts. Automaton has 437986 states and 651856 transitions. Word has length 101 [2024-10-12 20:00:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:00:31,611 INFO L471 AbstractCegarLoop]: Abstraction has 437986 states and 651856 transitions. [2024-10-12 20:00:31,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:00:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 437986 states and 651856 transitions. [2024-10-12 20:00:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:00:31,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:00:31,628 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, 1, 1, 1, 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-12 20:00:31,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:00:31,629 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:00:31,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:00:31,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1895335102, now seen corresponding path program 1 times [2024-10-12 20:00:31,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:00:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065810673] [2024-10-12 20:00:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:00:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:00:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:00:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 20:00:31,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:00:31,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065810673] [2024-10-12 20:00:31,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065810673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:00:31,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:00:31,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:00:31,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206299915] [2024-10-12 20:00:31,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:00:31,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:00:31,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:00:31,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:00:31,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:00:31,707 INFO L87 Difference]: Start difference. First operand 437986 states and 651856 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)