./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.cal20.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 4dc4211f2b8131a829ff8e1fa12908da9356d5cadf0e7b793aab2903e0fde547 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:46:25,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:46:25,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 06:46:25,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:46:25,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:46:25,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:46:25,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:46:25,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:46:25,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:46:25,672 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:46:25,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:46:25,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:46:25,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:46:25,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:46:25,674 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:46:25,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:46:25,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:46:25,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:46:25,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:46:25,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:46:25,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:46:25,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:46:25,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:46:25,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:46:25,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:46:25,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:46:25,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:46:25,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:46:25,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:46:25,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:46:25,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:46:25,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:46:25,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:46:25,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:46:25,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:46:25,677 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4dc4211f2b8131a829ff8e1fa12908da9356d5cadf0e7b793aab2903e0fde547 [2025-01-09 06:46:25,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:46:25,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:46:25,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:46:25,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:46:25,930 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:46:25,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c [2025-01-09 06:46:27,160 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8730d43e/e375175cced840e08becf8fa4e12227d/FLAGffb6926c6 [2025-01-09 06:46:27,454 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:46:27,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c [2025-01-09 06:46:27,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8730d43e/e375175cced840e08becf8fa4e12227d/FLAGffb6926c6 [2025-01-09 06:46:27,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8730d43e/e375175cced840e08becf8fa4e12227d [2025-01-09 06:46:27,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:46:27,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:46:27,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:46:27,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:46:27,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:46:27,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:46:27" (1/1) ... [2025-01-09 06:46:27,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbc057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:27, skipping insertion in model container [2025-01-09 06:46:27,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:46:27" (1/1) ... [2025-01-09 06:46:27,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:46:27,907 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/hardware-verification-bv/btor2c-lazyMod.cal20.c[1245,1258] [2025-01-09 06:46:28,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:46:28,167 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:46:28,174 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/hardware-verification-bv/btor2c-lazyMod.cal20.c[1245,1258] [2025-01-09 06:46:28,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:46:28,321 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:46:28,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28 WrapperNode [2025-01-09 06:46:28,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:46:28,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:46:28,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:46:28,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:46:28,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:28,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:28,629 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3556 [2025-01-09 06:46:28,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:46:28,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:46:28,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:46:28,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:46:28,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:28,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:28,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:28,850 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 06:46:28,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:28,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:28,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:28,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:29,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:29,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:29,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:29,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:46:29,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:46:29,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:46:29,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:46:29,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (1/1) ... [2025-01-09 06:46:29,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:46:29,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:46:29,227 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 06:46:29,234 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 06:46:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:46:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:46:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 06:46:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:46:29,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:46:29,484 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:46:29,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:46:32,322 INFO L? ?]: Removed 1995 outVars from TransFormulas that were not future-live. [2025-01-09 06:46:32,323 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:46:32,368 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:46:32,368 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:46:32,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:46:32 BoogieIcfgContainer [2025-01-09 06:46:32,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:46:32,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:46:32,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:46:32,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:46:32,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:46:27" (1/3) ... [2025-01-09 06:46:32,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dc4219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:46:32, skipping insertion in model container [2025-01-09 06:46:32,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:46:28" (2/3) ... [2025-01-09 06:46:32,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dc4219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:46:32, skipping insertion in model container [2025-01-09 06:46:32,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:46:32" (3/3) ... [2025-01-09 06:46:32,376 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal20.c [2025-01-09 06:46:32,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:46:32,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal20.c that has 1 procedures, 1061 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:46:32,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:46:32,449 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;@41891654, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:46:32,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:46:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 1061 states, 1059 states have (on average 1.5004721435316337) internal successors, (1589), 1060 states have internal predecessors, (1589), 0 states have call successors, (0), 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 06:46:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-01-09 06:46:32,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:46:32,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:32,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:46:32,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:46:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash 816103307, now seen corresponding path program 1 times [2025-01-09 06:46:32,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:46:32,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163761875] [2025-01-09 06:46:32,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:46:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:46:32,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-09 06:46:33,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-09 06:46:33,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:46:33,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:46:34,541 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 06:46:34,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:46:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163761875] [2025-01-09 06:46:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163761875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:46:34,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:46:34,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:46:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366480119] [2025-01-09 06:46:34,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:46:34,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:46:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:46:34,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:46:34,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:46:34,570 INFO L87 Difference]: Start difference. First operand has 1061 states, 1059 states have (on average 1.5004721435316337) internal successors, (1589), 1060 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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 06:46:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:46:34,704 INFO L93 Difference]: Finished difference Result 2091 states and 3135 transitions. [2025-01-09 06:46:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:46:34,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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 333 [2025-01-09 06:46:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:46:34,723 INFO L225 Difference]: With dead ends: 2091 [2025-01-09 06:46:34,728 INFO L226 Difference]: Without dead ends: 1060 [2025-01-09 06:46:34,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:46:34,736 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 0 mSDsluCounter, 3160 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4743 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:46:34,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4743 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:46:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-01-09 06:46:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2025-01-09 06:46:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1059 states have (on average 1.498583569405099) internal successors, (1587), 1059 states have internal predecessors, (1587), 0 states have call successors, (0), 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 06:46:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1587 transitions. [2025-01-09 06:46:34,816 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1587 transitions. Word has length 333 [2025-01-09 06:46:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:46:34,817 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1587 transitions. [2025-01-09 06:46:34,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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 06:46:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1587 transitions. [2025-01-09 06:46:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-09 06:46:34,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:46:34,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:34,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:46:34,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:46:34,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:46:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash -468903959, now seen corresponding path program 1 times [2025-01-09 06:46:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:46:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285651675] [2025-01-09 06:46:34,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:46:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:46:34,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-09 06:46:35,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-09 06:46:35,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:46:35,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:46:35,730 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 06:46:35,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:46:35,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285651675] [2025-01-09 06:46:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285651675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:46:35,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:46:35,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:46:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886523374] [2025-01-09 06:46:35,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:46:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:46:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:46:35,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:46:35,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:46:35,735 INFO L87 Difference]: Start difference. First operand 1060 states and 1587 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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 06:46:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:46:35,792 INFO L93 Difference]: Finished difference Result 2092 states and 3133 transitions. [2025-01-09 06:46:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:46:35,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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 334 [2025-01-09 06:46:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:46:35,796 INFO L225 Difference]: With dead ends: 2092 [2025-01-09 06:46:35,796 INFO L226 Difference]: Without dead ends: 1062 [2025-01-09 06:46:35,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:46:35,798 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 0 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4739 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:46:35,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4739 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:46:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-01-09 06:46:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2025-01-09 06:46:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.4976437323279925) internal successors, (1589), 1061 states have internal predecessors, (1589), 0 states have call successors, (0), 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 06:46:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1589 transitions. [2025-01-09 06:46:35,815 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1589 transitions. Word has length 334 [2025-01-09 06:46:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:46:35,815 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1589 transitions. [2025-01-09 06:46:35,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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 06:46:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1589 transitions. [2025-01-09 06:46:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 06:46:35,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:46:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:35,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:46:35,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:46:35,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:46:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1545882660, now seen corresponding path program 1 times [2025-01-09 06:46:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:46:35,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220356681] [2025-01-09 06:46:35,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:46:35,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:46:35,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 06:46:37,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 06:46:37,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:46:37,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:46:39,005 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 06:46:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:46:39,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220356681] [2025-01-09 06:46:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220356681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:46:39,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:46:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:46:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246452659] [2025-01-09 06:46:39,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:46:39,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:46:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:46:39,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:46:39,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:46:39,008 INFO L87 Difference]: Start difference. First operand 1062 states and 1589 transitions. Second operand has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 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 06:46:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:46:39,202 INFO L93 Difference]: Finished difference Result 2734 states and 4091 transitions. [2025-01-09 06:46:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:46:39,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 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 335 [2025-01-09 06:46:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:46:39,208 INFO L225 Difference]: With dead ends: 2734 [2025-01-09 06:46:39,208 INFO L226 Difference]: Without dead ends: 1702 [2025-01-09 06:46:39,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:46:39,210 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 4049 mSDsluCounter, 4691 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4049 SdHoareTripleChecker+Valid, 6254 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:46:39,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4049 Valid, 6254 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:46:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-01-09 06:46:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1683. [2025-01-09 06:46:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.4988109393579072) internal successors, (2521), 1682 states have internal predecessors, (2521), 0 states have call successors, (0), 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 06:46:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2521 transitions. [2025-01-09 06:46:39,243 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2521 transitions. Word has length 335 [2025-01-09 06:46:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:46:39,243 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2521 transitions. [2025-01-09 06:46:39,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 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 06:46:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2521 transitions. [2025-01-09 06:46:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-09 06:46:39,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:46:39,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:39,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:46:39,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:46:39,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:46:39,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1586611152, now seen corresponding path program 1 times [2025-01-09 06:46:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:46:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674759465] [2025-01-09 06:46:39,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:46:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:46:39,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-09 06:46:40,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-09 06:46:40,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:46:40,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:46:44,877 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 06:46:44,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:46:44,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674759465] [2025-01-09 06:46:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674759465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:46:44,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:46:44,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:46:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127476794] [2025-01-09 06:46:44,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:46:44,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:46:44,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:46:44,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:46:44,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:46:44,880 INFO L87 Difference]: Start difference. First operand 1683 states and 2521 transitions. Second operand has 10 states, 10 states have (on average 33.6) internal successors, (336), 10 states have internal predecessors, (336), 0 states have call successors, (0), 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 06:46:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:46:45,490 INFO L93 Difference]: Finished difference Result 4933 states and 7392 transitions. [2025-01-09 06:46:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 06:46:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 33.6) internal successors, (336), 10 states have internal predecessors, (336), 0 states have call successors, (0), 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 336 [2025-01-09 06:46:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:46:45,498 INFO L225 Difference]: With dead ends: 4933 [2025-01-09 06:46:45,499 INFO L226 Difference]: Without dead ends: 1893 [2025-01-09 06:46:45,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-01-09 06:46:45,504 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 4236 mSDsluCounter, 6893 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4236 SdHoareTripleChecker+Valid, 8565 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:46:45,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4236 Valid, 8565 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:46:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2025-01-09 06:46:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1861. [2025-01-09 06:46:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1860 states have (on average 1.499462365591398) internal successors, (2789), 1860 states have internal predecessors, (2789), 0 states have call successors, (0), 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 06:46:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 2789 transitions. [2025-01-09 06:46:45,542 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 2789 transitions. Word has length 336 [2025-01-09 06:46:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:46:45,543 INFO L471 AbstractCegarLoop]: Abstraction has 1861 states and 2789 transitions. [2025-01-09 06:46:45,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.6) internal successors, (336), 10 states have internal predecessors, (336), 0 states have call successors, (0), 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 06:46:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2789 transitions. [2025-01-09 06:46:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 06:46:45,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:46:45,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:45,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:46:45,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:46:45,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:46:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash 941593035, now seen corresponding path program 1 times [2025-01-09 06:46:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:46:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926469892] [2025-01-09 06:46:45,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:46:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:46:45,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 06:46:46,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 06:46:46,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:46:46,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:46:48,745 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 06:46:48,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:46:48,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926469892] [2025-01-09 06:46:48,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926469892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:46:48,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:46:48,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 06:46:48,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852471674] [2025-01-09 06:46:48,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:46:48,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 06:46:48,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:46:48,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 06:46:48,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 06:46:48,748 INFO L87 Difference]: Start difference. First operand 1861 states and 2789 transitions. Second operand has 12 states, 12 states have (on average 28.083333333333332) internal successors, (337), 12 states have internal predecessors, (337), 0 states have call successors, (0), 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 06:46:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:46:50,812 INFO L93 Difference]: Finished difference Result 5246 states and 7864 transitions. [2025-01-09 06:46:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 06:46:50,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 28.083333333333332) internal successors, (337), 12 states have internal predecessors, (337), 0 states have call successors, (0), 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 337 [2025-01-09 06:46:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:46:50,823 INFO L225 Difference]: With dead ends: 5246 [2025-01-09 06:46:50,823 INFO L226 Difference]: Without dead ends: 3622 [2025-01-09 06:46:50,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:46:50,826 INFO L435 NwaCegarLoop]: 1419 mSDtfsCounter, 3108 mSDsluCounter, 9705 mSDsCounter, 0 mSdLazyCounter, 3723 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3108 SdHoareTripleChecker+Valid, 11124 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:46:50,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3108 Valid, 11124 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3723 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 06:46:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-01-09 06:46:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3139. [2025-01-09 06:46:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 3138 states have (on average 1.5) internal successors, (4707), 3138 states have internal predecessors, (4707), 0 states have call successors, (0), 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 06:46:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 4707 transitions. [2025-01-09 06:46:50,889 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 4707 transitions. Word has length 337 [2025-01-09 06:46:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:46:50,890 INFO L471 AbstractCegarLoop]: Abstraction has 3139 states and 4707 transitions. [2025-01-09 06:46:50,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 28.083333333333332) internal successors, (337), 12 states have internal predecessors, (337), 0 states have call successors, (0), 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 06:46:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 4707 transitions. [2025-01-09 06:46:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 06:46:50,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:46:50,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:50,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:46:50,894 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:46:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:46:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -494346716, now seen corresponding path program 1 times [2025-01-09 06:46:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:46:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149381144] [2025-01-09 06:46:50,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:46:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:46:50,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 06:46:51,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 06:46:51,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:46:51,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:46:52,875 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 06:46:52,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:46:52,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149381144] [2025-01-09 06:46:52,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149381144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:46:52,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:46:52,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 06:46:52,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833494724] [2025-01-09 06:46:52,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:46:52,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 06:46:52,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:46:52,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 06:46:52,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:46:52,879 INFO L87 Difference]: Start difference. First operand 3139 states and 4707 transitions. Second operand has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 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 06:46:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:46:53,487 INFO L93 Difference]: Finished difference Result 5944 states and 8908 transitions. [2025-01-09 06:46:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:46:53,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 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 337 [2025-01-09 06:46:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:46:53,496 INFO L225 Difference]: With dead ends: 5944 [2025-01-09 06:46:53,497 INFO L226 Difference]: Without dead ends: 3207 [2025-01-09 06:46:53,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:46:53,501 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1769 mSDsluCounter, 8721 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 10290 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:46:53,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 10290 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:46:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2025-01-09 06:46:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3175. [2025-01-09 06:46:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3174 states have (on average 1.4993698802772526) internal successors, (4759), 3174 states have internal predecessors, (4759), 0 states have call successors, (0), 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 06:46:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4759 transitions. [2025-01-09 06:46:53,550 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4759 transitions. Word has length 337 [2025-01-09 06:46:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:46:53,550 INFO L471 AbstractCegarLoop]: Abstraction has 3175 states and 4759 transitions. [2025-01-09 06:46:53,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 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 06:46:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4759 transitions. [2025-01-09 06:46:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 06:46:53,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:46:53,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:53,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:46:53,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:46:53,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:46:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash 429518870, now seen corresponding path program 1 times [2025-01-09 06:46:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:46:53,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513463898] [2025-01-09 06:46:53,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:46:53,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:46:53,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 06:46:54,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 06:46:54,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:46:54,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:46:55,415 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 06:46:55,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:46:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513463898] [2025-01-09 06:46:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513463898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:46:55,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:46:55,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:46:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985748111] [2025-01-09 06:46:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:46:55,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:46:55,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:46:55,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:46:55,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:46:55,419 INFO L87 Difference]: Start difference. First operand 3175 states and 4759 transitions. Second operand has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 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 06:46:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:46:55,677 INFO L93 Difference]: Finished difference Result 4974 states and 7450 transitions. [2025-01-09 06:46:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:46:55,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 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 337 [2025-01-09 06:46:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:46:55,690 INFO L225 Difference]: With dead ends: 4974 [2025-01-09 06:46:55,694 INFO L226 Difference]: Without dead ends: 3196 [2025-01-09 06:46:55,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:46:55,698 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 4051 mSDsluCounter, 7806 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4051 SdHoareTripleChecker+Valid, 9368 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:46:55,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4051 Valid, 9368 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:46:55,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2025-01-09 06:46:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3178. [2025-01-09 06:46:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3178 states, 3177 states have (on average 1.4992130941139439) internal successors, (4763), 3177 states have internal predecessors, (4763), 0 states have call successors, (0), 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 06:46:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4763 transitions. [2025-01-09 06:46:55,793 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4763 transitions. Word has length 337 [2025-01-09 06:46:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:46:55,793 INFO L471 AbstractCegarLoop]: Abstraction has 3178 states and 4763 transitions. [2025-01-09 06:46:55,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 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 06:46:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4763 transitions. [2025-01-09 06:46:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-01-09 06:46:55,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:46:55,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:55,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:46:55,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:46:55,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:46:55,806 INFO L85 PathProgramCache]: Analyzing trace with hash 749531515, now seen corresponding path program 1 times [2025-01-09 06:46:55,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:46:55,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441200007] [2025-01-09 06:46:55,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:46:55,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:46:55,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 06:46:56,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 06:46:56,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:46:56,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:46:57,746 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 06:46:57,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:46:57,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441200007] [2025-01-09 06:46:57,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441200007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:46:57,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:46:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:46:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956091864] [2025-01-09 06:46:57,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:46:57,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:46:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:46:57,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:46:57,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:46:57,748 INFO L87 Difference]: Start difference. First operand 3178 states and 4763 transitions. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 0 states have call successors, (0), 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 06:46:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:46:58,043 INFO L93 Difference]: Finished difference Result 6644 states and 9953 transitions. [2025-01-09 06:46:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:46:58,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 0 states have call successors, (0), 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 338 [2025-01-09 06:46:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:46:58,051 INFO L225 Difference]: With dead ends: 6644 [2025-01-09 06:46:58,051 INFO L226 Difference]: Without dead ends: 3178 [2025-01-09 06:46:58,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:46:58,055 INFO L435 NwaCegarLoop]: 2177 mSDtfsCounter, 1740 mSDsluCounter, 4753 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 6930 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:46:58,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 6930 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:46:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2025-01-09 06:46:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 3178. [2025-01-09 06:46:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3178 states, 3177 states have (on average 1.4979540446962543) internal successors, (4759), 3177 states have internal predecessors, (4759), 0 states have call successors, (0), 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 06:46:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4759 transitions. [2025-01-09 06:46:58,094 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4759 transitions. Word has length 338 [2025-01-09 06:46:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:46:58,095 INFO L471 AbstractCegarLoop]: Abstraction has 3178 states and 4759 transitions. [2025-01-09 06:46:58,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 0 states have call successors, (0), 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 06:46:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4759 transitions. [2025-01-09 06:46:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-01-09 06:46:58,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:46:58,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:58,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:46:58,099 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:46:58,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:46:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 291563659, now seen corresponding path program 1 times [2025-01-09 06:46:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:46:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864312572] [2025-01-09 06:46:58,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:46:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:46:58,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-01-09 06:46:59,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-01-09 06:46:59,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:46:59,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:00,080 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 06:47:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:00,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864312572] [2025-01-09 06:47:00,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864312572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:00,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:47:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651498409] [2025-01-09 06:47:00,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:00,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:47:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:00,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:47:00,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:47:00,083 INFO L87 Difference]: Start difference. First operand 3178 states and 4759 transitions. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 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 06:47:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:00,582 INFO L93 Difference]: Finished difference Result 7486 states and 11213 transitions. [2025-01-09 06:47:00,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:47:00,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 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 339 [2025-01-09 06:47:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:00,597 INFO L225 Difference]: With dead ends: 7486 [2025-01-09 06:47:00,597 INFO L226 Difference]: Without dead ends: 5430 [2025-01-09 06:47:00,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:47:00,600 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 2591 mSDsluCounter, 5606 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2591 SdHoareTripleChecker+Valid, 7011 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:00,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2591 Valid, 7011 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:47:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5430 states. [2025-01-09 06:47:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5430 to 5326. [2025-01-09 06:47:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5326 states, 5325 states have (on average 1.4987793427230047) internal successors, (7981), 5325 states have internal predecessors, (7981), 0 states have call successors, (0), 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 06:47:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 7981 transitions. [2025-01-09 06:47:00,676 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 7981 transitions. Word has length 339 [2025-01-09 06:47:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:00,677 INFO L471 AbstractCegarLoop]: Abstraction has 5326 states and 7981 transitions. [2025-01-09 06:47:00,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 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 06:47:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 7981 transitions. [2025-01-09 06:47:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-09 06:47:00,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:00,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:00,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:47:00,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:00,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1063288424, now seen corresponding path program 1 times [2025-01-09 06:47:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960320942] [2025-01-09 06:47:00,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:00,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-09 06:47:01,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-09 06:47:01,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:01,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:02,844 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 06:47:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960320942] [2025-01-09 06:47:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960320942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:02,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:02,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 06:47:02,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515524106] [2025-01-09 06:47:02,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:02,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 06:47:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:02,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 06:47:02,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:47:02,847 INFO L87 Difference]: Start difference. First operand 5326 states and 7981 transitions. Second operand has 9 states, 9 states have (on average 37.77777777777778) internal successors, (340), 9 states have internal predecessors, (340), 0 states have call successors, (0), 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 06:47:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:03,085 INFO L93 Difference]: Finished difference Result 8196 states and 12276 transitions. [2025-01-09 06:47:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:47:03,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 37.77777777777778) internal successors, (340), 9 states have internal predecessors, (340), 0 states have call successors, (0), 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 340 [2025-01-09 06:47:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:03,100 INFO L225 Difference]: With dead ends: 8196 [2025-01-09 06:47:03,100 INFO L226 Difference]: Without dead ends: 5344 [2025-01-09 06:47:03,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-09 06:47:03,105 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 4040 mSDsluCounter, 7777 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4040 SdHoareTripleChecker+Valid, 9332 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:03,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4040 Valid, 9332 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:47:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-01-09 06:47:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5330. [2025-01-09 06:47:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5330 states, 5329 states have (on average 1.4985926064927755) internal successors, (7986), 5329 states have internal predecessors, (7986), 0 states have call successors, (0), 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 06:47:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5330 states to 5330 states and 7986 transitions. [2025-01-09 06:47:03,162 INFO L78 Accepts]: Start accepts. Automaton has 5330 states and 7986 transitions. Word has length 340 [2025-01-09 06:47:03,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:03,162 INFO L471 AbstractCegarLoop]: Abstraction has 5330 states and 7986 transitions. [2025-01-09 06:47:03,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.77777777777778) internal successors, (340), 9 states have internal predecessors, (340), 0 states have call successors, (0), 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 06:47:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 5330 states and 7986 transitions. [2025-01-09 06:47:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-01-09 06:47:03,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:03,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:03,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:47:03,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:03,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1332622824, now seen corresponding path program 1 times [2025-01-09 06:47:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:03,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924909605] [2025-01-09 06:47:03,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:03,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-01-09 06:47:04,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-01-09 06:47:04,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:04,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:05,221 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 06:47:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924909605] [2025-01-09 06:47:05,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924909605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:05,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:47:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833871565] [2025-01-09 06:47:05,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:05,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:47:05,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:05,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:47:05,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:47:05,230 INFO L87 Difference]: Start difference. First operand 5330 states and 7986 transitions. Second operand has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 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 06:47:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:05,364 INFO L93 Difference]: Finished difference Result 10200 states and 15268 transitions. [2025-01-09 06:47:05,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:47:05,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 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 341 [2025-01-09 06:47:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:05,374 INFO L225 Difference]: With dead ends: 10200 [2025-01-09 06:47:05,374 INFO L226 Difference]: Without dead ends: 7250 [2025-01-09 06:47:05,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:47:05,377 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 3590 mSDsluCounter, 6263 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3590 SdHoareTripleChecker+Valid, 7833 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:05,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3590 Valid, 7833 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:47:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7250 states. [2025-01-09 06:47:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7250 to 6904. [2025-01-09 06:47:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.4973200057945821) internal successors, (10336), 6903 states have internal predecessors, (10336), 0 states have call successors, (0), 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 06:47:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 10336 transitions. [2025-01-09 06:47:05,432 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 10336 transitions. Word has length 341 [2025-01-09 06:47:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:05,432 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 10336 transitions. [2025-01-09 06:47:05,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 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 06:47:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 10336 transitions. [2025-01-09 06:47:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 06:47:05,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:05,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:05,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:47:05,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:05,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1601012451, now seen corresponding path program 1 times [2025-01-09 06:47:05,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:05,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118663393] [2025-01-09 06:47:05,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:05,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:05,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 06:47:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 06:47:06,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:06,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:07,736 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 06:47:07,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:07,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118663393] [2025-01-09 06:47:07,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118663393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:07,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:47:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476403097] [2025-01-09 06:47:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:07,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:47:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:07,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:47:07,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:47:07,738 INFO L87 Difference]: Start difference. First operand 6904 states and 10336 transitions. Second operand has 10 states, 10 states have (on average 34.2) internal successors, (342), 10 states have internal predecessors, (342), 0 states have call successors, (0), 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 06:47:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:08,935 INFO L93 Difference]: Finished difference Result 10997 states and 16456 transitions. [2025-01-09 06:47:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:47:08,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 34.2) internal successors, (342), 10 states have internal predecessors, (342), 0 states have call successors, (0), 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 342 [2025-01-09 06:47:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:08,947 INFO L225 Difference]: With dead ends: 10997 [2025-01-09 06:47:08,947 INFO L226 Difference]: Without dead ends: 7316 [2025-01-09 06:47:08,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-09 06:47:08,951 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1757 mSDsluCounter, 9742 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 11369 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:08,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 11369 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 06:47:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2025-01-09 06:47:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 6962. [2025-01-09 06:47:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6962 states, 6961 states have (on average 1.4969113633098692) internal successors, (10420), 6961 states have internal predecessors, (10420), 0 states have call successors, (0), 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 06:47:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 10420 transitions. [2025-01-09 06:47:09,009 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 10420 transitions. Word has length 342 [2025-01-09 06:47:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:09,010 INFO L471 AbstractCegarLoop]: Abstraction has 6962 states and 10420 transitions. [2025-01-09 06:47:09,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.2) internal successors, (342), 10 states have internal predecessors, (342), 0 states have call successors, (0), 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 06:47:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 10420 transitions. [2025-01-09 06:47:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 06:47:09,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:09,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:09,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:47:09,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:09,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:09,015 INFO L85 PathProgramCache]: Analyzing trace with hash 743009211, now seen corresponding path program 1 times [2025-01-09 06:47:09,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:09,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734549209] [2025-01-09 06:47:09,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:09,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:09,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 06:47:10,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 06:47:10,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:10,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:10,731 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 06:47:10,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:10,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734549209] [2025-01-09 06:47:10,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734549209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:10,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:47:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323856068] [2025-01-09 06:47:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:10,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:47:10,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:10,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:47:10,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:47:10,734 INFO L87 Difference]: Start difference. First operand 6962 states and 10420 transitions. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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 06:47:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:10,785 INFO L93 Difference]: Finished difference Result 10651 states and 15939 transitions. [2025-01-09 06:47:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:47:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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 342 [2025-01-09 06:47:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:10,795 INFO L225 Difference]: With dead ends: 10651 [2025-01-09 06:47:10,795 INFO L226 Difference]: Without dead ends: 6910 [2025-01-09 06:47:10,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:47:10,800 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 869 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 3612 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:10,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 3612 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:47:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6910 states. [2025-01-09 06:47:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6910 to 5336. [2025-01-09 06:47:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5336 states, 5335 states have (on average 1.497282099343955) internal successors, (7988), 5335 states have internal predecessors, (7988), 0 states have call successors, (0), 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 06:47:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5336 states to 5336 states and 7988 transitions. [2025-01-09 06:47:10,851 INFO L78 Accepts]: Start accepts. Automaton has 5336 states and 7988 transitions. Word has length 342 [2025-01-09 06:47:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:10,851 INFO L471 AbstractCegarLoop]: Abstraction has 5336 states and 7988 transitions. [2025-01-09 06:47:10,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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 06:47:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5336 states and 7988 transitions. [2025-01-09 06:47:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 06:47:10,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:10,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:10,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:47:10,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:10,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash -720470210, now seen corresponding path program 1 times [2025-01-09 06:47:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:10,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942811575] [2025-01-09 06:47:10,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:10,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:10,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 06:47:11,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 06:47:11,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:11,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:12,430 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 06:47:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:12,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942811575] [2025-01-09 06:47:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942811575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:12,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:12,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:47:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688311082] [2025-01-09 06:47:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:12,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:47:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:12,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:47:12,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:47:12,432 INFO L87 Difference]: Start difference. First operand 5336 states and 7988 transitions. Second operand has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 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 06:47:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:12,904 INFO L93 Difference]: Finished difference Result 9794 states and 14643 transitions. [2025-01-09 06:47:12,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 06:47:12,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 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 343 [2025-01-09 06:47:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:12,913 INFO L225 Difference]: With dead ends: 9794 [2025-01-09 06:47:12,916 INFO L226 Difference]: Without dead ends: 6870 [2025-01-09 06:47:12,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 06:47:12,926 INFO L435 NwaCegarLoop]: 2231 mSDtfsCounter, 2518 mSDsluCounter, 8517 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 10748 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:12,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 10748 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:47:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6870 states. [2025-01-09 06:47:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6870 to 6856. [2025-01-09 06:47:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6856 states, 6855 states have (on average 1.4835886214442013) internal successors, (10170), 6855 states have internal predecessors, (10170), 0 states have call successors, (0), 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 06:47:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6856 states to 6856 states and 10170 transitions. [2025-01-09 06:47:13,079 INFO L78 Accepts]: Start accepts. Automaton has 6856 states and 10170 transitions. Word has length 343 [2025-01-09 06:47:13,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:13,079 INFO L471 AbstractCegarLoop]: Abstraction has 6856 states and 10170 transitions. [2025-01-09 06:47:13,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 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 06:47:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6856 states and 10170 transitions. [2025-01-09 06:47:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 06:47:13,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:13,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:13,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:47:13,087 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:13,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1219626416, now seen corresponding path program 1 times [2025-01-09 06:47:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:13,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243752157] [2025-01-09 06:47:13,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:13,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 06:47:13,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 06:47:13,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:13,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:14,716 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 06:47:14,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:14,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243752157] [2025-01-09 06:47:14,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243752157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:14,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:14,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:47:14,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481209228] [2025-01-09 06:47:14,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:14,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:47:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:14,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:47:14,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:47:14,722 INFO L87 Difference]: Start difference. First operand 6856 states and 10170 transitions. Second operand has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 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 06:47:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:15,307 INFO L93 Difference]: Finished difference Result 9816 states and 14596 transitions. [2025-01-09 06:47:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:47:15,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 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 343 [2025-01-09 06:47:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:15,311 INFO L225 Difference]: With dead ends: 9816 [2025-01-09 06:47:15,312 INFO L226 Difference]: Without dead ends: 5352 [2025-01-09 06:47:15,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:47:15,315 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 1297 mSDsluCounter, 4209 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 5493 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:15,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 5493 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:47:15,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5352 states. [2025-01-09 06:47:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5352 to 5348. [2025-01-09 06:47:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5348 states, 5347 states have (on average 1.4961660744342622) internal successors, (8000), 5347 states have internal predecessors, (8000), 0 states have call successors, (0), 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 06:47:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 8000 transitions. [2025-01-09 06:47:15,380 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 8000 transitions. Word has length 343 [2025-01-09 06:47:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:15,381 INFO L471 AbstractCegarLoop]: Abstraction has 5348 states and 8000 transitions. [2025-01-09 06:47:15,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 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 06:47:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 8000 transitions. [2025-01-09 06:47:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-09 06:47:15,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:15,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:15,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:47:15,384 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:15,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash -776582756, now seen corresponding path program 1 times [2025-01-09 06:47:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:15,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134346520] [2025-01-09 06:47:15,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:15,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:15,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 06:47:15,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 06:47:15,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:15,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:16,765 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 06:47:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134346520] [2025-01-09 06:47:16,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134346520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:16,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:16,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:47:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351856432] [2025-01-09 06:47:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:16,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:47:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:16,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:47:16,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:47:16,768 INFO L87 Difference]: Start difference. First operand 5348 states and 8000 transitions. Second operand has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 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 06:47:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:16,961 INFO L93 Difference]: Finished difference Result 11071 states and 16541 transitions. [2025-01-09 06:47:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:47:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2025-01-09 06:47:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:16,976 INFO L225 Difference]: With dead ends: 11071 [2025-01-09 06:47:16,976 INFO L226 Difference]: Without dead ends: 7324 [2025-01-09 06:47:16,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:47:16,984 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 3806 mSDsluCounter, 7834 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3806 SdHoareTripleChecker+Valid, 9404 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:16,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3806 Valid, 9404 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:47:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2025-01-09 06:47:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 6912. [2025-01-09 06:47:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6912 states, 6911 states have (on average 1.4950079583273044) internal successors, (10332), 6911 states have internal predecessors, (10332), 0 states have call successors, (0), 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 06:47:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 10332 transitions. [2025-01-09 06:47:17,079 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 10332 transitions. Word has length 344 [2025-01-09 06:47:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:17,080 INFO L471 AbstractCegarLoop]: Abstraction has 6912 states and 10332 transitions. [2025-01-09 06:47:17,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 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 06:47:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 10332 transitions. [2025-01-09 06:47:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-01-09 06:47:17,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:17,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:17,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:47:17,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:17,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2109790043, now seen corresponding path program 1 times [2025-01-09 06:47:17,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:17,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238964964] [2025-01-09 06:47:17,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:17,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-09 06:47:18,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-09 06:47:18,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:18,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:19,216 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 06:47:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238964964] [2025-01-09 06:47:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238964964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:19,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:19,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:47:19,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364758866] [2025-01-09 06:47:19,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:19,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:47:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:19,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:47:19,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:47:19,218 INFO L87 Difference]: Start difference. First operand 6912 states and 10332 transitions. Second operand has 6 states, 6 states have (on average 57.5) internal successors, (345), 6 states have internal predecessors, (345), 0 states have call successors, (0), 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 06:47:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:19,660 INFO L93 Difference]: Finished difference Result 19838 states and 29620 transitions. [2025-01-09 06:47:19,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:47:19,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.5) internal successors, (345), 6 states have internal predecessors, (345), 0 states have call successors, (0), 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 345 [2025-01-09 06:47:19,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:19,675 INFO L225 Difference]: With dead ends: 19838 [2025-01-09 06:47:19,675 INFO L226 Difference]: Without dead ends: 16118 [2025-01-09 06:47:19,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:47:19,683 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 1460 mSDsluCounter, 5913 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 7429 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:19,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 7429 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:47:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16118 states. [2025-01-09 06:47:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16118 to 12652. [2025-01-09 06:47:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12652 states, 12651 states have (on average 1.4933206861117698) internal successors, (18892), 12651 states have internal predecessors, (18892), 0 states have call successors, (0), 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 06:47:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12652 states to 12652 states and 18892 transitions. [2025-01-09 06:47:19,807 INFO L78 Accepts]: Start accepts. Automaton has 12652 states and 18892 transitions. Word has length 345 [2025-01-09 06:47:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:19,807 INFO L471 AbstractCegarLoop]: Abstraction has 12652 states and 18892 transitions. [2025-01-09 06:47:19,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.5) internal successors, (345), 6 states have internal predecessors, (345), 0 states have call successors, (0), 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 06:47:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 12652 states and 18892 transitions. [2025-01-09 06:47:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 06:47:19,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:19,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:19,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:47:19,815 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:19,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1598724205, now seen corresponding path program 1 times [2025-01-09 06:47:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972881598] [2025-01-09 06:47:19,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:19,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 06:47:20,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 06:47:20,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:20,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:21,904 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 06:47:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972881598] [2025-01-09 06:47:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972881598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:21,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:21,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 06:47:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105862710] [2025-01-09 06:47:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:21,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 06:47:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:21,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 06:47:21,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:47:21,906 INFO L87 Difference]: Start difference. First operand 12652 states and 18892 transitions. Second operand has 9 states, 9 states have (on average 38.44444444444444) internal successors, (346), 9 states have internal predecessors, (346), 0 states have call successors, (0), 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 06:47:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:22,082 INFO L93 Difference]: Finished difference Result 19622 states and 29281 transitions. [2025-01-09 06:47:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 06:47:22,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 38.44444444444444) internal successors, (346), 9 states have internal predecessors, (346), 0 states have call successors, (0), 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 346 [2025-01-09 06:47:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:22,095 INFO L225 Difference]: With dead ends: 19622 [2025-01-09 06:47:22,096 INFO L226 Difference]: Without dead ends: 13068 [2025-01-09 06:47:22,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 06:47:22,104 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 4204 mSDsluCounter, 8261 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4204 SdHoareTripleChecker+Valid, 9823 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:22,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4204 Valid, 9823 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:47:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13068 states. [2025-01-09 06:47:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13068 to 12732. [2025-01-09 06:47:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12732 states, 12731 states have (on average 1.4924200769774567) internal successors, (19000), 12731 states have internal predecessors, (19000), 0 states have call successors, (0), 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 06:47:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12732 states to 12732 states and 19000 transitions. [2025-01-09 06:47:22,216 INFO L78 Accepts]: Start accepts. Automaton has 12732 states and 19000 transitions. Word has length 346 [2025-01-09 06:47:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:22,217 INFO L471 AbstractCegarLoop]: Abstraction has 12732 states and 19000 transitions. [2025-01-09 06:47:22,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.44444444444444) internal successors, (346), 9 states have internal predecessors, (346), 0 states have call successors, (0), 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 06:47:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 12732 states and 19000 transitions. [2025-01-09 06:47:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 06:47:22,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:22,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:22,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:47:22,226 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:22,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:22,226 INFO L85 PathProgramCache]: Analyzing trace with hash 479357673, now seen corresponding path program 1 times [2025-01-09 06:47:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:22,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000529185] [2025-01-09 06:47:22,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:22,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 06:47:22,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 06:47:22,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:22,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:23,515 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 06:47:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:23,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000529185] [2025-01-09 06:47:23,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000529185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:23,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:23,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:47:23,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075308100] [2025-01-09 06:47:23,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:23,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:47:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:23,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:47:23,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:47:23,518 INFO L87 Difference]: Start difference. First operand 12732 states and 19000 transitions. Second operand has 8 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 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 06:47:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:24,176 INFO L93 Difference]: Finished difference Result 29240 states and 43598 transitions. [2025-01-09 06:47:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:47:24,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 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 346 [2025-01-09 06:47:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:24,199 INFO L225 Difference]: With dead ends: 29240 [2025-01-09 06:47:24,199 INFO L226 Difference]: Without dead ends: 22650 [2025-01-09 06:47:24,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 06:47:24,210 INFO L435 NwaCegarLoop]: 2508 mSDtfsCounter, 2608 mSDsluCounter, 11625 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2608 SdHoareTripleChecker+Valid, 14133 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:24,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2608 Valid, 14133 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:47:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22650 states. [2025-01-09 06:47:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22650 to 22062. [2025-01-09 06:47:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22062 states, 22061 states have (on average 1.4911382076968405) internal successors, (32896), 22061 states have internal predecessors, (32896), 0 states have call successors, (0), 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 06:47:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22062 states to 22062 states and 32896 transitions. [2025-01-09 06:47:24,374 INFO L78 Accepts]: Start accepts. Automaton has 22062 states and 32896 transitions. Word has length 346 [2025-01-09 06:47:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:24,375 INFO L471 AbstractCegarLoop]: Abstraction has 22062 states and 32896 transitions. [2025-01-09 06:47:24,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 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 06:47:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 22062 states and 32896 transitions. [2025-01-09 06:47:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 06:47:24,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:24,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:24,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:47:24,387 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:24,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1665616351, now seen corresponding path program 1 times [2025-01-09 06:47:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246314937] [2025-01-09 06:47:24,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:24,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:24,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 06:47:25,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 06:47:25,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:25,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:26,684 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 06:47:26,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:26,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246314937] [2025-01-09 06:47:26,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246314937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:26,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:26,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:47:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063524332] [2025-01-09 06:47:26,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:26,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:47:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:26,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:47:26,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:47:26,687 INFO L87 Difference]: Start difference. First operand 22062 states and 32896 transitions. Second operand has 8 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 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 06:47:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:27,605 INFO L93 Difference]: Finished difference Result 52392 states and 78110 transitions. [2025-01-09 06:47:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:47:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 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 346 [2025-01-09 06:47:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:27,641 INFO L225 Difference]: With dead ends: 52392 [2025-01-09 06:47:27,641 INFO L226 Difference]: Without dead ends: 41038 [2025-01-09 06:47:27,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:47:27,660 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 4513 mSDsluCounter, 5122 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4513 SdHoareTripleChecker+Valid, 6405 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:27,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4513 Valid, 6405 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:47:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41038 states. [2025-01-09 06:47:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41038 to 28134. [2025-01-09 06:47:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28134 states, 28133 states have (on average 1.4919134112963424) internal successors, (41972), 28133 states have internal predecessors, (41972), 0 states have call successors, (0), 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 06:47:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28134 states to 28134 states and 41972 transitions. [2025-01-09 06:47:27,939 INFO L78 Accepts]: Start accepts. Automaton has 28134 states and 41972 transitions. Word has length 346 [2025-01-09 06:47:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:27,939 INFO L471 AbstractCegarLoop]: Abstraction has 28134 states and 41972 transitions. [2025-01-09 06:47:27,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 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 06:47:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 28134 states and 41972 transitions. [2025-01-09 06:47:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 06:47:27,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:27,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:27,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:47:27,959 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:27,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1269980452, now seen corresponding path program 1 times [2025-01-09 06:47:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076377577] [2025-01-09 06:47:27,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:28,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 06:47:29,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 06:47:29,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:29,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:30,328 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 06:47:30,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:30,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076377577] [2025-01-09 06:47:30,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076377577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:30,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:30,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:47:30,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546963833] [2025-01-09 06:47:30,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:30,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:47:30,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:30,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:47:30,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:47:30,330 INFO L87 Difference]: Start difference. First operand 28134 states and 41972 transitions. Second operand has 6 states, 6 states have (on average 57.666666666666664) internal successors, (346), 6 states have internal predecessors, (346), 0 states have call successors, (0), 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 06:47:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:30,476 INFO L93 Difference]: Finished difference Result 66982 states and 99864 transitions. [2025-01-09 06:47:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:47:30,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.666666666666664) internal successors, (346), 6 states have internal predecessors, (346), 0 states have call successors, (0), 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 346 [2025-01-09 06:47:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:30,524 INFO L225 Difference]: With dead ends: 66982 [2025-01-09 06:47:30,525 INFO L226 Difference]: Without dead ends: 51582 [2025-01-09 06:47:30,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:47:30,548 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 787 mSDsluCounter, 6275 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 7846 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:30,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 7846 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:47:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51582 states. [2025-01-09 06:47:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51582 to 49062. [2025-01-09 06:47:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49062 states, 49061 states have (on average 1.493080043211512) internal successors, (73252), 49061 states have internal predecessors, (73252), 0 states have call successors, (0), 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 06:47:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49062 states to 49062 states and 73252 transitions. [2025-01-09 06:47:30,948 INFO L78 Accepts]: Start accepts. Automaton has 49062 states and 73252 transitions. Word has length 346 [2025-01-09 06:47:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:30,949 INFO L471 AbstractCegarLoop]: Abstraction has 49062 states and 73252 transitions. [2025-01-09 06:47:30,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.666666666666664) internal successors, (346), 6 states have internal predecessors, (346), 0 states have call successors, (0), 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 06:47:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 49062 states and 73252 transitions. [2025-01-09 06:47:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-01-09 06:47:30,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:30,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:30,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:47:30,972 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:30,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1885198149, now seen corresponding path program 1 times [2025-01-09 06:47:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460935195] [2025-01-09 06:47:30,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:31,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-01-09 06:47:31,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-01-09 06:47:31,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:31,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:32,646 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 06:47:32,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:32,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460935195] [2025-01-09 06:47:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460935195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:47:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043978091] [2025-01-09 06:47:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:47:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:47:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:47:32,649 INFO L87 Difference]: Start difference. First operand 49062 states and 73252 transitions. Second operand has 8 states, 8 states have (on average 43.375) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 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 06:47:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:33,192 INFO L93 Difference]: Finished difference Result 73825 states and 110223 transitions. [2025-01-09 06:47:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:47:33,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.375) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 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 347 [2025-01-09 06:47:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:33,234 INFO L225 Difference]: With dead ends: 73825 [2025-01-09 06:47:33,234 INFO L226 Difference]: Without dead ends: 49070 [2025-01-09 06:47:33,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 06:47:33,269 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 1704 mSDsluCounter, 5716 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 7136 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:33,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 7136 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:47:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49070 states. [2025-01-09 06:47:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49070 to 26632. [2025-01-09 06:47:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26632 states, 26631 states have (on average 1.493597686906237) internal successors, (39776), 26631 states have internal predecessors, (39776), 0 states have call successors, (0), 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 06:47:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 39776 transitions. [2025-01-09 06:47:33,549 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 39776 transitions. Word has length 347 [2025-01-09 06:47:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:33,549 INFO L471 AbstractCegarLoop]: Abstraction has 26632 states and 39776 transitions. [2025-01-09 06:47:33,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.375) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 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 06:47:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 39776 transitions. [2025-01-09 06:47:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-01-09 06:47:33,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:33,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:33,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:47:33,562 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:33,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:33,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1728436166, now seen corresponding path program 1 times [2025-01-09 06:47:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475266752] [2025-01-09 06:47:33,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:33,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 06:47:34,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 06:47:34,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:34,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:35,183 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 06:47:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475266752] [2025-01-09 06:47:35,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475266752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:35,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:35,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:47:35,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764551759] [2025-01-09 06:47:35,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:35,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:47:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:35,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:47:35,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:47:35,185 INFO L87 Difference]: Start difference. First operand 26632 states and 39776 transitions. Second operand has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:47:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:35,657 INFO L93 Difference]: Finished difference Result 52418 states and 78280 transitions. [2025-01-09 06:47:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:47:35,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-01-09 06:47:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:35,685 INFO L225 Difference]: With dead ends: 52418 [2025-01-09 06:47:35,685 INFO L226 Difference]: Without dead ends: 26792 [2025-01-09 06:47:35,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:47:35,706 INFO L435 NwaCegarLoop]: 1431 mSDtfsCounter, 1524 mSDsluCounter, 5715 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 7146 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:35,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 7146 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:47:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26792 states. [2025-01-09 06:47:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26792 to 26792. [2025-01-09 06:47:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26792 states, 26791 states have (on average 1.491844276062857) internal successors, (39968), 26791 states have internal predecessors, (39968), 0 states have call successors, (0), 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 06:47:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26792 states to 26792 states and 39968 transitions. [2025-01-09 06:47:35,936 INFO L78 Accepts]: Start accepts. Automaton has 26792 states and 39968 transitions. Word has length 348 [2025-01-09 06:47:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:35,937 INFO L471 AbstractCegarLoop]: Abstraction has 26792 states and 39968 transitions. [2025-01-09 06:47:35,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:47:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 26792 states and 39968 transitions. [2025-01-09 06:47:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-01-09 06:47:35,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:35,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:35,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:47:35,961 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:35,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2145810357, now seen corresponding path program 1 times [2025-01-09 06:47:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:35,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562766487] [2025-01-09 06:47:35,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:36,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 06:47:36,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 06:47:36,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:36,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:37,283 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 06:47:37,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:37,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562766487] [2025-01-09 06:47:37,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562766487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:37,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:37,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:47:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549473216] [2025-01-09 06:47:37,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:37,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:47:37,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:37,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:47:37,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:47:37,284 INFO L87 Difference]: Start difference. First operand 26792 states and 39968 transitions. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:47:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:37,577 INFO L93 Difference]: Finished difference Result 40420 states and 60295 transitions. [2025-01-09 06:47:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:47:37,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-01-09 06:47:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:37,604 INFO L225 Difference]: With dead ends: 40420 [2025-01-09 06:47:37,604 INFO L226 Difference]: Without dead ends: 26800 [2025-01-09 06:47:37,619 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 06:47:37,619 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 1268 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 4301 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:37,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 4301 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:47:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26800 states. [2025-01-09 06:47:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26800 to 26798. [2025-01-09 06:47:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26798 states, 26797 states have (on average 1.491734149345076) internal successors, (39974), 26797 states have internal predecessors, (39974), 0 states have call successors, (0), 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 06:47:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26798 states to 26798 states and 39974 transitions. [2025-01-09 06:47:37,833 INFO L78 Accepts]: Start accepts. Automaton has 26798 states and 39974 transitions. Word has length 348 [2025-01-09 06:47:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:37,833 INFO L471 AbstractCegarLoop]: Abstraction has 26798 states and 39974 transitions. [2025-01-09 06:47:37,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:47:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 26798 states and 39974 transitions. [2025-01-09 06:47:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-09 06:47:37,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:37,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:37,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:47:37,896 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:37,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 779371729, now seen corresponding path program 1 times [2025-01-09 06:47:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146941233] [2025-01-09 06:47:37,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:37,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 06:47:39,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 06:47:39,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:39,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:40,080 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 06:47:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:40,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146941233] [2025-01-09 06:47:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146941233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:40,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:47:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769135465] [2025-01-09 06:47:40,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:40,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:47:40,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:40,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:47:40,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:47:40,081 INFO L87 Difference]: Start difference. First operand 26798 states and 39974 transitions. Second operand has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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 06:47:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:41,411 INFO L93 Difference]: Finished difference Result 52383 states and 78148 transitions. [2025-01-09 06:47:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:47:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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 349 [2025-01-09 06:47:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:41,446 INFO L225 Difference]: With dead ends: 52383 [2025-01-09 06:47:41,446 INFO L226 Difference]: Without dead ends: 38738 [2025-01-09 06:47:41,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:47:41,464 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 2128 mSDsluCounter, 5948 mSDsCounter, 0 mSdLazyCounter, 3095 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 7159 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:41,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 7159 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3095 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 06:47:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38738 states. [2025-01-09 06:47:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38738 to 38544. [2025-01-09 06:47:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38544 states, 38543 states have (on average 1.4924629634434268) internal successors, (57524), 38543 states have internal predecessors, (57524), 0 states have call successors, (0), 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 06:47:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38544 states to 38544 states and 57524 transitions. [2025-01-09 06:47:41,772 INFO L78 Accepts]: Start accepts. Automaton has 38544 states and 57524 transitions. Word has length 349 [2025-01-09 06:47:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:41,772 INFO L471 AbstractCegarLoop]: Abstraction has 38544 states and 57524 transitions. [2025-01-09 06:47:41,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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 06:47:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 38544 states and 57524 transitions. [2025-01-09 06:47:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-09 06:47:41,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:41,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:41,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 06:47:41,869 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:41,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash -580807992, now seen corresponding path program 1 times [2025-01-09 06:47:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406179895] [2025-01-09 06:47:41,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:41,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 06:47:43,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 06:47:43,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:43,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:44,297 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 06:47:44,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:44,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406179895] [2025-01-09 06:47:44,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406179895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:44,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:44,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:47:44,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533082957] [2025-01-09 06:47:44,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:44,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:47:44,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:44,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:47:44,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:47:44,299 INFO L87 Difference]: Start difference. First operand 38544 states and 57524 transitions. Second operand has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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 06:47:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:45,390 INFO L93 Difference]: Finished difference Result 58150 states and 86776 transitions. [2025-01-09 06:47:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:47:45,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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 349 [2025-01-09 06:47:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:45,429 INFO L225 Difference]: With dead ends: 58150 [2025-01-09 06:47:45,429 INFO L226 Difference]: Without dead ends: 38592 [2025-01-09 06:47:45,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:47:45,452 INFO L435 NwaCegarLoop]: 1114 mSDtfsCounter, 1576 mSDsluCounter, 4449 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 5563 SdHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:45,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 5563 Invalid, 2353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 06:47:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38592 states. [2025-01-09 06:47:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38592 to 38584. [2025-01-09 06:47:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38584 states, 38583 states have (on average 1.4921597594795635) internal successors, (57572), 38583 states have internal predecessors, (57572), 0 states have call successors, (0), 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 06:47:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38584 states to 38584 states and 57572 transitions. [2025-01-09 06:47:45,838 INFO L78 Accepts]: Start accepts. Automaton has 38584 states and 57572 transitions. Word has length 349 [2025-01-09 06:47:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:45,838 INFO L471 AbstractCegarLoop]: Abstraction has 38584 states and 57572 transitions. [2025-01-09 06:47:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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 06:47:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 38584 states and 57572 transitions. [2025-01-09 06:47:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-09 06:47:45,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:45,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:45,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 06:47:45,856 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:45,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash 441836189, now seen corresponding path program 1 times [2025-01-09 06:47:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:45,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540771071] [2025-01-09 06:47:45,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:45,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 06:47:45,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 06:47:45,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:47:45,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:47:46,460 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 06:47:46,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:47:46,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540771071] [2025-01-09 06:47:46,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540771071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:47:46,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:47:46,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:47:46,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668080180] [2025-01-09 06:47:46,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:47:46,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:47:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:47:46,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:47:46,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:47:46,462 INFO L87 Difference]: Start difference. First operand 38584 states and 57572 transitions. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 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 06:47:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:47:46,600 INFO L93 Difference]: Finished difference Result 76906 states and 114744 transitions. [2025-01-09 06:47:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:47:46,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 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 349 [2025-01-09 06:47:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:47:46,637 INFO L225 Difference]: With dead ends: 76906 [2025-01-09 06:47:46,637 INFO L226 Difference]: Without dead ends: 38616 [2025-01-09 06:47:46,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:47:46,665 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 0 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4714 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:47:46,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4714 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:47:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38616 states. [2025-01-09 06:47:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38616 to 38616. [2025-01-09 06:47:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38616 states, 38615 states have (on average 1.4917519098795804) internal successors, (57604), 38615 states have internal predecessors, (57604), 0 states have call successors, (0), 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 06:47:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38616 states to 38616 states and 57604 transitions. [2025-01-09 06:47:46,972 INFO L78 Accepts]: Start accepts. Automaton has 38616 states and 57604 transitions. Word has length 349 [2025-01-09 06:47:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:47:46,972 INFO L471 AbstractCegarLoop]: Abstraction has 38616 states and 57604 transitions. [2025-01-09 06:47:46,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 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 06:47:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 38616 states and 57604 transitions. [2025-01-09 06:47:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 06:47:46,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:47:46,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:46,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 06:47:46,988 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:47:46,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:47:46,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1693640422, now seen corresponding path program 1 times [2025-01-09 06:47:46,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:47:46,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364509475] [2025-01-09 06:47:46,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:47:46,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:47:47,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes.