./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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:25:48,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:25:48,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:25:48,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:25:48,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:25:48,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:25:48,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:25:48,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:25:48,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:25:48,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:25:48,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:25:48,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:25:48,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:25:48,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:25:48,100 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:25:48,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:25:48,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:25:48,104 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:25:48,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:25:48,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:25:48,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:25:48,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:25:48,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:25:48,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:25:48,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:25:48,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:25:48,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:25:48,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:25:48,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:25:48,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:25:48,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:25:48,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:25:48,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:25:48,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:25:48,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:25:48,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:25:48,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:25:48,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:25:48,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:25:48,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:25:48,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:25:48,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:25:48,109 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-clean/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-clean/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 -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c [2024-10-11 03:25:48,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:25:48,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:25:48,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:25:48,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:25:48,405 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:25:48,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-10-11 03:25:49,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:25:50,207 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:25:50,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-10-11 03:25:50,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8bd74cc93/4339d75ad08b41fca5e7302639cb3926/FLAG31b8cd4bd [2024-10-11 03:25:50,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8bd74cc93/4339d75ad08b41fca5e7302639cb3926 [2024-10-11 03:25:50,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:25:50,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:25:50,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:25:50,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:25:50,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:25:50,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76153e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50, skipping insertion in model container [2024-10-11 03:25:50,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:25:50,665 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2024-10-11 03:25:50,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:25:50,677 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:25:50,743 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2024-10-11 03:25:50,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:25:50,766 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:25:50,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50 WrapperNode [2024-10-11 03:25:50,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:25:50,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:25:50,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:25:50,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:25:50,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,823 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 496 [2024-10-11 03:25:50,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:25:50,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:25:50,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:25:50,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:25:50,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,870 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-11 03:25:50,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:25:50,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:25:50,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:25:50,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:25:50,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2024-10-11 03:25:50,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:25:50,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:25:50,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:25:50,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:25:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:25:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:25:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:25:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:25:51,115 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:25:51,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:25:51,674 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-11 03:25:51,674 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:25:51,748 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:25:51,749 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:25:51,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:51 BoogieIcfgContainer [2024-10-11 03:25:51,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:25:51,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:25:51,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:25:51,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:25:51,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:25:50" (1/3) ... [2024-10-11 03:25:51,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9228fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:51, skipping insertion in model container [2024-10-11 03:25:51,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (2/3) ... [2024-10-11 03:25:51,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9228fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:51, skipping insertion in model container [2024-10-11 03:25:51,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:51" (3/3) ... [2024-10-11 03:25:51,757 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-10-11 03:25:51,771 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:25:51,771 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:25:51,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:25:51,840 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;@6e6ab892, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:25:51,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:25:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.8) internal successors, (234), 131 states have internal predecessors, (234), 0 states have call successors, (0), 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-11 03:25:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:25:51,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:51,852 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-11 03:25:51,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:51,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 224379031, now seen corresponding path program 1 times [2024-10-11 03:25:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:51,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81971937] [2024-10-11 03:25:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:52,167 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-11 03:25:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:52,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81971937] [2024-10-11 03:25:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81971937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:25:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12837152] [2024-10-11 03:25:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:52,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:25:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:25:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:25:52,200 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.8) internal successors, (234), 131 states have internal predecessors, (234), 0 states have call successors, (0), 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-11 03:25:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:52,242 INFO L93 Difference]: Finished difference Result 205 states and 361 transitions. [2024-10-11 03:25:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:25:52,245 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-11 03:25:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:52,254 INFO L225 Difference]: With dead ends: 205 [2024-10-11 03:25:52,254 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 03:25:52,257 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-11 03:25:52,261 INFO L432 NwaCegarLoop]: 226 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, 226 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-11 03:25:52,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 03:25:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 03:25:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.7751937984496124) internal successors, (229), 129 states have internal predecessors, (229), 0 states have call successors, (0), 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-11 03:25:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 229 transitions. [2024-10-11 03:25:52,305 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 229 transitions. Word has length 34 [2024-10-11 03:25:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:52,306 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 229 transitions. [2024-10-11 03:25:52,306 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-11 03:25:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 229 transitions. [2024-10-11 03:25:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:25:52,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:52,308 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-11 03:25:52,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:25:52,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:52,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1464564711, now seen corresponding path program 1 times [2024-10-11 03:25:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:52,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942543213] [2024-10-11 03:25:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:52,480 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-11 03:25:52,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942543213] [2024-10-11 03:25:52,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942543213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:52,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:52,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:52,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59169442] [2024-10-11 03:25:52,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:52,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:52,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:52,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:52,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:52,483 INFO L87 Difference]: Start difference. First operand 130 states and 229 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-11 03:25:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:52,547 INFO L93 Difference]: Finished difference Result 205 states and 355 transitions. [2024-10-11 03:25:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:52,548 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-11 03:25:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:52,549 INFO L225 Difference]: With dead ends: 205 [2024-10-11 03:25:52,549 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 03:25:52,550 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-11 03:25:52,550 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:52,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 645 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:52,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 03:25:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 03:25:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.5426356589147288) internal successors, (199), 129 states have internal predecessors, (199), 0 states have call successors, (0), 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-11 03:25:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 199 transitions. [2024-10-11 03:25:52,564 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 199 transitions. Word has length 34 [2024-10-11 03:25:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:52,565 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 199 transitions. [2024-10-11 03:25:52,565 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-11 03:25:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2024-10-11 03:25:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:25:52,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:52,567 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] [2024-10-11 03:25:52,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:25:52,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:52,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:52,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1940708535, now seen corresponding path program 1 times [2024-10-11 03:25:52,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:52,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953434131] [2024-10-11 03:25:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:52,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:52,742 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-11 03:25:52,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:52,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953434131] [2024-10-11 03:25:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953434131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:52,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:52,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734774952] [2024-10-11 03:25:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:52,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:52,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:52,746 INFO L87 Difference]: Start difference. First operand 130 states and 199 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-11 03:25:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:52,806 INFO L93 Difference]: Finished difference Result 260 states and 419 transitions. [2024-10-11 03:25:52,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:52,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-11 03:25:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:52,810 INFO L225 Difference]: With dead ends: 260 [2024-10-11 03:25:52,810 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 03:25:52,811 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-11 03:25:52,812 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 96 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:52,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 336 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:52,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 03:25:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-10-11 03:25:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.565217391304348) internal successors, (288), 184 states have internal predecessors, (288), 0 states have call successors, (0), 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-11 03:25:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 288 transitions. [2024-10-11 03:25:52,822 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 288 transitions. Word has length 63 [2024-10-11 03:25:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:52,823 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 288 transitions. [2024-10-11 03:25:52,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-11 03:25:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 288 transitions. [2024-10-11 03:25:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:25:52,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:52,825 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] [2024-10-11 03:25:52,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:25:52,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:52,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1714080695, now seen corresponding path program 1 times [2024-10-11 03:25:52,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:52,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248675717] [2024-10-11 03:25:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:52,968 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-11 03:25:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:52,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248675717] [2024-10-11 03:25:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248675717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:52,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:52,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113093104] [2024-10-11 03:25:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:52,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:52,972 INFO L87 Difference]: Start difference. First operand 185 states and 288 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:53,011 INFO L93 Difference]: Finished difference Result 423 states and 684 transitions. [2024-10-11 03:25:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:53,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 03:25:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:53,015 INFO L225 Difference]: With dead ends: 423 [2024-10-11 03:25:53,015 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 03:25:53,017 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-11 03:25:53,019 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 98 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 357 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-11 03:25:53,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 357 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 03:25:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-10-11 03:25:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.597938144329897) internal successors, (465), 291 states have internal predecessors, (465), 0 states have call successors, (0), 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-11 03:25:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 465 transitions. [2024-10-11 03:25:53,049 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 465 transitions. Word has length 65 [2024-10-11 03:25:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:53,050 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 465 transitions. [2024-10-11 03:25:53,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 465 transitions. [2024-10-11 03:25:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:25:53,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:53,052 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-11 03:25:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:25:53,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:53,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1557818661, now seen corresponding path program 1 times [2024-10-11 03:25:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:53,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397842479] [2024-10-11 03:25:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:53,166 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-11 03:25:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397842479] [2024-10-11 03:25:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397842479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:53,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840501012] [2024-10-11 03:25:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:53,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:53,172 INFO L87 Difference]: Start difference. First operand 292 states and 465 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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-11 03:25:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:53,206 INFO L93 Difference]: Finished difference Result 728 states and 1187 transitions. [2024-10-11 03:25:53,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:53,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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-11 03:25:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:53,209 INFO L225 Difference]: With dead ends: 728 [2024-10-11 03:25:53,210 INFO L226 Difference]: Without dead ends: 494 [2024-10-11 03:25:53,210 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-11 03:25:53,212 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 92 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 358 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-11 03:25:53,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-11 03:25:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2024-10-11 03:25:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.6119096509240247) internal successors, (785), 487 states have internal predecessors, (785), 0 states have call successors, (0), 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-11 03:25:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 785 transitions. [2024-10-11 03:25:53,237 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 785 transitions. Word has length 67 [2024-10-11 03:25:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:53,237 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 785 transitions. [2024-10-11 03:25:53,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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-11 03:25:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 785 transitions. [2024-10-11 03:25:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:25:53,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:53,239 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-11 03:25:53,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:25:53,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:53,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1377171565, now seen corresponding path program 1 times [2024-10-11 03:25:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870502637] [2024-10-11 03:25:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:53,444 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-11 03:25:53,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:53,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870502637] [2024-10-11 03:25:53,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870502637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:53,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:25:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309042228] [2024-10-11 03:25:53,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:53,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:25:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:53,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:25:53,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:25:53,449 INFO L87 Difference]: Start difference. First operand 488 states and 785 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-11 03:25:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:53,615 INFO L93 Difference]: Finished difference Result 2448 states and 4039 transitions. [2024-10-11 03:25:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:25:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-11 03:25:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:53,630 INFO L225 Difference]: With dead ends: 2448 [2024-10-11 03:25:53,632 INFO L226 Difference]: Without dead ends: 2018 [2024-10-11 03:25:53,634 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-11 03:25:53,635 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 803 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:53,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1126 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2024-10-11 03:25:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 900. [2024-10-11 03:25:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.6251390433815351) internal successors, (1461), 899 states have internal predecessors, (1461), 0 states have call successors, (0), 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-11 03:25:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1461 transitions. [2024-10-11 03:25:53,698 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1461 transitions. Word has length 69 [2024-10-11 03:25:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:53,699 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1461 transitions. [2024-10-11 03:25:53,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-11 03:25:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1461 transitions. [2024-10-11 03:25:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:25:53,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:53,706 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] [2024-10-11 03:25:53,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:25:53,706 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:53,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash -320075454, now seen corresponding path program 1 times [2024-10-11 03:25:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538471322] [2024-10-11 03:25:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:53,834 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-11 03:25:53,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:53,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538471322] [2024-10-11 03:25:53,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538471322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:53,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:53,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:53,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41418243] [2024-10-11 03:25:53,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:53,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:53,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:53,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:53,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:53,838 INFO L87 Difference]: Start difference. First operand 900 states and 1461 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-11 03:25:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:53,934 INFO L93 Difference]: Finished difference Result 3256 states and 5340 transitions. [2024-10-11 03:25:53,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:53,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-11 03:25:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:53,944 INFO L225 Difference]: With dead ends: 3256 [2024-10-11 03:25:53,945 INFO L226 Difference]: Without dead ends: 2414 [2024-10-11 03:25:53,947 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-11 03:25:53,948 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 355 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 566 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-11 03:25:53,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 566 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:53,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2024-10-11 03:25:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1648. [2024-10-11 03:25:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.6265938069216759) internal successors, (2679), 1647 states have internal predecessors, (2679), 0 states have call successors, (0), 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-11 03:25:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2679 transitions. [2024-10-11 03:25:54,030 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2679 transitions. Word has length 70 [2024-10-11 03:25:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:54,030 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2679 transitions. [2024-10-11 03:25:54,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-11 03:25:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2679 transitions. [2024-10-11 03:25:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:25:54,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:54,032 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-11 03:25:54,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:25:54,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:54,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1389673738, now seen corresponding path program 1 times [2024-10-11 03:25:54,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625111921] [2024-10-11 03:25:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:54,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:54,131 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-11 03:25:54,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:54,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625111921] [2024-10-11 03:25:54,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625111921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:54,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:54,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807429704] [2024-10-11 03:25:54,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:54,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:54,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:54,133 INFO L87 Difference]: Start difference. First operand 1648 states and 2679 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-11 03:25:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:54,219 INFO L93 Difference]: Finished difference Result 4854 states and 7956 transitions. [2024-10-11 03:25:54,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:54,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-11 03:25:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:54,228 INFO L225 Difference]: With dead ends: 4854 [2024-10-11 03:25:54,228 INFO L226 Difference]: Without dead ends: 3264 [2024-10-11 03:25:54,230 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-11 03:25:54,231 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 353 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:54,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 640 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2024-10-11 03:25:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 2440. [2024-10-11 03:25:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2439 states have (on average 1.6232062320623206) internal successors, (3959), 2439 states have internal predecessors, (3959), 0 states have call successors, (0), 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-11 03:25:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3959 transitions. [2024-10-11 03:25:54,291 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3959 transitions. Word has length 71 [2024-10-11 03:25:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:54,291 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 3959 transitions. [2024-10-11 03:25:54,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-11 03:25:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3959 transitions. [2024-10-11 03:25:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:25:54,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:54,293 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] [2024-10-11 03:25:54,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:25:54,293 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:54,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash -182030421, now seen corresponding path program 1 times [2024-10-11 03:25:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:54,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503395408] [2024-10-11 03:25:54,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:54,424 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-11 03:25:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503395408] [2024-10-11 03:25:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503395408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:54,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642064661] [2024-10-11 03:25:54,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:54,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:54,429 INFO L87 Difference]: Start difference. First operand 2440 states and 3959 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-11 03:25:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:54,575 INFO L93 Difference]: Finished difference Result 7166 states and 11704 transitions. [2024-10-11 03:25:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:54,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-10-11 03:25:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:54,609 INFO L225 Difference]: With dead ends: 7166 [2024-10-11 03:25:54,613 INFO L226 Difference]: Without dead ends: 4784 [2024-10-11 03:25:54,622 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-11 03:25:54,624 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 351 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 647 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-11 03:25:54,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 647 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2024-10-11 03:25:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 3590. [2024-10-11 03:25:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3590 states, 3589 states have (on average 1.6185567010309279) internal successors, (5809), 3589 states have internal predecessors, (5809), 0 states have call successors, (0), 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-11 03:25:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 5809 transitions. [2024-10-11 03:25:54,848 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 5809 transitions. Word has length 72 [2024-10-11 03:25:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:54,849 INFO L471 AbstractCegarLoop]: Abstraction has 3590 states and 5809 transitions. [2024-10-11 03:25:54,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-11 03:25:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 5809 transitions. [2024-10-11 03:25:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:25:54,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:54,853 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] [2024-10-11 03:25:54,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:25:54,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:54,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash 756120180, now seen corresponding path program 1 times [2024-10-11 03:25:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680329309] [2024-10-11 03:25:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:54,936 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-11 03:25:54,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:54,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680329309] [2024-10-11 03:25:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680329309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:54,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:54,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:54,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813977160] [2024-10-11 03:25:54,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:54,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:54,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:54,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:54,940 INFO L87 Difference]: Start difference. First operand 3590 states and 5809 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11 03:25:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:55,050 INFO L93 Difference]: Finished difference Result 8130 states and 13152 transitions. [2024-10-11 03:25:55,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:55,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-11 03:25:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:55,073 INFO L225 Difference]: With dead ends: 8130 [2024-10-11 03:25:55,073 INFO L226 Difference]: Without dead ends: 5574 [2024-10-11 03:25:55,077 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-11 03:25:55,078 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 91 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 403 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-11 03:25:55,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5574 states. [2024-10-11 03:25:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5574 to 5572. [2024-10-11 03:25:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5572 states, 5571 states have (on average 1.600430802369413) internal successors, (8916), 5571 states have internal predecessors, (8916), 0 states have call successors, (0), 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-11 03:25:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 8916 transitions. [2024-10-11 03:25:55,224 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 8916 transitions. Word has length 73 [2024-10-11 03:25:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:55,224 INFO L471 AbstractCegarLoop]: Abstraction has 5572 states and 8916 transitions. [2024-10-11 03:25:55,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11 03:25:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 8916 transitions. [2024-10-11 03:25:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:25:55,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:55,227 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] [2024-10-11 03:25:55,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:25:55,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:55,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997516, now seen corresponding path program 1 times [2024-10-11 03:25:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:55,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587526077] [2024-10-11 03:25:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:55,309 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-11 03:25:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:55,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587526077] [2024-10-11 03:25:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587526077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:55,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029188829] [2024-10-11 03:25:55,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:55,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:55,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:55,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:55,311 INFO L87 Difference]: Start difference. First operand 5572 states and 8916 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11 03:25:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:55,445 INFO L93 Difference]: Finished difference Result 12198 states and 19542 transitions. [2024-10-11 03:25:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-11 03:25:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:55,480 INFO L225 Difference]: With dead ends: 12198 [2024-10-11 03:25:55,480 INFO L226 Difference]: Without dead ends: 8244 [2024-10-11 03:25:55,486 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-11 03:25:55,487 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 97 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 431 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-11 03:25:55,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8244 states. [2024-10-11 03:25:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8244 to 8242. [2024-10-11 03:25:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8242 states, 8241 states have (on average 1.5845164421793472) internal successors, (13058), 8241 states have internal predecessors, (13058), 0 states have call successors, (0), 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-11 03:25:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8242 states to 8242 states and 13058 transitions. [2024-10-11 03:25:55,689 INFO L78 Accepts]: Start accepts. Automaton has 8242 states and 13058 transitions. Word has length 73 [2024-10-11 03:25:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:55,689 INFO L471 AbstractCegarLoop]: Abstraction has 8242 states and 13058 transitions. [2024-10-11 03:25:55,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11 03:25:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 8242 states and 13058 transitions. [2024-10-11 03:25:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:25:55,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:55,690 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] [2024-10-11 03:25:55,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:25:55,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash -862982156, now seen corresponding path program 1 times [2024-10-11 03:25:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42741956] [2024-10-11 03:25:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:55,767 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-11 03:25:55,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:55,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42741956] [2024-10-11 03:25:55,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42741956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:55,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:55,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:55,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945095766] [2024-10-11 03:25:55,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:55,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:55,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:55,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:55,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:55,770 INFO L87 Difference]: Start difference. First operand 8242 states and 13058 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11 03:25:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:55,991 INFO L93 Difference]: Finished difference Result 19758 states and 31473 transitions. [2024-10-11 03:25:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-11 03:25:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:56,016 INFO L225 Difference]: With dead ends: 19758 [2024-10-11 03:25:56,016 INFO L226 Difference]: Without dead ends: 11592 [2024-10-11 03:25:56,027 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-11 03:25:56,028 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 103 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 451 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-11 03:25:56,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 451 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11592 states. [2024-10-11 03:25:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11592 to 11590. [2024-10-11 03:25:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11590 states, 11589 states have (on average 1.5898697040296834) internal successors, (18425), 11589 states have internal predecessors, (18425), 0 states have call successors, (0), 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-11 03:25:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11590 states to 11590 states and 18425 transitions. [2024-10-11 03:25:56,374 INFO L78 Accepts]: Start accepts. Automaton has 11590 states and 18425 transitions. Word has length 73 [2024-10-11 03:25:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:56,374 INFO L471 AbstractCegarLoop]: Abstraction has 11590 states and 18425 transitions. [2024-10-11 03:25:56,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11 03:25:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 11590 states and 18425 transitions. [2024-10-11 03:25:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:25:56,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:56,375 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-11 03:25:56,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:25:56,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:56,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash -313891277, now seen corresponding path program 1 times [2024-10-11 03:25:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:56,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609685178] [2024-10-11 03:25:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:56,540 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-11 03:25:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:56,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609685178] [2024-10-11 03:25:56,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609685178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:56,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:25:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741485406] [2024-10-11 03:25:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:56,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:25:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:56,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:25:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:25:56,542 INFO L87 Difference]: Start difference. First operand 11590 states and 18425 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-11 03:25:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:56,843 INFO L93 Difference]: Finished difference Result 23106 states and 36749 transitions. [2024-10-11 03:25:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:25:56,843 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-11 03:25:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:56,868 INFO L225 Difference]: With dead ends: 23106 [2024-10-11 03:25:56,869 INFO L226 Difference]: Without dead ends: 11592 [2024-10-11 03:25:56,884 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-11 03:25:56,885 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 280 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 527 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:56,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 527 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11592 states. [2024-10-11 03:25:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11592 to 11590. [2024-10-11 03:25:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11590 states, 11589 states have (on average 1.5769263957200794) internal successors, (18275), 11589 states have internal predecessors, (18275), 0 states have call successors, (0), 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-11 03:25:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11590 states to 11590 states and 18275 transitions. [2024-10-11 03:25:57,192 INFO L78 Accepts]: Start accepts. Automaton has 11590 states and 18275 transitions. Word has length 74 [2024-10-11 03:25:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:57,193 INFO L471 AbstractCegarLoop]: Abstraction has 11590 states and 18275 transitions. [2024-10-11 03:25:57,193 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-11 03:25:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11590 states and 18275 transitions. [2024-10-11 03:25:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:25:57,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:57,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:25:57,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:25:57,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:57,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1838096755, now seen corresponding path program 1 times [2024-10-11 03:25:57,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:57,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291576538] [2024-10-11 03:25:57,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:57,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:57,405 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-11 03:25:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:57,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291576538] [2024-10-11 03:25:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291576538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:57,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:57,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:25:57,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248703724] [2024-10-11 03:25:57,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:57,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:25:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:25:57,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:25:57,407 INFO L87 Difference]: Start difference. First operand 11590 states and 18275 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-11 03:25:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:57,724 INFO L93 Difference]: Finished difference Result 33443 states and 52879 transitions. [2024-10-11 03:25:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:25:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-11 03:25:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:57,766 INFO L225 Difference]: With dead ends: 33443 [2024-10-11 03:25:57,767 INFO L226 Difference]: Without dead ends: 21929 [2024-10-11 03:25:57,789 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-11 03:25:57,790 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 183 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:57,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 531 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21929 states. [2024-10-11 03:25:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21929 to 21927. [2024-10-11 03:25:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21927 states, 21926 states have (on average 1.5639423515461097) internal successors, (34291), 21926 states have internal predecessors, (34291), 0 states have call successors, (0), 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-11 03:25:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21927 states to 21927 states and 34291 transitions. [2024-10-11 03:25:58,397 INFO L78 Accepts]: Start accepts. Automaton has 21927 states and 34291 transitions. Word has length 77 [2024-10-11 03:25:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:58,397 INFO L471 AbstractCegarLoop]: Abstraction has 21927 states and 34291 transitions. [2024-10-11 03:25:58,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-11 03:25:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21927 states and 34291 transitions. [2024-10-11 03:25:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:25:58,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:58,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:25:58,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:25:58,400 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:58,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1131905386, now seen corresponding path program 1 times [2024-10-11 03:25:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379730901] [2024-10-11 03:25:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:58,609 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-11 03:25:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379730901] [2024-10-11 03:25:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379730901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:58,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328459119] [2024-10-11 03:25:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:58,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:58,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:58,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:58,612 INFO L87 Difference]: Start difference. First operand 21927 states and 34291 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 03:25:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:58,880 INFO L93 Difference]: Finished difference Result 22703 states and 35453 transitions. [2024-10-11 03:25:58,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:58,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 03:25:58,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:58,935 INFO L225 Difference]: With dead ends: 22703 [2024-10-11 03:25:58,935 INFO L226 Difference]: Without dead ends: 22701 [2024-10-11 03:25:58,947 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-11 03:25:58,948 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 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-11 03:25:58,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22701 states. [2024-10-11 03:25:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22701 to 22701. [2024-10-11 03:25:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22701 states, 22700 states have (on average 1.5443171806167402) internal successors, (35056), 22700 states have internal predecessors, (35056), 0 states have call successors, (0), 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-11 03:25:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22701 states to 22701 states and 35056 transitions. [2024-10-11 03:25:59,537 INFO L78 Accepts]: Start accepts. Automaton has 22701 states and 35056 transitions. Word has length 78 [2024-10-11 03:25:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:59,537 INFO L471 AbstractCegarLoop]: Abstraction has 22701 states and 35056 transitions. [2024-10-11 03:25:59,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 03:25:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 22701 states and 35056 transitions. [2024-10-11 03:25:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:25:59,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:59,539 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, 1, 1, 1, 1] [2024-10-11 03:25:59,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:25:59,540 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:59,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:59,540 INFO L85 PathProgramCache]: Analyzing trace with hash -89310492, now seen corresponding path program 1 times [2024-10-11 03:25:59,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:59,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484283487] [2024-10-11 03:25:59,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:59,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:25:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:59,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484283487] [2024-10-11 03:25:59,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484283487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:59,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:25:59,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008525901] [2024-10-11 03:25:59,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:59,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:25:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:59,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:25:59,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:25:59,708 INFO L87 Difference]: Start difference. First operand 22701 states and 35056 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-11 03:26:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:00,677 INFO L93 Difference]: Finished difference Result 56824 states and 87972 transitions. [2024-10-11 03:26:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:26:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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 105 [2024-10-11 03:26:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:00,774 INFO L225 Difference]: With dead ends: 56824 [2024-10-11 03:26:00,774 INFO L226 Difference]: Without dead ends: 46298 [2024-10-11 03:26:00,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:26:00,798 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 448 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:00,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 807 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:26:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46298 states. [2024-10-11 03:26:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46298 to 35658. [2024-10-11 03:26:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35658 states, 35657 states have (on average 1.5404548896429873) internal successors, (54928), 35657 states have internal predecessors, (54928), 0 states have call successors, (0), 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-11 03:26:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35658 states to 35658 states and 54928 transitions. [2024-10-11 03:26:01,689 INFO L78 Accepts]: Start accepts. Automaton has 35658 states and 54928 transitions. Word has length 105 [2024-10-11 03:26:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:01,689 INFO L471 AbstractCegarLoop]: Abstraction has 35658 states and 54928 transitions. [2024-10-11 03:26:01,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-11 03:26:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand 35658 states and 54928 transitions. [2024-10-11 03:26:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:26:01,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:01,691 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, 1, 1, 1, 1] [2024-10-11 03:26:01,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:26:01,691 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:01,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1367539108, now seen corresponding path program 1 times [2024-10-11 03:26:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:01,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140758722] [2024-10-11 03:26:01,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:01,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:26:01,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140758722] [2024-10-11 03:26:01,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140758722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:01,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:01,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:26:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914327742] [2024-10-11 03:26:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:01,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:26:01,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:01,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:26:01,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:26:01,817 INFO L87 Difference]: Start difference. First operand 35658 states and 54928 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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-11 03:26:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:02,497 INFO L93 Difference]: Finished difference Result 61072 states and 94572 transitions. [2024-10-11 03:26:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:26:02,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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 105 [2024-10-11 03:26:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:02,610 INFO L225 Difference]: With dead ends: 61072 [2024-10-11 03:26:02,611 INFO L226 Difference]: Without dead ends: 50546 [2024-10-11 03:26:02,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:26:02,642 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 445 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:02,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 858 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:26:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50546 states. [2024-10-11 03:26:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50546 to 48408. [2024-10-11 03:26:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48408 states, 48407 states have (on average 1.5412646931228955) internal successors, (74608), 48407 states have internal predecessors, (74608), 0 states have call successors, (0), 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-11 03:26:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48408 states to 48408 states and 74608 transitions. [2024-10-11 03:26:03,866 INFO L78 Accepts]: Start accepts. Automaton has 48408 states and 74608 transitions. Word has length 105 [2024-10-11 03:26:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:03,866 INFO L471 AbstractCegarLoop]: Abstraction has 48408 states and 74608 transitions. [2024-10-11 03:26:03,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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-11 03:26:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 48408 states and 74608 transitions. [2024-10-11 03:26:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:26:03,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:03,869 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, 1, 1, 1, 1] [2024-10-11 03:26:03,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:26:03,869 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1708412828, now seen corresponding path program 1 times [2024-10-11 03:26:03,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621588796] [2024-10-11 03:26:03,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:04,333 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-11 03:26:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:04,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621588796] [2024-10-11 03:26:04,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621588796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:04,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:04,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:26:04,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495131278] [2024-10-11 03:26:04,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:04,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:26:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:04,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:26:04,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:26:04,336 INFO L87 Difference]: Start difference. First operand 48408 states and 74608 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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-11 03:26:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:05,269 INFO L93 Difference]: Finished difference Result 72065 states and 111602 transitions. [2024-10-11 03:26:05,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:26:05,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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 105 [2024-10-11 03:26:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:05,380 INFO L225 Difference]: With dead ends: 72065 [2024-10-11 03:26:05,381 INFO L226 Difference]: Without dead ends: 58978 [2024-10-11 03:26:05,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:26:05,417 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 438 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:05,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 844 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:26:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58978 states. [2024-10-11 03:26:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58978 to 56840. [2024-10-11 03:26:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56840 states, 56839 states have (on average 1.5429194743046148) internal successors, (87698), 56839 states have internal predecessors, (87698), 0 states have call successors, (0), 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-11 03:26:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56840 states to 56840 states and 87698 transitions. [2024-10-11 03:26:06,913 INFO L78 Accepts]: Start accepts. Automaton has 56840 states and 87698 transitions. Word has length 105 [2024-10-11 03:26:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:06,913 INFO L471 AbstractCegarLoop]: Abstraction has 56840 states and 87698 transitions. [2024-10-11 03:26:06,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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-11 03:26:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 56840 states and 87698 transitions. [2024-10-11 03:26:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:26:06,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:06,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:26:06,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:26:06,916 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:06,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1993407721, now seen corresponding path program 1 times [2024-10-11 03:26:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719012076] [2024-10-11 03:26:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:26:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719012076] [2024-10-11 03:26:06,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719012076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:06,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:06,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:26:06,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247228082] [2024-10-11 03:26:06,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:06,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:26:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:26:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:06,994 INFO L87 Difference]: Start difference. First operand 56840 states and 87698 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-11 03:26:08,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:08,298 INFO L93 Difference]: Finished difference Result 135244 states and 208977 transitions. [2024-10-11 03:26:08,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:26:08,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 106 [2024-10-11 03:26:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:08,504 INFO L225 Difference]: With dead ends: 135244 [2024-10-11 03:26:08,504 INFO L226 Difference]: Without dead ends: 96506 [2024-10-11 03:26:08,561 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-11 03:26:08,562 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 358 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-11 03:26:08,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 358 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:26:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96506 states. [2024-10-11 03:26:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96506 to 96301. [2024-10-11 03:26:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96301 states, 96300 states have (on average 1.5412980269989616) internal successors, (148427), 96300 states have internal predecessors, (148427), 0 states have call successors, (0), 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-11 03:26:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96301 states to 96301 states and 148427 transitions. [2024-10-11 03:26:11,220 INFO L78 Accepts]: Start accepts. Automaton has 96301 states and 148427 transitions. Word has length 106 [2024-10-11 03:26:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:11,220 INFO L471 AbstractCegarLoop]: Abstraction has 96301 states and 148427 transitions. [2024-10-11 03:26:11,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-11 03:26:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 96301 states and 148427 transitions. [2024-10-11 03:26:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:26:11,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:11,224 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:26:11,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:26:11,224 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1483911125, now seen corresponding path program 1 times [2024-10-11 03:26:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:11,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428024032] [2024-10-11 03:26:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:26:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:11,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428024032] [2024-10-11 03:26:11,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428024032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:11,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:11,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:26:11,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147460206] [2024-10-11 03:26:11,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:11,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:26:11,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:11,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:26:11,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:26:11,375 INFO L87 Difference]: Start difference. First operand 96301 states and 148427 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-11 03:26:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:12,857 INFO L93 Difference]: Finished difference Result 177768 states and 274908 transitions. [2024-10-11 03:26:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:26:12,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 106 [2024-10-11 03:26:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:13,155 INFO L225 Difference]: With dead ends: 177768 [2024-10-11 03:26:13,156 INFO L226 Difference]: Without dead ends: 134814 [2024-10-11 03:26:13,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:26:13,474 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 186 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:13,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 659 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:26:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134814 states. [2024-10-11 03:26:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134814 to 130489. [2024-10-11 03:26:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130489 states, 130488 states have (on average 1.5376892894365766) internal successors, (200650), 130488 states have internal predecessors, (200650), 0 states have call successors, (0), 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-11 03:26:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130489 states to 130489 states and 200650 transitions. [2024-10-11 03:26:17,050 INFO L78 Accepts]: Start accepts. Automaton has 130489 states and 200650 transitions. Word has length 106 [2024-10-11 03:26:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:17,051 INFO L471 AbstractCegarLoop]: Abstraction has 130489 states and 200650 transitions. [2024-10-11 03:26:17,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-11 03:26:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand 130489 states and 200650 transitions. [2024-10-11 03:26:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:26:17,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:17,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:26:17,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:26:17,055 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:17,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:17,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2056530323, now seen corresponding path program 1 times [2024-10-11 03:26:17,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:17,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633984338] [2024-10-11 03:26:17,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:17,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:26:17,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633984338] [2024-10-11 03:26:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633984338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:17,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:17,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:26:17,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343721335] [2024-10-11 03:26:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:17,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:26:17,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:26:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:26:17,738 INFO L87 Difference]: Start difference. First operand 130489 states and 200650 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 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-11 03:26:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:19,795 INFO L93 Difference]: Finished difference Result 198433 states and 306539 transitions. [2024-10-11 03:26:19,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:26:19,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 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 107 [2024-10-11 03:26:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:20,198 INFO L225 Difference]: With dead ends: 198433 [2024-10-11 03:26:20,199 INFO L226 Difference]: Without dead ends: 161537 [2024-10-11 03:26:20,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:26:20,264 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 196 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:20,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 595 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:26:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161537 states. [2024-10-11 03:26:23,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161537 to 153021. [2024-10-11 03:26:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153021 states, 153020 states have (on average 1.5370278394981047) internal successors, (235196), 153020 states have internal predecessors, (235196), 0 states have call successors, (0), 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-11 03:26:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153021 states to 153021 states and 235196 transitions. [2024-10-11 03:26:24,416 INFO L78 Accepts]: Start accepts. Automaton has 153021 states and 235196 transitions. Word has length 107 [2024-10-11 03:26:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:24,417 INFO L471 AbstractCegarLoop]: Abstraction has 153021 states and 235196 transitions. [2024-10-11 03:26:24,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 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-11 03:26:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 153021 states and 235196 transitions. [2024-10-11 03:26:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:26:24,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:24,419 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:26:24,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:26:24,420 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:24,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:24,420 INFO L85 PathProgramCache]: Analyzing trace with hash 958573295, now seen corresponding path program 1 times [2024-10-11 03:26:24,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:24,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663844725] [2024-10-11 03:26:24,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:24,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:26:24,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:24,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663844725] [2024-10-11 03:26:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663844725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:24,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:24,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:26:24,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491971022] [2024-10-11 03:26:24,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:24,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:26:24,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:24,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:26:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:24,472 INFO L87 Difference]: Start difference. First operand 153021 states and 235196 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-11 03:26:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:28,234 INFO L93 Difference]: Finished difference Result 323673 states and 498696 transitions. [2024-10-11 03:26:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:26:28,236 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 107 [2024-10-11 03:26:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:28,943 INFO L225 Difference]: With dead ends: 323673 [2024-10-11 03:26:28,944 INFO L226 Difference]: Without dead ends: 251271 [2024-10-11 03:26:29,061 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-11 03:26:29,063 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 359 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-11 03:26:29,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 359 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:26:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251271 states. [2024-10-11 03:26:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251271 to 250537. [2024-10-11 03:26:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250537 states, 250536 states have (on average 1.534933103426254) internal successors, (384556), 250536 states have internal predecessors, (384556), 0 states have call successors, (0), 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-11 03:26:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250537 states to 250537 states and 384556 transitions. [2024-10-11 03:26:35,723 INFO L78 Accepts]: Start accepts. Automaton has 250537 states and 384556 transitions. Word has length 107 [2024-10-11 03:26:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:35,724 INFO L471 AbstractCegarLoop]: Abstraction has 250537 states and 384556 transitions. [2024-10-11 03:26:35,724 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-11 03:26:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 250537 states and 384556 transitions. [2024-10-11 03:26:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:26:35,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:35,731 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:26:35,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:26:35,731 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:35,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash -650969966, now seen corresponding path program 1 times [2024-10-11 03:26:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:35,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963270521] [2024-10-11 03:26:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:26:35,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:35,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963270521] [2024-10-11 03:26:35,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963270521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:35,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:35,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:26:35,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647887582] [2024-10-11 03:26:35,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:35,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:26:35,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:35,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:26:35,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:35,870 INFO L87 Difference]: Start difference. First operand 250537 states and 384556 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-11 03:26:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:43,184 INFO L93 Difference]: Finished difference Result 746538 states and 1143574 transitions. [2024-10-11 03:26:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:26:43,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-11 03:26:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:44,736 INFO L225 Difference]: With dead ends: 746538 [2024-10-11 03:26:44,736 INFO L226 Difference]: Without dead ends: 496071 [2024-10-11 03:26:45,155 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-11 03:26:45,156 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 131 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 440 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-11 03:26:45,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 440 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:26:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496071 states.