./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ed935744e0b15a55a11878fa4d21c1a0b8f1c4098e81aa4afd54cd8910ee834a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:27:48,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:27:48,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:27:48,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:27:48,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:27:48,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:27:48,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:27:48,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:27:48,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:27:48,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:27:48,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:27:48,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:27:48,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:27:48,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:27:48,846 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:27:48,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:27:48,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:27:48,846 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:27:48,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:27:48,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:27:48,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:27:48,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:48,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:48,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:27:48,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:27:48,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:27:48,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:27:48,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:27:48,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:27:48,848 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> ed935744e0b15a55a11878fa4d21c1a0b8f1c4098e81aa4afd54cd8910ee834a [2025-01-09 04:27:49,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:27:49,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:27:49,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:27:49,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:27:49,087 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:27:49,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2025-01-09 04:27:50,170 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e69a3250/09fcf9ee4a714113ac1aa99fc30e2d24/FLAG01dda38f3 [2025-01-09 04:27:50,490 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:27:50,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2025-01-09 04:27:50,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e69a3250/09fcf9ee4a714113ac1aa99fc30e2d24/FLAG01dda38f3 [2025-01-09 04:27:50,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e69a3250/09fcf9ee4a714113ac1aa99fc30e2d24 [2025-01-09 04:27:50,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:27:50,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:27:50,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:50,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:27:50,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:27:50,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:50" (1/1) ... [2025-01-09 04:27:50,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:50, skipping insertion in model container [2025-01-09 04:27:50,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:50" (1/1) ... [2025-01-09 04:27:50,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:27:51,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c[26792,26805] [2025-01-09 04:27:51,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:51,058 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:27:51,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c[26792,26805] [2025-01-09 04:27:51,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:51,119 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:27:51,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51 WrapperNode [2025-01-09 04:27:51,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:51,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:51,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:27:51,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:27:51,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,163 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 996 [2025-01-09 04:27:51,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:51,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:27:51,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:27:51,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:27:51,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,188 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]. [2025-01-09 04:27:51,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:27:51,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:27:51,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:27:51,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:27:51,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (1/1) ... [2025-01-09 04:27:51,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:51,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:27:51,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:27:51,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:27:51,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:27:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:27:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:27:51,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:27:51,394 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:27:51,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:27:52,310 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-01-09 04:27:52,310 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:27:52,325 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:27:52,325 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:27:52,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:52 BoogieIcfgContainer [2025-01-09 04:27:52,325 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:27:52,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:27:52,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:27:52,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:27:52,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:27:50" (1/3) ... [2025-01-09 04:27:52,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca1d297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:52, skipping insertion in model container [2025-01-09 04:27:52,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:51" (2/3) ... [2025-01-09 04:27:52,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca1d297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:52, skipping insertion in model container [2025-01-09 04:27:52,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:52" (3/3) ... [2025-01-09 04:27:52,332 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2025-01-09 04:27:52,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:27:52,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 295 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:27:52,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:27:52,394 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;@799bf5f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:27:52,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:27:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 293 states have (on average 1.8156996587030716) internal successors, (532), 294 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:27:52,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:52,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:52,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:52,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash 439742344, now seen corresponding path program 1 times [2025-01-09 04:27:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:52,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770156783] [2025-01-09 04:27:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:52,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:27:52,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:27:52,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:52,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770156783] [2025-01-09 04:27:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770156783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:52,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:52,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:27:52,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611728306] [2025-01-09 04:27:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:52,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:27:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:52,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:27:52,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:27:52,856 INFO L87 Difference]: Start difference. First operand has 295 states, 293 states have (on average 1.8156996587030716) internal successors, (532), 294 states have internal predecessors, (532), 0 states have call successors, (0), 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 38.5) internal successors, (77), 2 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) [2025-01-09 04:27:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:52,895 INFO L93 Difference]: Finished difference Result 404 states and 724 transitions. [2025-01-09 04:27:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:27:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 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 [2025-01-09 04:27:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:52,906 INFO L225 Difference]: With dead ends: 404 [2025-01-09 04:27:52,907 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 04:27:52,910 INFO L434 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 [2025-01-09 04:27:52,916 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:52,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 04:27:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-01-09 04:27:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.8109965635738832) internal successors, (527), 291 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 527 transitions. [2025-01-09 04:27:52,955 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 527 transitions. Word has length 77 [2025-01-09 04:27:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:52,956 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 527 transitions. [2025-01-09 04:27:52,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 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) [2025-01-09 04:27:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 527 transitions. [2025-01-09 04:27:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:27:52,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:52,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:52,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:27:52,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:52,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 305728838, now seen corresponding path program 1 times [2025-01-09 04:27:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:52,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778337791] [2025-01-09 04:27:52,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:52,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:27:53,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:27:53,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:53,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:53,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:53,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778337791] [2025-01-09 04:27:53,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778337791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:53,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:53,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:53,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129852629] [2025-01-09 04:27:53,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:53,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:53,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:53,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:53,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:53,353 INFO L87 Difference]: Start difference. First operand 292 states and 527 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) [2025-01-09 04:27:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:53,460 INFO L93 Difference]: Finished difference Result 404 states and 720 transitions. [2025-01-09 04:27:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:53,461 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 [2025-01-09 04:27:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:53,462 INFO L225 Difference]: With dead ends: 404 [2025-01-09 04:27:53,464 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 04:27:53,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:53,465 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 0 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:53,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2061 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 04:27:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-01-09 04:27:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.6941580756013745) internal successors, (493), 291 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 493 transitions. [2025-01-09 04:27:53,478 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 493 transitions. Word has length 77 [2025-01-09 04:27:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:53,479 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 493 transitions. [2025-01-09 04:27:53,479 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) [2025-01-09 04:27:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 493 transitions. [2025-01-09 04:27:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:27:53,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:53,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:53,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:27:53,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:53,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:53,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1106632206, now seen corresponding path program 1 times [2025-01-09 04:27:53,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:53,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921805405] [2025-01-09 04:27:53,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:53,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:53,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:27:53,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:27:53,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:53,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:53,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:53,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921805405] [2025-01-09 04:27:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921805405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:53,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:53,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167927302] [2025-01-09 04:27:53,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:53,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:53,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:53,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:53,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:53,715 INFO L87 Difference]: Start difference. First operand 292 states and 493 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:53,766 INFO L93 Difference]: Finished difference Result 496 states and 849 transitions. [2025-01-09 04:27:53,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:53,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-01-09 04:27:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:53,771 INFO L225 Difference]: With dead ends: 496 [2025-01-09 04:27:53,771 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 04:27:53,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:53,772 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 158 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:53,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 934 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 04:27:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2025-01-09 04:27:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.6979166666666667) internal successors, (652), 384 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 652 transitions. [2025-01-09 04:27:53,796 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 652 transitions. Word has length 110 [2025-01-09 04:27:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:53,796 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 652 transitions. [2025-01-09 04:27:53,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 652 transitions. [2025-01-09 04:27:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 04:27:53,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:53,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:53,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:27:53,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:53,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash -512463730, now seen corresponding path program 1 times [2025-01-09 04:27:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:53,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200633071] [2025-01-09 04:27:53,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:53,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:53,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 04:27:53,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 04:27:53,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:53,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200633071] [2025-01-09 04:27:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200633071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:53,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:53,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289418684] [2025-01-09 04:27:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:53,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:53,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:53,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:53,988 INFO L87 Difference]: Start difference. First operand 385 states and 652 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:54,022 INFO L93 Difference]: Finished difference Result 767 states and 1312 transitions. [2025-01-09 04:27:54,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:54,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-01-09 04:27:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:54,024 INFO L225 Difference]: With dead ends: 767 [2025-01-09 04:27:54,024 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 04:27:54,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:54,029 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 159 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:54,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 947 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 04:27:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 562. [2025-01-09 04:27:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.7058823529411764) internal successors, (957), 561 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 957 transitions. [2025-01-09 04:27:54,049 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 957 transitions. Word has length 113 [2025-01-09 04:27:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:54,049 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 957 transitions. [2025-01-09 04:27:54,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 957 transitions. [2025-01-09 04:27:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 04:27:54,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:54,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:54,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:27:54,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:54,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:54,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1267173150, now seen corresponding path program 1 times [2025-01-09 04:27:54,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:54,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935481059] [2025-01-09 04:27:54,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:54,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:27:54,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:27:54,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:54,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:54,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:54,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935481059] [2025-01-09 04:27:54,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935481059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102497085] [2025-01-09 04:27:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:54,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:54,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:54,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:54,243 INFO L87 Difference]: Start difference. First operand 562 states and 957 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:54,313 INFO L93 Difference]: Finished difference Result 1278 states and 2191 transitions. [2025-01-09 04:27:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:54,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-01-09 04:27:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:54,323 INFO L225 Difference]: With dead ends: 1278 [2025-01-09 04:27:54,323 INFO L226 Difference]: Without dead ends: 900 [2025-01-09 04:27:54,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:54,324 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 152 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:54,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 948 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-01-09 04:27:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 894. [2025-01-09 04:27:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.707726763717805) internal successors, (1525), 893 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1525 transitions. [2025-01-09 04:27:54,346 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1525 transitions. Word has length 116 [2025-01-09 04:27:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:54,346 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1525 transitions. [2025-01-09 04:27:54,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1525 transitions. [2025-01-09 04:27:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 04:27:54,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:54,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:54,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:27:54,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:54,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:54,349 INFO L85 PathProgramCache]: Analyzing trace with hash 637178682, now seen corresponding path program 1 times [2025-01-09 04:27:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:54,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342067302] [2025-01-09 04:27:54,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:54,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:54,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:27:54,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:27:54,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:54,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342067302] [2025-01-09 04:27:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342067302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389317965] [2025-01-09 04:27:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:54,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:54,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:54,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:54,513 INFO L87 Difference]: Start difference. First operand 894 states and 1525 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:54,552 INFO L93 Difference]: Finished difference Result 2234 states and 3823 transitions. [2025-01-09 04:27:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:54,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-09 04:27:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:54,559 INFO L225 Difference]: With dead ends: 2234 [2025-01-09 04:27:54,559 INFO L226 Difference]: Without dead ends: 1524 [2025-01-09 04:27:54,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:54,561 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 145 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:54,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 949 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-01-09 04:27:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1514. [2025-01-09 04:27:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 1.7032385988103107) internal successors, (2577), 1513 states have internal predecessors, (2577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2577 transitions. [2025-01-09 04:27:54,601 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2577 transitions. Word has length 119 [2025-01-09 04:27:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:54,601 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2577 transitions. [2025-01-09 04:27:54,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2577 transitions. [2025-01-09 04:27:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:27:54,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:54,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:54,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:27:54,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:54,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash -343480246, now seen corresponding path program 1 times [2025-01-09 04:27:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:54,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736763229] [2025-01-09 04:27:54,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:54,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:27:54,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:27:54,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:54,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736763229] [2025-01-09 04:27:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736763229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:27:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682064560] [2025-01-09 04:27:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:54,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:27:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:54,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:27:54,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:27:54,816 INFO L87 Difference]: Start difference. First operand 1514 states and 2577 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:55,073 INFO L93 Difference]: Finished difference Result 7782 states and 13401 transitions. [2025-01-09 04:27:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:27:55,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-01-09 04:27:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:55,095 INFO L225 Difference]: With dead ends: 7782 [2025-01-09 04:27:55,095 INFO L226 Difference]: Without dead ends: 6452 [2025-01-09 04:27:55,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:27:55,099 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 2015 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2015 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:55,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2015 Valid, 3298 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6452 states. [2025-01-09 04:27:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6452 to 2754. [2025-01-09 04:27:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2754 states, 2753 states have (on average 1.7050490374137304) internal successors, (4694), 2753 states have internal predecessors, (4694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 4694 transitions. [2025-01-09 04:27:55,189 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 4694 transitions. Word has length 122 [2025-01-09 04:27:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:55,190 INFO L471 AbstractCegarLoop]: Abstraction has 2754 states and 4694 transitions. [2025-01-09 04:27:55,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 4694 transitions. [2025-01-09 04:27:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 04:27:55,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:55,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:55,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:27:55,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 142407564, now seen corresponding path program 1 times [2025-01-09 04:27:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450079503] [2025-01-09 04:27:55,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:55,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 04:27:55,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 04:27:55,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:55,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450079503] [2025-01-09 04:27:55,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450079503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:55,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:55,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258214596] [2025-01-09 04:27:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:55,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:55,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:55,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:55,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:55,307 INFO L87 Difference]: Start difference. First operand 2754 states and 4694 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:55,415 INFO L93 Difference]: Finished difference Result 8046 states and 13812 transitions. [2025-01-09 04:27:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:55,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-01-09 04:27:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:55,433 INFO L225 Difference]: With dead ends: 8046 [2025-01-09 04:27:55,434 INFO L226 Difference]: Without dead ends: 5476 [2025-01-09 04:27:55,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:55,438 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 547 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:55,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1582 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2025-01-09 04:27:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 4098. [2025-01-09 04:27:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.707835001220405) internal successors, (6997), 4097 states have internal predecessors, (6997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 6997 transitions. [2025-01-09 04:27:55,580 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 6997 transitions. Word has length 123 [2025-01-09 04:27:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:55,580 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 6997 transitions. [2025-01-09 04:27:55,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 6997 transitions. [2025-01-09 04:27:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:27:55,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:55,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:55,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:27:55,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:55,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:55,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1805935167, now seen corresponding path program 1 times [2025-01-09 04:27:55,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:55,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128506909] [2025-01-09 04:27:55,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:55,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:27:55,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:27:55,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:55,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:55,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128506909] [2025-01-09 04:27:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128506909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:55,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:55,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:55,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888000819] [2025-01-09 04:27:55,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:55,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:55,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:55,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:55,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:55,716 INFO L87 Difference]: Start difference. First operand 4098 states and 6997 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:55,878 INFO L93 Difference]: Finished difference Result 12020 states and 20592 transitions. [2025-01-09 04:27:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:55,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:27:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:55,902 INFO L225 Difference]: With dead ends: 12020 [2025-01-09 04:27:55,902 INFO L226 Difference]: Without dead ends: 8106 [2025-01-09 04:27:55,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:55,909 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 545 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:55,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1583 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8106 states. [2025-01-09 04:27:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8106 to 6078. [2025-01-09 04:27:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6078 states, 6077 states have (on average 1.7046239921013657) internal successors, (10359), 6077 states have internal predecessors, (10359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6078 states to 6078 states and 10359 transitions. [2025-01-09 04:27:56,045 INFO L78 Accepts]: Start accepts. Automaton has 6078 states and 10359 transitions. Word has length 124 [2025-01-09 04:27:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:56,045 INFO L471 AbstractCegarLoop]: Abstraction has 6078 states and 10359 transitions. [2025-01-09 04:27:56,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6078 states and 10359 transitions. [2025-01-09 04:27:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 04:27:56,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:56,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:56,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:27:56,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:56,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1906013341, now seen corresponding path program 1 times [2025-01-09 04:27:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832436806] [2025-01-09 04:27:56,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:56,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 04:27:56,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 04:27:56,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:56,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:56,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832436806] [2025-01-09 04:27:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832436806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:56,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:56,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:56,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233325017] [2025-01-09 04:27:56,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:56,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:56,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:56,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:56,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:56,202 INFO L87 Difference]: Start difference. First operand 6078 states and 10359 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:56,362 INFO L93 Difference]: Finished difference Result 17900 states and 30600 transitions. [2025-01-09 04:27:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:56,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-01-09 04:27:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:56,394 INFO L225 Difference]: With dead ends: 17900 [2025-01-09 04:27:56,394 INFO L226 Difference]: Without dead ends: 12006 [2025-01-09 04:27:56,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:56,406 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 543 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:56,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1585 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12006 states. [2025-01-09 04:27:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12006 to 9008. [2025-01-09 04:27:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9008 states, 9007 states have (on average 1.7012323748195848) internal successors, (15323), 9007 states have internal predecessors, (15323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 15323 transitions. [2025-01-09 04:27:56,642 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 15323 transitions. Word has length 125 [2025-01-09 04:27:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:56,642 INFO L471 AbstractCegarLoop]: Abstraction has 9008 states and 15323 transitions. [2025-01-09 04:27:56,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 15323 transitions. [2025-01-09 04:27:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:27:56,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:56,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:56,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:27:56,646 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:56,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash 720904412, now seen corresponding path program 1 times [2025-01-09 04:27:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:56,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178926261] [2025-01-09 04:27:56,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:56,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:56,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:27:56,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:27:56,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:56,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178926261] [2025-01-09 04:27:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178926261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:56,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707327484] [2025-01-09 04:27:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:56,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:56,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:56,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:56,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,745 INFO L87 Difference]: Start difference. First operand 9008 states and 15323 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:56,875 INFO L93 Difference]: Finished difference Result 18522 states and 31430 transitions. [2025-01-09 04:27:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:56,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:27:56,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:56,899 INFO L225 Difference]: With dead ends: 18522 [2025-01-09 04:27:56,899 INFO L226 Difference]: Without dead ends: 13470 [2025-01-09 04:27:56,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,906 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 144 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:56,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 995 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13470 states. [2025-01-09 04:27:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13470 to 13468. [2025-01-09 04:27:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13468 states, 13467 states have (on average 1.6866414197668373) internal successors, (22714), 13467 states have internal predecessors, (22714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 22714 transitions. [2025-01-09 04:27:57,125 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 22714 transitions. Word has length 126 [2025-01-09 04:27:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:57,125 INFO L471 AbstractCegarLoop]: Abstraction has 13468 states and 22714 transitions. [2025-01-09 04:27:57,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 22714 transitions. [2025-01-09 04:27:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:27:57,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:57,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:57,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:27:57,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:57,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash -544465096, now seen corresponding path program 1 times [2025-01-09 04:27:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:57,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531080692] [2025-01-09 04:27:57,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:57,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:57,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:27:57,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:27:57,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:57,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:57,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531080692] [2025-01-09 04:27:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531080692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:57,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:57,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:57,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566042168] [2025-01-09 04:27:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:57,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:57,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:57,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:57,230 INFO L87 Difference]: Start difference. First operand 13468 states and 22714 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:57,498 INFO L93 Difference]: Finished difference Result 41676 states and 70565 transitions. [2025-01-09 04:27:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:27:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:57,550 INFO L225 Difference]: With dead ends: 41676 [2025-01-09 04:27:57,551 INFO L226 Difference]: Without dead ends: 28928 [2025-01-09 04:27:57,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:57,572 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 541 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:57,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1585 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28928 states. [2025-01-09 04:27:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28928 to 21150. [2025-01-09 04:27:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21150 states, 21149 states have (on average 1.683956688259492) internal successors, (35614), 21149 states have internal predecessors, (35614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21150 states to 21150 states and 35614 transitions. [2025-01-09 04:27:58,193 INFO L78 Accepts]: Start accepts. Automaton has 21150 states and 35614 transitions. Word has length 126 [2025-01-09 04:27:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:58,194 INFO L471 AbstractCegarLoop]: Abstraction has 21150 states and 35614 transitions. [2025-01-09 04:27:58,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 21150 states and 35614 transitions. [2025-01-09 04:27:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:27:58,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:58,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:58,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:27:58,196 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash 356371064, now seen corresponding path program 1 times [2025-01-09 04:27:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514107815] [2025-01-09 04:27:58,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:58,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:27:58,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:27:58,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:58,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:58,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:58,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514107815] [2025-01-09 04:27:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514107815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:58,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419923693] [2025-01-09 04:27:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:58,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:58,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:58,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:58,272 INFO L87 Difference]: Start difference. First operand 21150 states and 35614 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:58,500 INFO L93 Difference]: Finished difference Result 46844 states and 78924 transitions. [2025-01-09 04:27:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:58,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:27:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:58,693 INFO L225 Difference]: With dead ends: 46844 [2025-01-09 04:27:58,693 INFO L226 Difference]: Without dead ends: 32106 [2025-01-09 04:27:58,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:58,711 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 151 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:58,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1030 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32106 states. [2025-01-09 04:27:59,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32106 to 32104. [2025-01-09 04:27:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32104 states, 32103 states have (on average 1.6751705448088963) internal successors, (53778), 32103 states have internal predecessors, (53778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32104 states to 32104 states and 53778 transitions. [2025-01-09 04:27:59,484 INFO L78 Accepts]: Start accepts. Automaton has 32104 states and 53778 transitions. Word has length 126 [2025-01-09 04:27:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:59,484 INFO L471 AbstractCegarLoop]: Abstraction has 32104 states and 53778 transitions. [2025-01-09 04:27:59,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32104 states and 53778 transitions. [2025-01-09 04:27:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:27:59,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:59,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:59,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:27:59,486 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:59,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash -147891876, now seen corresponding path program 1 times [2025-01-09 04:27:59,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:59,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105841007] [2025-01-09 04:27:59,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:59,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:59,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:27:59,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:27:59,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:59,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105841007] [2025-01-09 04:27:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105841007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:59,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:59,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813281124] [2025-01-09 04:27:59,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:59,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:59,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:59,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:59,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:59,568 INFO L87 Difference]: Start difference. First operand 32104 states and 53778 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:59,876 INFO L93 Difference]: Finished difference Result 71532 states and 119728 transitions. [2025-01-09 04:27:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:59,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:27:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:00,114 INFO L225 Difference]: With dead ends: 71532 [2025-01-09 04:28:00,114 INFO L226 Difference]: Without dead ends: 48890 [2025-01-09 04:28:00,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:00,143 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 158 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:00,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1066 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48890 states. [2025-01-09 04:28:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48890 to 48888. [2025-01-09 04:28:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48888 states, 48887 states have (on average 1.6621187636795058) internal successors, (81256), 48887 states have internal predecessors, (81256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48888 states to 48888 states and 81256 transitions. [2025-01-09 04:28:00,816 INFO L78 Accepts]: Start accepts. Automaton has 48888 states and 81256 transitions. Word has length 126 [2025-01-09 04:28:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:00,816 INFO L471 AbstractCegarLoop]: Abstraction has 48888 states and 81256 transitions. [2025-01-09 04:28:00,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 48888 states and 81256 transitions. [2025-01-09 04:28:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:28:00,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:00,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:00,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:28:00,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:00,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1618083336, now seen corresponding path program 1 times [2025-01-09 04:28:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534514816] [2025-01-09 04:28:00,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:00,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:28:00,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:28:00,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:00,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534514816] [2025-01-09 04:28:00,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534514816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:00,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:00,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213246095] [2025-01-09 04:28:00,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:00,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:00,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:00,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:00,896 INFO L87 Difference]: Start difference. First operand 48888 states and 81256 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:01,725 INFO L93 Difference]: Finished difference Result 110013 states and 183588 transitions. [2025-01-09 04:28:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:01,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:28:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:01,867 INFO L225 Difference]: With dead ends: 110013 [2025-01-09 04:28:01,867 INFO L226 Difference]: Without dead ends: 74752 [2025-01-09 04:28:01,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:01,897 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 165 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:01,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1094 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74752 states. [2025-01-09 04:28:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74752 to 74750. [2025-01-09 04:28:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74750 states, 74749 states have (on average 1.652624115372781) internal successors, (123532), 74749 states have internal predecessors, (123532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74750 states to 74750 states and 123532 transitions. [2025-01-09 04:28:03,491 INFO L78 Accepts]: Start accepts. Automaton has 74750 states and 123532 transitions. Word has length 126 [2025-01-09 04:28:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:03,492 INFO L471 AbstractCegarLoop]: Abstraction has 74750 states and 123532 transitions. [2025-01-09 04:28:03,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 74750 states and 123532 transitions. [2025-01-09 04:28:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:28:03,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:03,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:03,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:28:03,493 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1461099408, now seen corresponding path program 1 times [2025-01-09 04:28:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:03,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357988201] [2025-01-09 04:28:03,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:03,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:28:03,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:28:03,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:03,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357988201] [2025-01-09 04:28:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357988201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:03,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:03,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:03,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182973364] [2025-01-09 04:28:03,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:03,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:03,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:03,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:03,898 INFO L87 Difference]: Start difference. First operand 74750 states and 123532 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:04,721 INFO L93 Difference]: Finished difference Result 149286 states and 246711 transitions. [2025-01-09 04:28:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:04,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-01-09 04:28:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:04,848 INFO L225 Difference]: With dead ends: 149286 [2025-01-09 04:28:04,848 INFO L226 Difference]: Without dead ends: 74752 [2025-01-09 04:28:04,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:28:04,905 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 297 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:04,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1850 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74752 states. [2025-01-09 04:28:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74752 to 74750. [2025-01-09 04:28:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74750 states, 74749 states have (on average 1.6442627995023344) internal successors, (122907), 74749 states have internal predecessors, (122907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74750 states to 74750 states and 122907 transitions. [2025-01-09 04:28:06,232 INFO L78 Accepts]: Start accepts. Automaton has 74750 states and 122907 transitions. Word has length 128 [2025-01-09 04:28:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:06,233 INFO L471 AbstractCegarLoop]: Abstraction has 74750 states and 122907 transitions. [2025-01-09 04:28:06,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 74750 states and 122907 transitions. [2025-01-09 04:28:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:28:06,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:06,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:06,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:28:06,234 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash 833700934, now seen corresponding path program 1 times [2025-01-09 04:28:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:06,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847228303] [2025-01-09 04:28:06,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:06,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:28:06,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:28:06,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:06,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:06,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847228303] [2025-01-09 04:28:06,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847228303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:06,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:06,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475194102] [2025-01-09 04:28:06,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:06,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:06,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:06,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:06,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:06,547 INFO L87 Difference]: Start difference. First operand 74750 states and 122907 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:07,885 INFO L93 Difference]: Finished difference Result 218644 states and 359923 transitions. [2025-01-09 04:28:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:07,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-01-09 04:28:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:08,121 INFO L225 Difference]: With dead ends: 218644 [2025-01-09 04:28:08,122 INFO L226 Difference]: Without dead ends: 144110 [2025-01-09 04:28:08,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:28:08,206 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 438 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:08,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1857 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144110 states. [2025-01-09 04:28:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144110 to 144108. [2025-01-09 04:28:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144108 states, 144107 states have (on average 1.6331753488727125) internal successors, (235352), 144107 states have internal predecessors, (235352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144108 states to 144108 states and 235352 transitions. [2025-01-09 04:28:10,601 INFO L78 Accepts]: Start accepts. Automaton has 144108 states and 235352 transitions. Word has length 131 [2025-01-09 04:28:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:10,601 INFO L471 AbstractCegarLoop]: Abstraction has 144108 states and 235352 transitions. [2025-01-09 04:28:10,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 144108 states and 235352 transitions. [2025-01-09 04:28:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 04:28:10,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:10,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:10,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:28:10,603 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:10,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash -356420199, now seen corresponding path program 1 times [2025-01-09 04:28:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:10,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932459779] [2025-01-09 04:28:10,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:10,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 04:28:10,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 04:28:10,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:10,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:11,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:11,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932459779] [2025-01-09 04:28:11,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932459779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:11,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:11,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:28:11,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807543448] [2025-01-09 04:28:11,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:11,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:28:11,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:11,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:28:11,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:28:11,133 INFO L87 Difference]: Start difference. First operand 144108 states and 235352 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:12,146 INFO L93 Difference]: Finished difference Result 149918 states and 243097 transitions. [2025-01-09 04:28:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:28:12,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-01-09 04:28:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:12,348 INFO L225 Difference]: With dead ends: 149918 [2025-01-09 04:28:12,348 INFO L226 Difference]: Without dead ends: 149916 [2025-01-09 04:28:12,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:28:12,389 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 0 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:12,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1945 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149916 states. [2025-01-09 04:28:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149916 to 149916. [2025-01-09 04:28:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149916 states, 149915 states have (on average 1.6084647967181402) internal successors, (241133), 149915 states have internal predecessors, (241133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149916 states to 149916 states and 241133 transitions. [2025-01-09 04:28:14,824 INFO L78 Accepts]: Start accepts. Automaton has 149916 states and 241133 transitions. Word has length 132 [2025-01-09 04:28:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:14,825 INFO L471 AbstractCegarLoop]: Abstraction has 149916 states and 241133 transitions. [2025-01-09 04:28:14,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 149916 states and 241133 transitions. [2025-01-09 04:28:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 04:28:14,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:14,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:14,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:28:14,829 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:14,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1058173779, now seen corresponding path program 1 times [2025-01-09 04:28:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:14,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016448809] [2025-01-09 04:28:14,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:14,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 04:28:14,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 04:28:14,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:14,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 04:28:15,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:15,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016448809] [2025-01-09 04:28:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016448809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:15,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:15,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368961376] [2025-01-09 04:28:15,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:15,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:15,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:15,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:15,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:15,314 INFO L87 Difference]: Start difference. First operand 149916 states and 241133 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:18,154 INFO L93 Difference]: Finished difference Result 411986 states and 664350 transitions. [2025-01-09 04:28:18,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:18,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-01-09 04:28:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:18,786 INFO L225 Difference]: With dead ends: 411986 [2025-01-09 04:28:18,786 INFO L226 Difference]: Without dead ends: 345484 [2025-01-09 04:28:18,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:28:18,867 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 1227 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:18,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2661 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345484 states. [2025-01-09 04:28:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345484 to 241632. [2025-01-09 04:28:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241632 states, 241631 states have (on average 1.6058163066825035) internal successors, (388015), 241631 states have internal predecessors, (388015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241632 states to 241632 states and 388015 transitions. [2025-01-09 04:28:24,203 INFO L78 Accepts]: Start accepts. Automaton has 241632 states and 388015 transitions. Word has length 170 [2025-01-09 04:28:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:24,204 INFO L471 AbstractCegarLoop]: Abstraction has 241632 states and 388015 transitions. [2025-01-09 04:28:24,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 241632 states and 388015 transitions. [2025-01-09 04:28:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 04:28:24,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:24,207 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:24,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:28:24,207 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:24,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash 693640431, now seen corresponding path program 1 times [2025-01-09 04:28:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:24,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278193827] [2025-01-09 04:28:24,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:24,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 04:28:24,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 04:28:24,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:24,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:28:24,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278193827] [2025-01-09 04:28:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278193827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:24,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:24,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052468443] [2025-01-09 04:28:24,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:24,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:24,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:24,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:24,421 INFO L87 Difference]: Start difference. First operand 241632 states and 388015 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:27,757 INFO L93 Difference]: Finished difference Result 438746 states and 707510 transitions. [2025-01-09 04:28:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:27,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-01-09 04:28:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:28,447 INFO L225 Difference]: With dead ends: 438746 [2025-01-09 04:28:28,447 INFO L226 Difference]: Without dead ends: 372244 [2025-01-09 04:28:28,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:28:28,583 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1116 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:28,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 2773 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372244 states.